Computing a quasi-perfect equilibrium of a two-player game

DOI10.1007/S00199-009-0440-6MaRDI QIDQ847801zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

equilibrium computationquasi-perfect equilibrium

Mathematics Subject Classification ID

Linear programming (90C05) 2-person games (91A05) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

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

Cites work

• scientific article; zbMATH DE number 3644821 (Why is no real title available?)
• scientific article; zbMATH DE number 4083375 (Why is no real title available?)
• scientific article; zbMATH DE number 1099369 (Why is no real title available?)
• A new polynomial-time algorithm for linear programming
• A relation between perfect equilibria in extensive form games and proper equilibria in normal form games
• Bimatrix Equilibrium Points and Mathematical Programming
• Computing Normal Form Perfect Equilibria for Extensive Two-Person Games
• Computing sequential equilibria for two-player games
• Efficient computation of behavior strategies
• Efficient computation of equilibria for extensive two-person games
• Fast algorithms for finding randomized strategies in game trees
• Representations and solutions for game-theoretic problems
• Sequential Equilibria
• Two examples of strategic equilibrium

Cited in

(15)

• Computational complexity of computing a quasi-proper equilibrium
• Computing Proper Equilibria of Zero-Sum Games
• A differentiable homotopy method to compute perfect equilibria
• On the Hardness and Existence of Quasi-Strict Equilibria
• Computing Normal Form Perfect Equilibria for Extensive Two-Person Games
• The complexity of computing a (quasi-)perfect equilibrium for an \(n\)-player extensive form game
• A variant of the logistic quantal response equilibrium to select a perfect equilibrium
• A characterization of quasi-perfect equilibria
• Efficient computation of equilibria for extensive two-person games
• An exact double-oracle algorithm for zero-sum extensive-form games with imperfect information
• Fast algorithms for finding randomized strategies in game trees
• The real computational complexity of minmax value and equilibrium refinements in multi-player games
• Equilibrium computation for two-player games in strategic and extensive form
• On perfect Nash equilibria of polymatrix 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)