Following is a list of textbooks, papers and useful links that I've came
across. I'll keep on adding more stuff as I read more.
Particularly, I'm interested in study of population games where a fraction of
players form a coalition. I'm also interested in analysing convergence
properties of these games i.e. analyse whether given a learning rule,
players reach specified equilibrium or not.
Textbooks
Algorithmic Game Theory, Noam Nisan, Tim Roughgarden, Eva Tardos, and Vijay V. Vazirani, editors,
Cambridge University Press, Cambridge, 2007.
Population Games and Evolutionary Dynamics by William H. Sandholm. To
be published by MIT Press.
http://www.ssc.wisc.edu/~whs/book/index.html
The Theory of Learning in Games, By Drew Fudenberg, David K. Levine. The MIT Press.
Evolution and the Theory of Games, John Maynard Smith. Cambridge University Press.
Papers
TBR stands for To Be Read.
(TBR)D. Monderer and L. S. Shapley. Potential games. Games and Economic Behavior, 14: 124--143, 1996.
(TBR) Henry Lin and Tim Roughgarden and Eva Tardos, On Braess's Paradox.
(TBR)R. La, V. Anantharam. Optimal routing control: Game theoretic approach. Proc. 1997 CDC Conf.
(TBR) D. Acemoglu, R. Johari, and A. Ozdaglar. Partially optimal routing. IEEE Journal on
Selected Areas in Communications, 25(6):1148–1160, 2007.
(TBR) A. Vetta. Nash equilibria in competitive societies with applications to facility location,
traffic routing and auctions. In Annual IEEE Symposium on Foundations of Computer Science, pages 416--425, 2002.
(TBR) E. Anshelevich, A. Dasgupta, J. Kleinberg, E. Tardos, T. Wexler, and T. Roughgarden.
The Price of Stability for Network Design with Fair Cost Allocation. In FOCS, 2004.
(TBR) Joan Feigenbaum, Christos Papadimitriou, and Scott Shenker. Sharing the cost of multicast
transmissions. In Thirty-Second Annual ACM Symposium on Theory of Computing (STOC00), May 2000.
Price of collusion
Hayrapetyan, A., Tardos, É., and Wexler, T. 2006. The effect of collusion in
congestion games. In Proceedings of the Thirty-Eighth Annual ACM Symposium on
theory of Computing (Seattle, WA, USA, May 21 - 23, 2006). STOC '06.
Malicious users / Price of Malice
Babaioff, M., Kleinberg, R., and Papadimitriou, C. H. 2007. Congestion games
with malicious players. In Proceedings of the 8th ACM Conference on Electronic
Commerce (San Diego, California, USA, June 11 - 15, 2007). EC '07. ACM, New York, NY, 103-112.
(TBR)Karakostas, G. and Viglas, A. 2007. Equilibria for networks with malicious users.
Math. Program. 110, 3 (May. 2007), 591-613.
(TBR) Malicious Users in Unstructured Networks, Theodorakopoulos, G. Baras, J. S. Infocom 2007.
(TBR)Moscibroda, T., Schmid, S., and Wattenhofer, R. 2006. When selfish meets evil:
byzantine players in a virus inoculation game. In Proceedings of the Twenty-Fifth Annual
ACM Symposium on Principles of Distributed Computing (Denver, Colorado, USA, July 23 - 26, 2006). PODC '06.
Complexity of finding nash equilibrium
(TBR) Constantinos Daskalakis, Christos Papadimitriou, "Computing Equilibria
in Anonymous Games," focs, pp. 83-93, 48th Annual IEEE Symposium on Foundations
of Computer Science (FOCS'07), 2007
(TBR) I.Milchtaich. Congestion games with Player-Specific Payoff Functions. Games and economic behavior, 1996.
(TBR) Daskalakis, C., Goldberg, P. W., and Papadimitriou, C. H. 2006. The complexity
of computing a Nash equilibrium. In Proceedings of the Thirty-Eighth Annual ACM Symposium
on theory of Computing (Seattle, WA, USA, May 21 - 23, 2006). STOC '06.
(TBR) Kousha Etessami, Mihalis Yannakakis, "On the Complexity of Nash Equilibria
and Other Fixed Points (Extended Abstract)," focs, pp. 113-123, 48th Annual IEEE
Symposium on Foundations of Computer Science (FOCS'07), 2007
(TBR) Fabrikant A. and Papadimitriou C. and Talwar K. The complexity of
pure nash equilibria. In Proc. of the 36th ACM Symp. on Theory of Computing (STOC '04), 2004.
Learning/Reaching equilibrium
If history repeats itself, and the unexpected always happens, how incapable must Man be of learning from experience.
- George Bernard Shaw
(TBR)Fischer, S., Räcke, H., and Vöcking, B. 2006. Fast convergence to Wardrop equilibria
by adaptive sampling methods. In Proceedings of the Thirty-Eighth Annual ACM Symposium on
theory of Computing (Seattle, WA, USA, May 21 - 23, 2006). STOC '06.
(TBR) Richard Cole and Yevgeniy Dodis and Tim Roughgarden, "How Much Can Taxes Help Selfish Routing?".
(TBR) Wu, F. and Zhang, L. 2007. Proportional response dynamics leads to market
equilibrium. In Proceedings of the Thirty-Ninth Annual ACM Symposium on theory of
Computing (San Diego, California, USA, June 11 - 13, 2007). STOC '07.
(TBR) T. Roughgarden. The price of anarchy is independent of the network topology. In Proceedings
of the 34th ACM Symposium on the Theory of Computing, 2002. 428-437.
(TBR) E. Altman, Y. Hayel and H. Kameda, "Evolutionary dynamics and potential
games in non-cooperative routing", proceedings of the workshop "Wireless Networks:
Communication, Cooperation and Competition (WNC3 2007)", April 16, 2007, Limassol, Cyprus.
(TBR) E. Altman, N. Bonneau , M. Debbah, and G. Caire, , An Evolutionary Game Perspective
to ALOHA with Power Control, , 19th International Teletraffic Congress, August 29 -
September 2, 2005, Beijing, China.
(TBR) Tembine Hamidou, Eitan Altman, El-Azouzi Rachid, Yezekael Hayel, "Multiple
Access Game in Ad-hoc Network", The First International Workshop on Game Theory for
Communication networks (GameComm), 22 October 2007, Nantes, France
(TBR) Bowling, M., and Veloso, M. (2001). Rational and convergent learning
in stochastic games. Proceedings of the Seventeenth International Joint
Conference on Artificial Intelligence. Seattle, WA.
Michael Bowling and Manuela Veloso. Multiagent learning using a
variable learning rate. Artificial Intelligence, 2002.
S. Singh, M. Kearns, and Y. Mansour. Nash convergence of gradient dynamics
in general-sum games. In Proc. of the 16th Conference on Uncertainty
in Artificial Intelligence, 2000.
Price of anarchy
(TBR)Roughgarden, T. 2005. Selfish routing with atomic players. In Proceedings of the
Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms
(TBR) R. Cominetti, J.R. Correa and N.E. Stier Moses. "The Impact of Oligopolistic Competition in Networks." ICALP 2006.
Roughgarden, T. 2001. Stackelberg scheduling strategies. In Proceedings of the
Thirty-Third Annual ACM Symposium on theory of Computing (Hersonissos, Greece). STOC '01.
(TBR) J.R. Correa and N.E. Stier-Moses. "Stackelberg Routing in Atomic Network Games". Draft, 2007.
(TBR)Hayrapetyan, A., Tardos, É., and Wexler, T. 2005. A network pricing game
for selfish traffic. In Proceedings of the Twenty-Fourth Annual ACM Symposium
on Principles of Distributed Computing (Las Vegas, NV, USA, July 17 - 20, 2005). PODC '05. ACM, New York, NY, 284-291.
(TBR)Christodoulou, G. and Koutsoupias, E. 2005. The price of anarchy of finite
congestion games. In Proceedings of the Thirty-Seventh Annual ACM Symposium on
theory of Computing, 2005.
(TBR)Baruch Awerbuch, Yossi Azar, Amir Epstein: Large the price of routing unsplittable flow. STOC 2005.
(TBR) T. Roughgarden and E. Tardos. Bounding the inefficiency of
equilibria in nonatomic congestion games. Technical Report TR2002-1866, Cornell, June 2001.
(TBR) T. Roughgarden. Designing networks for selfish users is hard. In Proceedings of the
42nd Annual Symposium on Foundations of Computer Science, pages 472--481, 2001.
T. Roughgarden and E. Tardos. How bad is selfish routing? Journal of the ACM, 49(2):236 -- 259, March 2002.
E. Koutsoupias and C. H. Papadimitriou, "Worst-case Equilibria,"
Proceedings of the 16th Annual Symposium on Theoretical Aspects of Computer Science.
C. Papadimitriou, "Algorithms, Games, and the Internet," in Proceedings of the 33rd Symposium on Theory of Computing,
ACM Press, New York, pages 749--753, 2001.
Auctions
S. DeVries and R. Vohra. Combinatorial auctions: A survey. 2000.
Poker
http://poker.cs.ualberta.ca/
L. Barone and L. While. An adaptive learning model for simplified poker using evolutionary algorithms.
Technical Report 99/1, Department of Computer Science, The University of Western Australia, 1999.