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
Equilibrium Points in Fear of Correlated Threats
WINE '08 Proceedings of the 4th International Workshop on Internet and Network Economics
Anytime Self-play Learning to Satisfy Functional Optimality Criteria
ADT '09 Proceedings of the 1st International Conference on Algorithmic Decision Theory
Online model learning in adversarial Markov decision processes
Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 1
An overview of cooperative and competitive multiagent learning
LAMAS'05 Proceedings of the First international conference on Learning and Adaption in Multi-Agent Systems
Learning pareto-optimal solutions in 2x2 conflict games
LAMAS'05 Proceedings of the First international conference on Learning and Adaption in Multi-Agent Systems
Nash equilibrium for collective strategic reasoning
Expert Systems with Applications: An International Journal
Learning to achieve socially optimal solutions in general-sum games
PRICAI'12 Proceedings of the 12th Pacific Rim international conference on Trends in Artificial Intelligence
The truth behind the myth of the folk theorem
Proceedings of the 5th conference on Innovations in theoretical computer science
| 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.