The Game World Is Flat: The Complexity of Nash Equilibria in Succinct Games
From MaRDI portal
Publication:3613786
DOI10.1007/11786986_45zbMath1223.91008OpenAlexW2096651633MaRDI QIDQ3613786
Constantinos Daskalakis, Alex Fabrikant, Christos H. Papadimitriou
Publication date: 12 March 2009
Published in: Automata, Languages and Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11786986_45
Analysis of algorithms and problem complexity (68Q25) Noncooperative games (91A10) 2-person games (91A05) Games in extensive form (91A18)
Related Items (9)
A Direct Reduction from k-Player to 2-Player Approximate Nash Equilibrium ⋮ Computing equilibria: a computational complexity perspective ⋮ Weighted Boolean Formula Games ⋮ Action-graph games ⋮ Multilinear Games ⋮ Equilibria problems on games: complexity versus succinctness ⋮ The complexity of computing a (quasi-)perfect equilibrium for an \(n\)-player extensive form game ⋮ Risk-free bidding in complement-free combinatorial auctions ⋮ Fully Polynomial-Time Approximation Schemes for Fair Rent Division
This page was built for publication: The Game World Is Flat: The Complexity of Nash Equilibria in Succinct Games
