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

DOI10.1007/s00199-009-0440-6zbMath1182.91018OpenAlexW2006794473MaRDI QIDQ847801

Troels Bjerre Sørensen, Peter Bro Miltersen

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)

Related Items (6)

Computational complexity of computing a quasi-proper equilibrium ⋮ Computing equilibria: a computational complexity perspective ⋮ A characterization of quasi-perfect equilibria ⋮ On perfect Nash equilibria of polymatrix games ⋮ The complexity of computing a (quasi-)perfect equilibrium for an \(n\)-player extensive form game ⋮ The real computational complexity of minmax value and equilibrium refinements in multi-player games

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A new polynomial-time algorithm for linear programming
• A relation between perfect equilibria in extensive form games and proper equilibria in normal form games
• Representations and solutions for game-theoretic problems
• Two examples of strategic equilibrium
• Efficient computation of behavior strategies
• Efficient computation of equilibria for extensive two-person games
• Fast algorithms for finding randomized strategies in game trees
• Computing sequential equilibria for two-player games
• Sequential Equilibria
• Computing Normal Form Perfect Equilibria for Extensive Two-Person Games
• Bimatrix Equilibrium Points and Mathematical Programming

This page was built for publication: Computing a quasi-perfect equilibrium of a two-player game