The Complexity of Decision Problems about Nash Equilibria in Win-Lose Games

DOI10.1007/978-3-642-33996-7_4zbMath1284.91013OpenAlexW207463452MaRDI QIDQ4910930

Marios Mavronicolas, Vittorio Bilò

Publication date: 13 March 2013

Published in: Algorithmic Game Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-33996-7_4

Mathematics Subject Classification ID

Noncooperative games (91A10) Decision theory for games (91A35)

Related Items (7)

Simulating cardinal preferences in Boolean games: a proof technique ⋮ Weighted Boolean Formula Games ⋮ Computing exact solutions of consensus halving and the Borsuk-Ulam theorem ⋮ The complexity of \((\mathsf{E}+\mathsf{Var})\)-equilibria, \(\mathsf{ESR}\)-equilibria, and \(\mathsf{SuperE}\)-equilibria for 2-players games with few cost values ⋮ Approximating the existential theory of the reals ⋮ Approximating the existential theory of the reals ⋮ Computing Exact Solutions of Consensus Halving and the Borsuk-Ulam Theorem

This page was built for publication: The Complexity of Decision Problems about Nash Equilibria in Win-Lose Games