Resources
Note: The papers on this page are for local access
only. Your machine's IP address has to end with .pitt.edu for you to be
able to download the papers. "Lecture notes" are publicly available.
Recommended text books:
Lecture Notes
Class Report
Papers on algorithmic mechanism design:
- Algorithms
for Selfish Agents by Nisan
- Algorithmic
Mechanism Design by Nisan and Ronen
- Mechanism Design. Chapter 2 in PhD
dissertation, Iterative Combinatorial Auctions: Achieving Economic and
Computational Efficiency by D.C. Parkes, May 2001 Department of Computer and
Information Science, University of Pennsylvania
- Mechanism Theory by M. Jackson,
Forthcoming in Encyclopedia of Life Support Systems, 2000.
- Vickrey Pricing in Network Routing: Fast Payment
Computation by Suri and Hershberger
- Distributed Algorithmic Mechanism Design:
Recent Results and Future Directions by Joan Feigenbaum and Scott Shenker,
to appear in Proceedings of the 2002 ACM Workshop on Discrete Algorithms and
Methods for Mobile Computing and Communications.
- Open Problems in Distributed
Mechanism Design by Scott Shenker, Presentation to DIMACS Workshop on
Computational Issues in Game Theory and Mechanism Design, Oct. 31, 2001.
- Truthful Mechanisms for One-Parameter Agents
by Aaron Archer and Eva Tardos in FOCS 2001. (added on 10/09)
- Computationally Feasible VCG Mechanisms
by Noam Nisan, Amir Ronen, 2000. (added on 10/09)
- Automated Mechanism Design: Complexity
Results Stemming from the Single-Agent Setting by Vincent Conitzer and
Tuomas Sandholm, 2002. (added on 10/09)
- Mechanism Design for Resource Bounded
Agents by Noa E. Kfir-Dahav, Dov Monderer, Moshe Tennenholtz, 1999. (added on 10/09)
- Distributed Games: From Mechanisms to
Protocols by Dov Monderer and Moshe Tennenholtz. (added on 11/02)
- What can a market compute, and at what
expense? by Yoav Shoham, Moshe Tennenholtz in IEEE Intelligent Systems,
1999. (added on 11/02)
- Subscription Mechanisms for Network
Formation by Suresh Mutuswami, Eyal Winter, 2000.
(added on 11/02)
Papers on routing, congestion control, and network pricing:
- Resource
Pricing and the Evolution of Congestion Control by Gibbens and Kelly
- A Modest
Proposal for Preventing Internet Congestion by Odlyzko
- Optimization
Problems in Congestion Control by Karp, Koutsoupias, Papadimitriou, Shenker
- Differential
QoS and Pricing in Networks by Key and McAuley
- Pricing
Congestible Resources, Chapter 4 by Varian
- Stackelberg
Scheduling by Roughgarden
- The Price of Selfish Routing by Marios Mavronicolas and Paul Spirakis, in
STOC 2001
- A BGP-based Mechanism for Lowest-Cost
Routing by Joan Feigenbaum, Christos Papadimitriou, Rahul Sami, and Scott
Shenker in Proceedings of the 21st Symposium on Principles of Distributed
Computing, ACM Press, New York, 2002, pp. 173-182.
- Selfish Behavior and Stability of the
Internet: A Game-Theoretic Analysis of TCP by Aditya Akella, Srinivasan
Seshan (CMU) Richard Karp, Scott Shenker, Christos Papadimitriou (ICSI/UC
Berkeley)
- Competitive Routing in Networks with
Polynomial Cost by Eitan Altman, Tamer Basar, Tania Jimenez, and Nahum
Shimkin, in INFOCOM 2000. (added on 10/09)
- Revenue-Maximizing Pricing and Capacity
Expansion in a Many-Users Regime by Tamer Basar, R. Srikant, in INFOCOM
2002 (added on 10/09)
- Preliminary Results in Routing Games by
João P. Hespanha, Stephan Bohacek, 2000. (added on 10/09)
- Pricing Congestible Network Resources by
Jeffrey K. MacKie-Mason, Hal R. Varian, in IEEE Journal on Selected Areas in
Communications, 1994. (added on 11/02)
- Internet Pricing With a Game Theoretical
Approach: Concepts and Examples by Xi-Ren Cao, Hong-Xia Shen, Rodolfo
Milito, and Patrica Wirth, 2002 (added on 11/04)
Papers on the price of anarchy:
Papers on auctions:
- A
survey
- Bidding
and Allocation in Combinatorial Auctions by Nisan
- Iterative
Combinatorial Auctions: Theory and Practice by Parkes and Ungar
- Optimal
Auction Design for Agents with Hard Valuation Problems by Parkes
- Graph-theoretic
auctions by Akcoglu, Aspnes, et al.
- Incentive-compatible
On-line Auctions by Lavi and Nisan
- "Cost Sharing of a Homogeneous Good:
Average versus Serial Methods," by Moulin and
Shenker
- Sharing the Cost of
Multicast Transmissions by Feigenbaum, Papadimitriou, Shenker
- Strategyproofness
via LP Duality by Vijay Vazirani and Jain
- Auctions
of Digital Goods by Goldberg, Hartline, and Wright
- Incentive-Compatible Online Auctions for
Digital Goods by Bar-Yossef, Hildrum and Wu, in SODA 2002.
- Online Algorithms for Market Clearing
by Blum, Sandholm and Zinkevich, in SODA 2002.
- Competitive Generalized Auctions by Fiat, Goldberg, Hartline and Karlin,
in STOC 2002.
- Seller-focused algorithms for online auctioning by Bagchi, etal., in WADS
2001.
- Approximation and Collusion in Multicast
Cost Sharing by Joan Feigenbaum, Arvind Krishnamurthy, Rahul Sami, Scott
Shenker, 2001 (added on 10/09)
- Pricing of Dialup Services: an Example of
Congestion-Dependent Pricing in the Internet by Stephen D. Patek and
Enrique Campos-Nanez, 2000. (added on 11/02)
- An Approximate Truthful Mechanism for
Combinatorial Auctions with Single Parameter Agents by Aaron Archer,
Christos Papadimitriou, Kunal Talwar, Eva Tardos (added on 11/02)
- Secure and Private Auctions without
Auctioneers by Felix Brandt, 2002. (added on 11/02)
- A Cryptographic Solution to a Game Theoretic
Problem by Yevgeniy Dodis, Shai Halevi, Tal Rabin (added on 11/02)
- Privacy Preserving Auctions and Mechanism
Design by Moni Naor, Benny Pinkas, Reuben Sumner, 1999. (added on 11/02)
Papers on wireless networks:
- Game theory and the design of self-configuring, adaptive wireless networks,
A. B. MacKenzie and S. B. Wicker, IEEE Communications Magazine, Volume: 39 Issue: 11 , Nov. 2001,
Pages: 126 -131.
- Pricing and power control in a multicell wireless data network,
Saraydar, C.U.; Mandayam, N.B.; Goodman, D.J., IEEE Journal on Selected Areas in Communications,
Volume: 19 Issue: 10 , Oct. 2001, Pages: 1883 –1892.
- Efficient power control via pricing in wireless data networks,
Saraydar, C.U.; Mandayam, N.B.; Goodman, D.J., IEEE Transactions on
Communications, Volume: 50 Issue: 2 , Feb. 2002, Pages: 291 –303
- Game theoretic analysis of security in
mobile ad hoc networks by Pietro Michiardi – Refik Molva (added on 11/05)
Papers on repeated games:
- Bounded
Rationality and Computational Complexity by Papadimitriou and Yannakakis
- Rational
Learning and Nash Equilibrium by Kalai and Lehrer
- Strategy Extraction
When Playing Games by Marko Grobelnik, Vesna Prasnikar, Workshop on Data
Engineering for Inductive Learning IJCAI-95, Montreal (Canada), August 20,
1995, pp 31-40.
- The Prisoners' Dilemma Revisited,
Abdellah Salhi, Hugh Glaser, David De Roure, John Putney, 1996
(added on 10/09)
Papers on game theory:
- Algorithms,
Games, and the Internet by Papadimitriou
- Strategic
Information Transmission by Crawford and Sobel
- A survey paper: Games,
Computers, and OR by Kalai
- A dynamics that, in some sense and cases,
converges to the Nash equilibrium: Nash
Convergence of Gradient Dynamics in General-Sum Games, by Singh Kearns and
Mansour
- A representation of games, with an algorithm for computing Nash
equibria in some special cases: Graphical
models in game theory Kearns Littman and Singh
- Nash Equilibria in Competitive societies, with Applications to Facility
Location, Traffic Routing and Auctions
by Adrian Vetta, in FOCS 2002
- Distributed Games: From Mechanisms to
Protocols by Dov Monderer and Moshe Tennenholtz, 1999.
(added on 10/09)
- Quantum Strategies, David A. Meyer,
1999 (added on 10/09)
- Quantum Games And Quantum Algorithms,
David A. Meyer, 2000 (added on 10/09)
- Applications of Approximation Algorithms to
Cooperative Games by Kamal Jain, Vijay V. Vazirani in STOC 01 (added on 10/09)
- Multi-Agent Influence Diagrams for
Representing and Solving Games by Daphne Koller, Brian Milch
(added on 11/02)
- Games with Procedurally Rational Players
by Martin J. Osborne, Ariel Rubinstein, 1998. (added on
11/02)
- A Game-Theoretic Investigation of Selection
Methods Used in Evolutionary Algorithms by Sevan Ficici, Ofer Melnik, and
Jordan Pollack. (added on 11/26)
Miscellaneous topics:
- The Approximability of
Trade-offs by Papadimitriou and Yannakakis
- Rank
Aggregation, Spam Resistance, and Social Choice by Dwork Kumar Moni Naor and
Sivakumar
- Competitive Recommendation Systems by
Drineas, Kerenidis, and Raghavan, in STOC 2002
- Selfish Traffic Allocation for Server Farms by Czumaj, Krysta and Voecking, in STOC 2002
- Incentives for Sharing in
Peer-to-Peer Networks by Golle, Leyton-Brown and Mironov
- On the value of private
information by J. Kleinberg, C. H. Papadimitriou, P. Raghavan, in
TARK 2001 (added on 10/09)
- A Non-manipulable Meeting Scheduling
System by Eithan Ephrati, Gilad Zlotkin, and Jeffrey S. Rosenschein, in
Proceedings of the 13th International Workshop on Distributed Artificial
Intelligence, 1994. (added on 10/09)
- Bargaining with Deadlines by
Tuomas Sandholm and Nir Vulkan (added on 11/12)
Links to similar courses on the web:
Useful Links: