Here is the list of papers chosen for presentation by members of COMP670O
Last updated
07/04/06
- James Lee
- Sven de Vries, Rakesh V. Vohra.
Combinatorial Auctions: A Survey.
INFORMS Journal on Computing, 15(3): 284-309, 2003.
Counts as two papers.
- Xu Jing
- Elliot Anshelevich, Anirban Dasgupta, Eva Tardos, Tom Wexler.
Near-Optimal Network Design with Selfish Agents.
STOC 2003: 35th Annual ACM Symposium on Theory of Computing, Pages
511-520.
- Vincent Conitzer, Tuomas Sandholm.
Complexity Results about Nash Equilibria.
IJCAI 2003: 18th International Joint Conferences on Artificial
Intelligence, Pages 765-771.
- Mak Wah Sung Vincent
- Ehud Kalai, Ehud Lehrer.
Rational Learning Leads to Nash Equilibrium.
Econometrica, 61(5): 1019-1045, 1993.
- Elias Koutsoupias, Christos Papadimitriou.
Worst-Case Equilibria.
STACS 1999: 16th Annual Symposium on Theoretical Aspects of Computer
Science, LNCS 1563, Pages 404-413.
- Jian Xia
- Alex Fabrikant, Ankur Luthra, Elitza Maneva, Christos H. Papadimitriou,
Scott Shenker.
On a Network Creation Game.
PODC 2003, Pages 347-351.
- Jon Kleinberg, Prabhakar Raghavan.
Query Incentive Networks.
FOCS 2005, Pages 132-141.
- Leung Yiu Cho
- Michael Kearns, Michael L. Littman, Satinder Singh.
Graphical Models for Game Theory.
UAI 2001: 17th Conference on Uncertainty in Artificial Intelligence,
Pages 253-260.
- Christos H. Papadimitriou, Tim Roughgarden.
Computing Equilibria in Multi-Player Games.
SODA 2005: 16th Annual ACM-SIAM Symposium on Discrete Algorithms,
Pages 82-91.
- Zhou Zhen
- Debojyoti Dutta, Ashish Goel, John Heidemann.
Oblivious AQM and Nash Equilibria.
INFOCOM 2003, Pages 106-113.
- Xiaojie Gao, Kamal Jain, Leonard J. Schulman.
Fair and Efficient Router Congestion Control.
SODA 2004, Pages 1050-1059.
- Zhang Yan
- Noam Nisan.
Algorithms for Selfish Agents: Mechanism Design for Distributed
Computation.
STACS 1999: 16th Annual Symposium on Theoretical Aspects of Computer
Science, LNCS 1563, Pages 1-15.
- John Hershberger, Subhash Suri.
Vickrey Prices and Shortest Paths: What Is an Edge Worth?
FOCS 2001: 42nd Annual IEEE Symposium on Foundations of Computer
Science, Pages 252-259.
- Wang Yajun
- Tim Roughgarden, Eva Tardos.
How Bad Is Selfish Routing?
Journal of the ACM, 49(2): 236-259, 2002.
- Baruch Awerbuch, Yossi Azar, Amir Epstein.
The Price of Routing Unsplittable Flow.
STOC 2005, Pages 57-66.
- Yang Yin
- Karhan Akcoglu, James Aspnes, Bhaskar DasGupta, Ming-Yang Kao.
Opportunity Cost Algorithms for Combinatorial Auctions.
In E. J. Kontoghiorghes, B. Rustem, S. Siokos (Eds), Applied
Optimization 74: Computational Methods in Decision-Making, Economics and
Finance, Kluwer Academic Publishers, 2002, Pages 455-479.
- Aaron Archer, Christos Papadimitriou, Kunal Talwar, Eva Tardos.
An Approximate Truthful Mechanism for Combinatorial Auctions with
Single Parameter Agents.
Internet Mathematics, 1(2): 129-150, 2003.
- Li Xi
- Ron Lavi, Noam Nisan.
Competitive Analysis of Incentive Compatible On-Line Auctions.
Theoretical Computer Science, 310(1-3): 159-180, 2004.
- *David C. Parkes, Lyle H. Ungar.
*Iterative Combinatorial Auctions: Theory and Practice.
*AAAI 2000: 17th National Conference on Artificial Intelligence,
Pages 74-81.