Evolving mixed nash equilibria for bimatrix games
Abstract
References
Index Terms
- Evolving mixed nash equilibria for bimatrix games
Recommendations
Finding Approximate Nash Equilibria of Bimatrix Games via Payoff Queries
Special Issue on EC'14We study the deterministic and randomized query complexity of finding approximate equilibria in a k × k bimatrix game. We show that the deterministic query complexity of finding an ϵ-Nash equilibrium when ϵ < ½ is Ω(k2), even in zero-one constant-sum ...
Finding approximate nash equilibria of bimatrix games via payoff queries
EC '14: Proceedings of the fifteenth ACM conference on Economics and computationWe study the deterministic and randomized query complexity of finding approximate equilibria in a k x k bimatrix game. We show that the deterministic query complexity of finding an ε-Nash equilibrium when ε < 1/2 is Ω(k2), even in zero-one constant-sum ...
Computing Approximate Nash Equilibria in Polymatrix Games
In an $$\epsilon $$∈-Nash equilibrium, a player can gain at most $$\epsilon $$∈ by unilaterally changing his behavior. For two-player (bimatrix) games with payoffs in [0, 1], the best-known $$\epsilon $$∈ achievable in polynomial time is 0.3393 (...
Comments
Information & Contributors
Information
Published In

Sponsors
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Check for updates
Author Tag
Qualifiers
- Abstract
Conference
Acceptance Rates
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 61Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in