Computation of the Nash equilibrium selected by the tracing procedure in \(N\)-person games

DOI10.1006/game.2001.0856zbMath1013.91004OpenAlexW3124438177MaRDI QIDQ700098

Antoon van den Elzen, P. Jean-Jacques Herings

Publication date: 30 September 2002

Published in: Games and Economic Behavior (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/game.2001.0856

zbMATH Keywords

tracing procedurecomputation of Nash equilibria

Mathematics Subject Classification ID

Noncooperative games (91A10) (n)-person games, (n>2) (91A06)

Related Items

Homotopy methods to compute equilibria in game theory, A Complementary Pivot Algorithm for Market Equilibrium under Separable, Piecewise-Linear Concave Utilities, A variant of Harsanyi's tracing procedures to select a perfect equilibrium in normal form games, Parametric Computation of Minimum-Cost Flows with Piecewise Quadratic Costs, A mixed 0-1 linear programming approach to the computation of all pure-strategy Nash equilibria of a finite \(n\)-person game in normal form, Pricing in Bertrand competition with increasing marginal costs, Semidefinite programming for min-max problems and games, A dynamic homotopy interpretation of the logistic quantal response equilibrium correspondence, Equilibrium selection in games: the mollifier method, Complementarity enhanced Nash's mappings and differentiable homotopy methods to select perfect equilibria

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Implementing the modified LH algorithm
• The tracing procedure: A Bayesian approach to defining a solution for n- person noncooperative games
• The computation of fixed points and applications
• An algorithmic approach toward the tracing procedure for bi-matrix games
• A procedure for finding Nash equilibria in bi-matrix games
• A Continuous Deformation Algorithm on the Product Space of Unit Simplices
• A new subdivision for computing fixed points with a homotopy algorithm
• The octahedral algorithm, a new simplicial fixed point algorithm
• On the Computation of Fixed Points in the Product Space of Unit Simplices and an Application to Noncooperative N Person Games
• On triangulations for computing fixed points
• Homotopies for computation of fixed points
• The Computation of a Continuum of Constrained 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
• The Linear Complementarity Problem
• Homotopies for computation of fixed points on unbounded regions