A path-following procedure to find a proper equilibrium of finite games

DOI10.1007/BF01240056zbMATH Open0788.90086MaRDI QIDQ687992FDOQ687992

Authors: Yoshitsugu Yamamoto 

Publication date: 30 November 1993

Published in: International Journal of Game Theory (Search for Journal in Brave)

Recommendations

• Refinement of proper equilibrium points
• A procedure for finding Nash equilibria in bi-matrix games
• Un refinamiento del concepto de equilibrio propio de Myerson
• Computing Proper Equilibria of Zero-Sum Games
• On proper refinement of Nash equilibria for bimatrix games

zbMATH Keywords

proper equilibriumvariable dimension fixed point algorithm

Mathematics Subject Classification ID

Linear programming (90C05) Noncooperative games (91A10) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Cites Work

• Title not available (Why is that?)
• On a Generalization of the Lemke–Howson Algorithm to Noncooperative N-Person Games
• A unified approach to interior point algorithms for linear complementarity problems: A summary
• Title not available (Why is that?)
• Reexamination of the perfectness concept for equilibrium points in extensive games
• Title not available (Why is that?)
• On the Strategic Stability of Equilibria
• Some generalizations of positive definiteness and monotonicity
• Equilibrium Points of Bimatrix Games
• A PATH FOLLOWING ALGORITHM FOR STATIONARY POINT PROBLEMS
• Title not available (Why is that?)
• Refinements of the Nash equilibrium concept
• Title not available (Why is that?)
• Computing Equilibria of N-Person Games
• A procedure for finding Nash equilibria in bi-matrix games
• A unifying model based on retraction for fixed point algorithms
• A Simplicial Algorithm for Stationary Point Problems on Polytopes

Cited In (13)

• The tracing procedure: A self-correcting reasoning procedure
• The complexity of computing a (quasi-)perfect equilibrium for an \(n\)-player extensive form game
• A differentiable homotopy method to compute perfect equilibria
• A global Newton method to compute Nash equilibria.
• An extension of quantal response equilibrium and determination of perfect equilibrium
• A variant of the logistic quantal response equilibrium to select a perfect equilibrium
• Fall back proper equilibrium
• A variant of Harsanyi's tracing procedures to select a perfect equilibrium in normal form games
• Homotopy methods to compute equilibria in game theory
• Pairwise-stability and Nash equilibria in network formation
• Universally converging adjustment processes -- a unifying approach.
• A dynamic homotopy interpretation of the logistic quantal response equilibrium correspondence
• Orbits in the flag variety and images of the moment map for \(U(p, q)\)

This page was built for publication: A path-following procedure to find a proper equilibrium of finite games

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