Combinatorial optimization: algorithms and complexity
Combinatorial optimization: algorithms and complexity
Existence of correlated equilibria
Mathematics of Operations Research
Algorithms, games, and the internet
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
The Structure and Complexity of Nash Equilibria for a Selfish Routing Game
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Graphical Models for Game Theory
UAI '01 Proceedings of the 17th Conference in Uncertainty in Artificial Intelligence
Correlated equilibria in graphical games
Proceedings of the 4th ACM conference on Electronic commerce
Group Strategyproof Mechanisms via Primal-Dual Algorithms
FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
The complexity of pure Nash equilibria
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Selfish caching in distributed systems: a game-theoretic analysis
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Exponentially Many Steps for Finding a Nash Equilibrium in a Bimatrix Game
FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
Computing equilibria in multi-player games
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
On the Complexity of Two-PlayerWin-Lose Games
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Nash Equilibria in Random Games
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Reducibility among equilibrium problems
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
The complexity of computing a Nash equilibrium
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Computing pure nash equilibria in graphical games via markov random fields
EC '06 Proceedings of the 7th ACM conference on Electronic commerce
Playing games in many possible worlds
EC '06 Proceedings of the 7th ACM conference on Electronic commerce
Preface: A brief overview of network algorithms
Journal of Computer and System Sciences - Special issue on network algorithms 2005
On the topologies formed by selfish peers
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
The communication complexity of uncoupled nash equilibrium procedures
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Computing good nash equilibria in graphical games
Proceedings of the 8th ACM conference on Electronic commerce
The complexity of game dynamics: BGP oscillations, sink equilibria, and beyond
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
The complexity of uniform Nash equilibria and related regular subgraph problems
Theoretical Computer Science
Artificial Intelligence
Artificial Intelligence
The Search for Equilibrium Concepts
SAGT '08 Proceedings of the 1st International Symposium on Algorithmic Game Theory
Computing an Extensive-Form Correlated Equilibrium in Polynomial Time
WINE '08 Proceedings of the 4th International Workshop on Internet and Network Economics
Proceedings of the 10th ACM conference on Electronic commerce
Algorithmic Game Theory: A Snapshot
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
On strictly competitive multi-player games
AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
A polynomial-time algorithm for action-graph games
AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
Journal of Artificial Intelligence Research
Algorithms for playing games with limited randomness
ESA'07 Proceedings of the 15th annual European conference on Algorithms
A sampling-based approach to computing equilibria in succinct extensive-form games
UAI '09 Proceedings of the Twenty-Fifth Conference on Uncertainty in Artificial Intelligence
Polynomial computation of exact correlated equilibrium in compact games
ACM SIGecom Exchanges
Polynomial-time computation of exact correlated equilibrium in compact games
Proceedings of the 12th ACM conference on Electronic commerce
On the price of anarchy and stability of correlated equilibria of linear congestion games,,
ESA'05 Proceedings of the 13th annual European conference on Algorithms
The complexity of games on highly regular graphs
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Recent developments in equilibria algorithms
WINE'05 Proceedings of the First international conference on Internet and Network Economics
Nash equilibria in all-optical networks
WINE'05 Proceedings of the First international conference on Internet and Network Economics
Multi-agent based selfish routing for multi-channel wireless mesh networks
PRIMA'06 Proceedings of the 9th Pacific Rim international conference on Agent Computing and Multi-Agent Systems
The game world is flat: the complexity of nash equilibria in succinct games
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
Tα Παιδíα Παíζϵι the interaction between algorithms and game theory
WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms
A general framework for computing optimal correlated equilibria in compact games
WINE'11 Proceedings of the 7th international conference on Internet and Network Economics
| Hi-index | 0.00 |
We develop a polynomial-time algorithm for finding correlated equilibria (a well-studied notion of rationality due to Aumann that generalizes the Nash equilibrium) in a broad class of succinctly representable multiplayer games, encompassing essentially all known kinds, including all graphical games, polymatrix games, congestion games, scheduling games, local effect games, as well as several generalizations. Our algorithm is based on a variant of the existence proof due to Hart and Schmeidler [11], and employs linear programming duality, the ellipsoid algorithm, Markov chain steady state computations, as well as application-specific methods for computing multivariate expectations.