Computing a quasi-perfect equilibrium of a two-player game
DOI10.1007/S00199-009-0440-6zbMATH Open1182.91018OpenAlexW2006794473MaRDI QIDQ847801FDOQ847801
Authors: Peter Bro Miltersen, Troels Bjerre Sørensen 
Publication date: 19 February 2010
Published in: Economic Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00199-009-0440-6
Recommendations
- Computing Normal Form Perfect Equilibria for Extensive Two-Person Games
- Efficient computation of equilibria for extensive two-person games
- Equilibrium computation for two-player games in strategic and extensive form
- The complexity of computing a (quasi-)perfect equilibrium for an \(n\)-player extensive form game
- Computation of equilibria in noncooperative games
Linear programming (90C05) 2-person games (91A05) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Cites Work
- A new polynomial-time algorithm for linear programming
- Title not available (Why is that?)
- Bimatrix Equilibrium Points and Mathematical Programming
- Sequential Equilibria
- Efficient computation of equilibria for extensive two-person games
- Title not available (Why is that?)
- Fast algorithms for finding randomized strategies in game trees
- Title not available (Why is that?)
- Efficient computation of behavior strategies
- Computing sequential equilibria for two-player games
- A relation between perfect equilibria in extensive form games and proper equilibria in normal form games
- Computing Normal Form Perfect Equilibria for Extensive Two-Person Games
- Representations and solutions for game-theoretic problems
- Two examples of strategic equilibrium
Cited In (14)
- The complexity of computing a (quasi-)perfect equilibrium for an \(n\)-player extensive form game
- A differentiable homotopy method to compute perfect equilibria
- A variant of the logistic quantal response equilibrium to select a perfect equilibrium
- Fast algorithms for finding randomized strategies in game trees
- Computational complexity of computing a quasi-proper equilibrium
- Computing Proper Equilibria of Zero-Sum Games
- On perfect Nash equilibria of polymatrix games
- An exact double-oracle algorithm for zero-sum extensive-form games with imperfect information
- Equilibrium computation for two-player games in strategic and extensive form
- Computing Normal Form Perfect Equilibria for Extensive Two-Person Games
- On the Hardness and Existence of Quasi-Strict Equilibria
- A characterization of quasi-perfect equilibria
- The real computational complexity of minmax value and equilibrium refinements in multi-player games
- Computing equilibria: a computational complexity perspective
This page was built for publication: Computing a quasi-perfect equilibrium of a two-player game
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q847801)
