# Readings

## Learning

Shamma, J., and G. Arslan. "Dynamic fictitious play, dynamic gradient play, and distributed convergence to Nash equilibria." *IEEE Transactions on Automatic Control* 50, no. 3 (March 2005): 312-327.

Singh, S. P., M. Kearns, and Y. Mansour. "Nash convergence of gradient dynamics in general-sum games." In *Proceedings of the Sixteenth Conference on Uncertainty in Artificial Intelligence* (UAI-2000). Stanford, CA, 2000, pp. 541–548.

Kandori, M., G. Mailath, and R. Rob. "Learning, mutation, and long run equilibria in games." *Econometrica* 61, no. 1 (1993): 29-56.

Kalai, E., and E. Lehrer. "Rational learning leads to Nash equilibrium." *Econometrica* 61, no. 5 (1993): 1019-1045.

Milgrom, P., and J. Roberts. "Rationalizability, learning and equilibrium in games with strategic complementarities." *Econometrica* 58, no. 6 (1990): 1255-1277.

## Repeated Games

Abreu, D., D. Pearce, and E. Stacchetti. "Toward a theory of discounted repeated games with imperfect monitoring." *Econometrica* 58, no. 5 (1990): 1041-1063.

## Combinatorial Auctions- Path Auctions

Nisan, N. "Bidding and allocation in combinatorial auctions." In *Proceedings of the 2nd ACM conference on Electronic Commerce.* Minneapolis, Minnesota, October 17-20, 2000, pp. 1-12.

Parkes, D., and L. Ungar. "Iterative combinatorial auctions: theory and practice." In *Proceedings of the Seventeenth Conference on Artificial Intelligence* (AAAI-00). 2000, pp. 74-81.

Parkes, D. "Optimal auction design for agents with hard valuation problems." In *Agent Mediated Electronic Commerce II: Towards Next Generation Agent-Based Electronic Commerce Systems* (LNAI 1788). Edited by Moukas, et al. New York, NY: Springer, 2000. ISBN: 3540677739.

(Earlier version In *Proceedings of the International Joint Conference on Artificial Intelligence Workshop on Agent Mediated Electronic Commerce*, AMEC-99. Stockholm, Sweden, 1999.)

Archer, A., and E. Tardos. "Frugal Path Mechanisms." In *Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms.* San Francisco, CA, January 6-8, 2002, pp. 991-999.

Elkind, E., A. Sahai, and K. Steiglitz. "Frugality in path auctions." In *Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms.* 2004, p. 18.

Czumaj, A., and A. Ronen. "On the expected payment of mechanisms for task allocation." In *Proceedings of ACM POD.* 2004, pp. 98-106.

Akcoglu, Aspnes, et al. "Graph-theoretic Auctions."

## Mechanism Design

Gallien, J. "Dynamic mechanism design for online commerce." Tech. Rep., Sloan School of Management, MIT, 2002.

Friedman, E., and D. Parkes. "Pricing WiFi at Starbucks Issues in Online Mechanism Design." In *Proceedings of the Fourth ACM Conference on Electronic Commerce* (EC'03). 2003.

Nisan, N., and A. Ronen. "Algorithmic Mechanism Design." In *Proceedings of the 31st Annual ACM Symposium on Theory of Computing.* May 1999.

## Games with Special Structure (Supermodular and Potential Games)

Monderer, D., and L. Shapley "Potential Games." *Games and Economic Behavior* 14 (1996): 124-143.

Vetta, A. "Nash Equilibria in Competitive Societies with Applications to Facility Location, Traffic Routing, and Auctions." In *Proceedings of the 43rd Symposium on Foundations of Computer Science.* November 16-19, 2002, p. 416.

Topkis, D. "Equilibrium points in nonzero-sum n-person submodular games." *SIAM Journal on Control and Optimization* 17 (1979): 773-787.

## Existence and Computation of Nash Equation, Correlated Equation, and Wardrop Equation

Hart, Sergiu, and David Schmeidler. "Existence of Correlated Equilibria." *Mathematics of Operations Research* 14, no. 1 (1989): 18-25.

Fabrikant, A., C. Papadimitriou, and K. Talwar. "The complexity of pure Nash equilibria." In *Proceedings of the 36th ACM Symposium on Theory of Computing* (STOC). Chicago, IL, 2004, pp. 604-612.

Papadimitriou, C. "Computing correlated equilibria in multi-player games." In *Proceedings of the 37th annual ACM Symposium on Theory of Computing* (SOTC). Baltimore, MD, 2005, pp. 49-56.

McKelvey, R., and A. McLennan. "Computation of equilibria in finite games." In *Handbook of Computational Economics*. Vol. I. Edited by H.M. Amman, D.A. Kendrick, and J. Rust. Amsterdam, The Netherlands: Elsevier, 1996, pp. 87-142. ISBN: 0444898573.

von Stengel, B. "Computing equilibria for two-person games." In *Handbook of Game Theory*. Vol. 3. Edited by R. J. Aumann and S. Hart. Amsterdam, The Netherlands: North-Holland, 2002, Chapter 45 (pp. 1723-1759). ISBN: 0444894284.

Papadimitriou, C., and T. Roughgarden. "Computing equilibria in multi-player games." In *Proceedings of the 16th annual ACM-SIAM Symposium on Discrete Algorithms.* Vancouver, British Columbia, 2005, pp. 82-91.

Lipton, R., E. Markakis, and A. Mehta. "Playing large games using simple strategies." In *Proceedings of the 4th ACM Conference on Electronic Commerce.* San Diego, CA, 2003, pp. 36-41.

## Equilibrium Selection

Carlsson, H., and E. van Damme. "Global Games and Equilibrium Selection." *Econometrica* 61, no. 5 (1993): 989-1018.

## Network Pricing and Cost Sharing

Jain, R., and P. Varaiya. "Combinatorial Exchange Mechanisms for Efficient Bandwidth Allocation." *Communications in Information and Systems* 3, no. 4 (2004): 305-324.

Feigenbaum, J., C. Papadimitriou, and S. Shenker. "Sharing the Cost of Multicast Transmissions." *Journal of Computer and System Sciences* 63, no. 1 (2001): 21-41.

Jain, K., and V. Vazirani. "Group strategyproofness and no subsidy via lp-duality." 1999. Unpublished.

Goldberg, A., J. Hartline, A. Wright. "Competitive auctions and digital goods." In *Proceedings of the 12th annual ACM-SIAM Symposium on Discrete Algorithms.* Washington, D.C., United States, 2001, pp. 735-744.

Laffont, J., and J. Tirole. *Competition in telecommunications*. Cambridge, MA: MIT Press, 2001. ISBN: 0262621509.

Shakkottai, S., and R. Srikant. "Economics of Network Pricing with Multiple ISPs." *INFOCOM* (March 2005). Miami, FL.

## Network Design

Anshelevich, E., A. Dasgupta, J. Kleinberg, E. Tardos, T. Wexler, and T. Roughgarden. "The Price of Stability for Network Design with Fair Cost Allocation." In *Proceedings of the 45th IEEE Symposium on Foundations of Computer Science.* 2004.

Anshelevich, E., A. Dasgupta, E. Tardos, and T. Wexler. "Near-Optimal Network Design with Selfish Agents." In *Proceedings of the 35th annual ACM Symposium on Theory of Computing.* San Diego, CA, 2003, p. 511-520.

Fabrikant, A., A. Luthra, E. Maneva, C. H. Papadimitriou, and S. Shenker. "On a Network Creation Game." *PODC* (July 13-16, 2003): 347-351.

## Price of Anarchy

Acemoglu, D., and A. Ozdaglar. "Competition and Efficiency in Congested Markets." *National Bureau of Economic Research* Working Papers, no. 11201 (2005).

Roughgarden, T., and E. Tardos. "How Bad is Selfish Routing?" *Journal of the ACM* 49, no. 2 (2002): 236-259.

———. "Bounding the Inefficiency of Equilibria in Nonatomic Congestion Games." *Games and Economic Behavior* 47, no. 2 (2004): 389-403.

Correa, J., A. Schulz, and N. Stier-Moses. "On the Inefficiency of Equilibria in Congestion Games." In *Proceedings of the 11th International Integer Programming and Combinatorial Optimization (IPCO) Conference.* Berlin, Germany, June 8-10, 2005, p. 167.

Perakis, G. "The Price of Anarchy when Costs are Non-separable and Asymmetric." In *Proceedings of the 10th International Integer Programming and Combinatorial Optimization (IPCO) Conference.* New York, NY, June 7-11, 2004, pp. 46-58.

Friedman, E. "A Generic Analysis of Selfish Routing." In *Proceedings of the 43rd IEEE Conference on Decision and Control.* 2004.

Mirrokni, V., and A. Vetta, "Convergence issues in competitive games." In *Proceedings of the 7th International Workshop on Approximation Algorithms for Combinatorial Optimization.* 2004.

## Graphical Games

Kearns, M., M. Littman, and S. Singh. "Graphical models for game theory." In *Proceedings of 17th Conference in Uncertainity in Artificial Intelligence.* 2001, pp. 253-260.

## P2P Networks

Qiu, D., and R. Srikant. "Modeling and Performance Analysis of BitTorrent-Like Peer-to-Peer Networks." In *Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications.* Portland, OR, September 2004, pp. 367-378.