Michael L. Littman, Peter Stone  Home/Search
Context Related
| utexas.edu/users/pstone/Pape...DSS04.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: utexas.edu/users/pstone/Papers... (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: With the increasing reliance on game theory as a foundation for auctions and electronic commerce, ecient algorithms for computing equilibria in multiplayer general-sum games are of great theoretical and practical interest. The computational complexity of nding a Nash equilibrium for a one-shot bimatrix game is a well known open problem. This paper treats a related but distinct problem, that of nding a Nash equilibrium for an average-payo repeated bimatrix game, and presents a polynomial-time ... (Update)
Cited by: More
Computing Equilibria in Multi-Player Games - Christos Papadimitriou Tim (Correct)
AWESOME: A General Multiagent Learning Algorithm that.. - Conitzer, Sandholm (2006) (Correct)
Complexity of (Iterated) Dominance - Vincent Conitzer Forbes (Correct)
Similar documents (at the sentence level):
37.9%: A polynomial-time Nash equilibrium algorithm for repeated games - Littman, Stone (2003) (Correct)
Active bibliography (related documents): More All
0.6: ATTac-2001: A Learning, Autonomous Bidding Agent - Stone, Schapire, Csirik.. (2001) (Correct)
0.5: Randomized Strategic Demand Reduction - Getting More.. - Reitsma, Stone.. (2002) (Correct)
0.5: Self-enforcing Strategic Demand Reduction - Reitsma, Stone, Csirik, Littman (2002) (Correct)
Similar documents based on text: More All
0.2: IPC 2004 Probabilistic Planning Track: FAQ 0.1 - Littman, Younes (2003) (Correct)
0.2: The Complexity of Plan Existence and Evaluation in.. - Goldsmith, Littman.. (1997) (Correct)
0.1: Incremental Pruning: A Simple, Fast, Exact Method for.. - Cassandra, Littman.. (1997) (Correct)
Related documents from co-citation: More All
7: Complexity results about Nash equilibria - Conitzer, Sandholm - 2002
7: Graphical models for game theory - Kearns, Littman et al. - 2001
4: Playing large games using simple strategies - Lipton, Markakis et al. - 2003
BibTeX entry: (Update)
Michael Littman and Peter Stone. A polynomial-time nash equilibrium algorithm for repeated games. ACMEC, San Diego, CA, 2003. http://citeseer.ist.psu.edu/littman04polynomialtime.html More
@misc{ littman03polynomialtime,
author = "M. Littman and P. Stone",
title = "A polynomial-time nash equilibrium algorithm for repeated games",
text = "Michael Littman and Peter Stone. A polynomial-time nash equilibrium algorithm
for repeated games. ACMEC, San Diego, CA, 2003.",
year = "2003",
url = "citeseer.ist.psu.edu/littman04polynomialtime.html" }
Citations (may not include all citations):717 Theory of Linear and Integer Programming (context) - Schrijver - 1986
432 The Evolution of Cooperation (context) - Axelrod - 1984
282 A Course in Game Theory (context) - Osborne, Rubinstein - 1994
182 Theory of Games and Economic Behavior (context) - von Neumann, Morgenstern - 1947
125 Non-cooperative games (context) - Nash - 1951
95 The bargaining problem (context) - Nash - 1950
36 Complexity results about Nash equilibria - Conitzer, Sandholm - 2003
24 Graphical models for game theory - Kearns, Littman et al. - 2001
21 Friend-or-foe Q-learning in general-sum games - Littman - 2001
10 Making more from less: Strategic demand reduction in the FCC.. (context) - Weber - 1997
9 A polynomial-time Nash equilibrium algorithm for repeated ga.. - Littman, Stone - 2003
7 and the internet (context) - Papadimitriou, games - 2001
6 FAucS: An FCC spectrum auction simulator for autonomous bidd.. - anos, Csirik et al. - 2001
4 Implicit negotiation in repeated games - Littman, Stone - 2001
3 Self-enforcing strategic demand reduction - Reitsma, Stone et al. - 2002
2 Ecient learning equilibrium - Brafman, Tennenholtz - 2003
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.utexas.edu/users/pstone/Papers/bib2html/): More
Multiagent Traffic Management: A Reservation-Based.. - Dresner, Stone (2004) (Correct)
Machine Learning for Fast Quadrupedal Locomotion - Nate Kohl And (2004) (Correct)
TacTex-03: A Supply Chain Management Agent - David Pardoe And (2004) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC