The complexity of (E+Var)-equilibria, ESR-equilibria, and SuperE-equilibria for 2-players games with few cost values

DOI10.1016/J.TCS.2021.01.031MaRDI QIDQ1998841zbMATH OpenOpenAlexFDO

Authors Chryssis Georgiou, Marios Mavronicolas, Burkhard Monien

Publication date 9 March 2021

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2021.01.031

zbMATH Keywords

2-player minimization gamescomplexity of equilibriaexpectation plus varianceexpectation with the property that variance is zeroextended Sharpe ratiovaluation functions

Mathematics Subject Classification ID

2-person games (91A05) Algorithmic game theory and complexity (91A68)

Recommendations

• $$\mathcal {NP}$$-Hardness of Equilibria in Case of Risk-Averse Players
• The complexity of equilibria for risk-modeling valuations
• Minimizing expectation plus variance
• Minimizing expectation plus variance
• Conditional value-at-risk: structure and complexity of equilibria

Cites work

• \(\exists\mathbb{R}\)-complete decision problems about symmetric Nash equilibria in symmetric multi-player games
• A Social Equilibrium Existence Theorem*
• Complexity of rational and irrational Nash equilibria
• Conditional value-at-risk: structure and complexity of equilibria
• Efficient Computation of Nash Equilibria for Very Sparse Win-Lose Bimatrix Games
• Equilibrium points in n -person games
• Equilibrium without independence
• Existence and dynamic consistency of Nash equilibrium with non-expected utility preferences
• Exposition of a New Theory on the Measurement of Risk
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 3084780 (Why is no real title available?)
• Markowitz revisited: mean-variance models in financial portfolio analysis
• Minimizing expectation plus variance
• Nash and correlated equilibria: Some complexity considerations
• New complexity results about Nash equilibria
• Non-cooperative games
• Prospect Theory: An Analysis of Decision under Risk
• Settling the complexity of computing two-player Nash equilibria
• Seven Kinds of Convexity
• The approximation complexity of win-lose games
• The complexity of computing a Nash equilibrium
• The complexity of decision problems about Nash equilibria in win-lose games
• The complexity of equilibria for risk-modeling valuations
• When the players are not expectation maximizers

Cited in

(6)

• The complexity of equilibria for risk-modeling valuations
• Minimizing expectation plus variance
• Conditional value-at-risk: structure and complexity of equilibria
• Conditional value-at-risk: structure and complexity of equilibria
• $$\mathcal {NP}$$-Hardness of Equilibria in Case of Risk-Averse Players
• Minimizing expectation plus variance

This page was built for publication: The complexity of \((\mathsf{E}+\mathsf{Var})\)-equilibria, \(\mathsf{ESR}\)-equilibria, and \(\mathsf{SuperE}\)-equilibria for 2-players games with few cost values

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