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

DOI10.1007/BF01240056MaRDI QIDQ687992zbMATH OpenFDO

Authors Yoshitsugu Yamamoto

Publication date 30 November 1993

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

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)

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

Cites work

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

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)