|
CSE 599m: Algorithms and Economics of Networks
|
|
CSE 599m Reading Group
Meeting time: 1:30 pm - 3:00 pm on
Fridays
Schedule:
- Friday, April 13th, CSE 624: Ben - J. Kleinberg, P.
Raghavan. Query Incentive Networks. Proc. 46th IEEE Symposium on Foundations of
Computer Science, 2005.
- Friday, April 20th, no meeting.
- Friday, April 27th, CSE 216: Ben and Elisa - "On
Threshold Behavior in Query Incentive Networks," EC 2007.
- Friday, May 4th: Ning - D. Kempe, J.
Kleinberg, E. Tardos, Maximizing the spread of influence through a social
network, KDD'03, D. Kempe, J.
Kleinberg, E. Tardos, Influential nodes in a diffusion model for social
networks, ICALP'05, E. Mossel, S. Roch, On the
submodularity of influence in social networks, STOC'07.
- Friday, May 25th, CSE 624: Vahab and Vibhor - Alex Fabrikant and
Christos Papadimitriou. The Search for Equilibria: Sink Equilibria, Unit Recall
Games, and BGP Oscillations In submission.
Possible papers for reading group:
Alex Fabrikant and
Christos Papadimitriou. The Search for Equilibria: Sink Equilibria, Unit Recall
Games, and BGP Oscillations In submission.
Sergiu Hart and Yishay
Mansour. The Communication Complexity of Uncoupled Nash Equilibrium Procedures
Constantinos Daskalakis, Alexandros
G. Dimakis, Elchanan Mossel. Connectivity and Equilibrium in Random Games.
arXiv 2007.
Elchanan Mossel, Sebastien Roch, On
the Submodularity of Influence in Social Networks. To appear in STOC 2007.
Larry Blume,
David Easley, Jon Kleinberg, Eva Tardos. Trading Networks with Price-Setting
Agents. To appear in EC 2007.
Nicole
Immorlica, Jon Kleinberg, Mohammad Mahdian, Tom Wexler. The Role of
Compatibility in the Diffusion of Technologies through Social Networks. To
appear in EC 2007.
Yogeshwer
Sharma, David P. Williamson. Stackelberg thresholds in network routing games or
The value of altruism. To appear in EC 2007.
K. Pruhs
and J. Edmonds, Balanced Allocations of Cake, FOCS, 2006.
Greg Valiant and Tim
Roughgarden. Braess's Paradox in Large Random Graphs. EC 2006.
R.
Kleinberg, J. Kleinberg, Isomorphism and Embedding Problems for Infinite Limits
of Scale-Free Graphs. Proc. 16th ACM-SIAM Symposium on Discrete Algorithms,
2005.
J. Kleinberg, P.
Raghavan. Query Incentive Networks. Proc. 46th IEEE Symposium on Foundations of
Computer Science, 2005.
D. Achlioptas, A.
Clauset, D. Kempe, and C. Moore, On the bias of Traceroute sampling, STOC 2005.
G. Manku, M.
Naor, and U. Wieder. Know Thy Neighbor's Neighbor: The Power of Lookahead in
Randomized P2P Networks. In Proc. of ACM Symp. on Theory of Computing (STOC),
2004.
E. Anshelevich,
A. Dasgupta, J. Kleinberg, E. Tardos, T. Wexler, T. Roughgarden. The Price of
Stability for Network Design with Fair Cost Allocation. In FOCS 2004.
T. Roughgarden and
E. Tardos: How Bad is Selfish Routing? JACM, 2002.
J. Kleinberg. The
small-world phenomenon: An algorithmic perspective. Proc. 32nd ACM Symposium on
Theory of Computing, 2000.
|
 |
Computer Science & Engineering
University of Washington
Box 352350
Seattle, WA 98195-2350
(206) 543-1695 voice, (206) 543-2969 FAX
[comments to Abraham Flaxman]
|
CSE Home