Computing correlated equilibria in multi-player games
From MaRDI portal
Publication:5901104
DOI10.1145/1060590.1060598zbMath1192.91021OpenAlexW1977823909MaRDI QIDQ5901104
Publication date: 16 August 2010
Published in: Proceedings of the thirty-seventh annual ACM symposium on Theory of computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1060590.1060598
Analysis of algorithms and problem complexity (68Q25) Noncooperative games (91A10) Linear programming (90C05)
Related Items (17)
The complexity of welfare maximization in congestion games ⋮ Strong mediated equilibrium ⋮ Ranking games ⋮ Directed graphical structure, Nash equilibrium, and potential games ⋮ Action-graph games ⋮ Correlated equilibria in continuous games: characterization and computation ⋮ New complexity results about Nash equilibria ⋮ Computing the cores of strategic games with punishment-dominance relations ⋮ Good neighbors are hard to find: Computational complexity of network formation ⋮ The complexity of uniform Nash equilibria and related regular subgraph problems ⋮ Correlated Equilibria and Communication in Games ⋮ Walrasian equilibrium: Hardness, approximations and tractable instances ⋮ Learning to play efficient coarse correlated equilibria ⋮ How long to equilibrium? The communication complexity of uncoupled equilibrium procedures ⋮ Communication complexity and stability of equilibria in economies and games ⋮ Nash equilibria in all-optical networks ⋮ Polynomial-time computation of exact correlated equilibrium in compact games
This page was built for publication: Computing correlated equilibria in multi-player games
