|
CSE 599m: Algorithms and Economics of Networks - Course Announcement |
|
 CSE Home |
599m Home |
About Us |
Search |
Contact Info |
We live in an age where we are surrounded by giant networks of all sorts. Some of these networks are new developments, like networks of highways, the internet, and the world wide web. Some of them have been here since time immemorial, like the friendship network of social relationships, neural pathways in the brain, and mycelia (nature's internet). But regardless of age, these giant networks are available for research and engineering today as they have never been before. Dealing with these networks is challenging, due to their size and also because they arise from the strategic behavior of decentralized agents. This class will focus on mathematical theories as well as algorithmic and economic techniques for grappling with giant networks, and will be led by Abraham Flaxman and Vahab Mirrokni from the Microsoft Research Theory Group.
Topics included: n-player game theory, equilibrium, and convergence in games; the price of anarchy in selfish routing and congestion games; market equilibria and networks; mapping the internet and the bias of traceroute sampling; models of network formation including classical and modern random graphs; pagerank and personalized pagerank; clustering and partitioning of massive graphs; rank aggregation; diffusion and the spread of influence in social networks.
Course requirements:
 |
Computer Science & Engineering University of Washington Box 352350 Seattle, WA 98195-2350 (206) 543-1695 voice, (206) 543-2969 FAX [comments to Abraham Flaxman] |