Complexity of rational and irrational Nash equilibria

DOI10.1007/978-3-642-24829-0_19MaRDI QIDQ3095274zbMATHOpenAlexFDO

Authors Vittorio Bilò, Marios Mavronicolas

Publication date 28 October 2011

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

Full work available at URL https://doi.org/10.1007/978-3-642-24829-0_19

Mathematics Subject Classification ID

Noncooperative games (91A10) Abstract computational complexity for mathematical programming problems (90C60) Decision theory for games (91A35) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Recommendations

• Complexity of rational and irrational Nash equilibria
• New complexity results about Nash equilibria
• On the computational complexity of decision problems about multi-player Nash equilibria
• The complexity of decision problems about Nash equilibria in win-lose games
• On the computational complexity of decision problems about multi-player Nash equilibria

Cited in

(4)

• Simulating cardinal preferences in Boolean games: a proof technique
• The complexity of decision problems about Nash equilibria in win-lose games
• On the Complexity of Nash Equilibria and Other Fixed Points
• Complexity of rational and irrational Nash equilibria

This page was built for publication: Complexity of rational and irrational Nash equilibria

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3095274)