On the Hardness and Existence of Quasi-Strict Equilibria

DOI10.1007/978-3-540-79309-0_26MaRDI QIDQ5459994zbMATH OpenOpenAlexFDO

Authors Felix Brandt, Felix Fischer

Publication date 2 May 2008

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

Full work available at URL https://doi.org/10.1007/978-3-540-79309-0_26

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) (n)-person games, (n>2) (91A06)

Recommendations

• Bimatrix games have quasi-strict equilibria
• New complexity results about Nash equilibria
• Computing a quasi-perfect equilibrium of a two-player game
• The complexity of computing a (quasi-)perfect equilibrium for an \(n\)-player extensive form game
• Nash and correlated equilibria: Some complexity considerations

Cites work

• A symmetrization for finite two-person games
• Another impossibility result for normal form games
• Bimatrix games have quasi-strict equilibria
• Comparison functions and choice correspondences
• Computing equilibria in multi-player games
• Computing sequential equilibria for two-player games
• Equilibrium selection and consistency
• scientific article; zbMATH DE number 3137856 (Why is no real title available?)
• scientific article; zbMATH DE number 3139273 (Why is no real title available?)
• scientific article; zbMATH DE number 5764905 (Why is no real title available?)
• scientific article; zbMATH DE number 51788 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 2243403 (Why is no real title available?)
• scientific article; zbMATH DE number 3062453 (Why is no real title available?)
• Impossibility theorems for normal form games
• Non-cooperative games
• Oddness of the number of equilibrium points: a new proof
• On the Non-Transferable Utility Value: A Comment on the Roth-Shafer Examples
• Refinements of the Nash equilibrium concept
• Regular equilibrium points of bimatrix games
• Regularity and Stability of Equilibrium Points of Bimatrix Games
• Simple complexity from imitation games
• Strongly Stable Equilibrium Points of N-Person Noncooperative Games
• Symmetries and the Complexity of Pure Nash Equilibrium
• The consistency principle for games in strategic form

Cited in

(11)

• Bimatrix games have quasi-strict equilibria
• On the tradeoff between efficiency and strategyproofness
• (In)existence of equilibria for 2-player, 2-value games with semistrictly quasiconcave cost functions
• Regular potential games
• Patent Nash equilibria in symmetric strictly competitive games
• Strict equilibria interchangeability in multi-player zero-sum games
• On the rate of convergence of fictitious play
• On the rate of convergence of fictitious play
• On sustainable equilibria
• Computing the minimal covering set
• Walrasian equilibrium: Hardness, approximations and tractable instances

This page was built for publication: On the Hardness and Existence of Quasi-Strict Equilibria

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