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

DOI10.1007/BF01240056zbMath0788.90086MaRDI QIDQ687992

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

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

Related Items (10)

Homotopy methods to compute equilibria in game theory ⋮ Fall back proper equilibrium ⋮ A global Newton method to compute Nash equilibria. ⋮ An extension of quantal response equilibrium and determination of perfect equilibrium ⋮ A differentiable homotopy method to compute perfect equilibria ⋮ The complexity of computing a (quasi-)perfect equilibrium for an \(n\)-player extensive form game ⋮ Pairwise-stability and Nash equilibria in network formation ⋮ 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)\) ⋮ Universally converging adjustment processes -- a unifying approach.

Cites Work

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

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