Theory of linear and integer programming
Theory of linear and integer programming
Algorithms, games, and the internet
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Friend-or-Foe Q-learning in General-Sum Games
ICML '01 Proceedings of the Eighteenth International Conference on Machine Learning
FAucS: An FCC Spectrum Auction Simulator for Autonomous Bidding Agents
WELCOM '01 Proceedings of the Second International Workshop on Electronic Commerce
Implicit Negotiation in Repeated Games
ATAL '01 Revised Papers from the 8th International Workshop on Intelligent Agents VIII
Self-Enforcing Strategic Demand Reduction
AAMAS '02 Revised Papers from the Workshop on Agent Mediated Electronic Commerce on Agent-Mediated Electronic Commerce IV, Designing Mechanisms and Systems
Graphical Models for Game Theory
UAI '01 Proceedings of the 17th Conference in Uncertainty in Artificial Intelligence
A polynomial-time nash equilibrium algorithm for repeated games
Proceedings of the 4th ACM conference on Electronic commerce
Complexity results about Nash equilibria
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Theory of moves learners: towards non-myopic equilibria
Proceedings of the fourth international joint conference on Autonomous agents and multiagent systems
Learning to commit in repeated games
AAMAS '06 Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems
Reaching pareto-optimality in prisoner's dilemma using conditional joint action learning
Autonomous Agents and Multi-Agent Systems
Constraint satisfaction algorithms for graphical games
Proceedings of the 6th international joint conference on Autonomous agents and multiagent systems
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Social reward shaping in the prisoner's dilemma
Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 3
WINE'07 Proceedings of the 3rd international conference on Internet and network economics
Hi-index | 0.00 |
With the increasing reliance on game theory as a foundation for auctions and electronic commerce, efficient algorithms for computing equilibria in multiplayer general-sum games are of great theoretical and practical interest. The computational complexity of finding 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 finding a Nash equilibrium for an average-payoff repeated bimatrix game, and presents a polynomial-time algorithm. Our approach draws on the well-known "folk theorem" from game theory and shows how finite-state equilibrium strategies can be found efficiently and expressed succinctly.