Rank-1 bimatrix games
From MaRDI portal
Publication:5419089
DOI10.1145/1993636.1993664zbMath1288.68244arXiv1010.3083OpenAlexW2029825080MaRDI QIDQ5419089
No author found.
Publication date: 5 June 2014
Published in: Proceedings of the forty-third annual ACM symposium on Theory of computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1010.3083
Analysis of algorithms and problem complexity (68Q25) Nonnumerical algorithms (68W05) Noncooperative games (91A10) Linear programming (90C05) Games involving topology, set theory, or logic (91A44)
Related Items (11)
Settling Some Open Problems on 2-Player Symmetric Nash Equilibria ⋮ Some results concerning the solution mappings of mixed variational inequality problems ⋮ Constant Rank Two-Player Games are PPAD-hard ⋮ Recent studies of agent incentives in Internet resource allocation and pricing ⋮ A Polynomial-Time Algorithm for 1/2-Well-Supported Nash Equilibria in Bimatrix Games ⋮ A Polynomial-Time Algorithm for 1/3-Approximate Nash Equilibria in Bimatrix Games ⋮ On mutual concavity and strategically-zero-sum bimatrix games ⋮ Computing exact solutions of consensus halving and the Borsuk-Ulam theorem ⋮ Recent studies of agent incentives in internet resource allocation and pricing ⋮ Substitution with Satiation: A New Class of Utility Functions and a Complementary Pivot Algorithm ⋮ Fast Algorithms for Rank-1 Bimatrix Games
This page was built for publication: Rank-1 bimatrix games
