I have been reading Algorithmic Game Theory, a great book edited by Noam Nisan, Tim Roughgarden, Éva Tardos, and Vijay Vazirani. A non-printable version of the book can be downloaded here (PDF – 5.17 MB).
[ image courtesy of Éva Tardos, and Vijay Vazirani ]
Prior to reading this book, my knowledge of Game Theory was pretty much non-existent. Now, at least I know a tiny, tiny bit on the subject. I am somewhat intrigued by the fact that even very simple two-player strategic games can be so hard to analyze. Moreover, Nash equilibria are sometimes quite hard to find.
I have also been playing around with Gambit, a library of game theory software and tools for the construction and analysis of finite extensive and strategic games. When analyzing two-player strategic games in which each player has a lot of strategies to choose from, Gambit is quite helpful and fun to use.
Some papers on the computation of equilibria:
- Computation of Equilibria in Finite Games (by Richard McKelvey, Andrew McLennan)
- Computing Equilibria for Two Person Games (by Bernhard von Stengel)
- Computing Equilibria in Multi-Player Games (by Christos Papadimitriou, Tim Roughgarden)
- Smoothing techniques for computing Nash equilibria of sequential games (by Samid Hoda, Andrew Gilpin, Javier Pena)
Some papers on graphical games:
- Game Networks (by Pierfrancesco La Mura)
- Graphical Models for Game Theory (by Michael Kearns, et alia)
- Correlated equilibria and graphical games (by Sham Kakade et alia)
- Nash propagation for loopy graphical games (by Luis E. Ortiz, Michael Kearns)
- An Efficient Exact Algorithm for Singly Connected Graphical Games (by Michael L. Littman, Michael Kearns, Satinder Singh)
- Multi-Agent Algorithms for Solving Graphical Games (by David Vickrey, Daphne Koller)
Some courses on Algorithmic Game Theory:
- Algorithmic Game Theory (Cornell CS 684)
- Computational Game Theory (UPenn CIS 620)
- Seminar on Algorithmic Aspects of Game Theory (Berkeley CS 294)
- Topics in Algorithmic Game Theory (Caltech CS/SS 241a)
- Game Theory with Engineering Applications (MIT 6.254)
Some interesting PhD theses:
- Selfish Routing (by Tim Roughgarden, 2002)
- Non-cooperative Games (by John Nash, 1950)
Last but not least, some non-technical articles:
- The Complexity of Competition (by Prof. Christos Papadimitriou)
- The Network Game (by Prof. Asuman Ozdaglar)
Tags: Algorithmic Game Theory, Éva Tardos, Books, Christos Papadimitriou, ebooks, Gambit, Game Theory, Noam Nisan, Scientific Papers, Tim Roughgarden, Vijay Vazirani
