Computational aspects of equilibria

DOI10.1007/978-3-642-04645-2_2MaRDI QIDQ3648838zbMATH OpenOpenAlexFDO

Authors Mihalis Yannakakis

Publication date 1 December 2009

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

Full work available at URL https://doi.org/10.1007/978-3-642-04645-2_2

Mathematics Subject Classification ID

Computational methods for problems pertaining to game theory, economics, and finance (91-08) Noncooperative games (91A10) General equilibrium theory (91B50)

Recommendations

• On the Complexity of Nash Equilibria and Other Fixed Points
• Equilibria, fixed points, and complexity classes
• Equilibria, fixed points, and complexity classes
• LATIN 2004: Theoretical Informatics
• The complexity of equilibria: Hardness results for economies via a correspondence with games

Cited in

(16)

• Computational experience concerning payoff tables and minimum criterion values over the efficient set
• Computing equilibria in dynamic models with occasionally binding constraints
• A note on anti-Nash equilibrium for bimatrix game
• Computing Equilibria with Partial Commitment
• Bad equilibria (and what to do about them)
• scientific article; zbMATH DE number 4141761 (Why is no real title available?)
• On the Logic and Computation of Partial Equilibrium Models
• A computational approach to optimum public policies
• Computing Cournot-Nash Equilibria
• scientific article; zbMATH DE number 4123479 (Why is no real title available?)
• Computation and Complexity in Economic Behavior and Organization
• Computing Equilibria of Dynamic Games
• The complexity of computing a bisimilarity pseudometric on probabilistic automata
• scientific article; zbMATH DE number 5257894 (Why is no real title available?)
• The Search for Equilibrium Concepts
• Recent advances in minimax problem and bimatrix games

This page was built for publication: Computational aspects of equilibria

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