An algorithmic approach toward the tracing procedure for bi-matrix games
From MaRDI portal
Publication:1300677
DOI10.1006/game.1998.0688zbMath0939.91006OpenAlexW2041180287MaRDI QIDQ1300677
Antoon van den Elzen, Adolphus J. J. Talman
Publication date: 4 June 2000
Published in: Games and Economic Behavior (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/game.1998.0688
Related Items (8)
Homotopy methods to compute equilibria in game theory ⋮ Equilibrium tracing in strategic-form games ⋮ An extension of quantal response equilibrium and determination of perfect equilibrium ⋮ 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 ⋮ A differentiable homotopy method to compute perfect equilibria ⋮ Computation of the Nash equilibrium selected by the tracing procedure in \(N\)-person games ⋮ A differentiable path-following method to compute subgame perfect equilibria in stationary strategies in robust stochastic games and its applications ⋮ Complementarity enhanced Nash's mappings and differentiable homotopy methods to select perfect equilibria
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The tracing procedure: A Bayesian approach to defining a solution for n- person noncooperative games
- A solution concept for \(n\)-person noncooperative games
- A procedure for finding Nash equilibria in bi-matrix games
- On the Computation of Fixed Points in the Product Space of Unit Simplices and an Application to Noncooperative N Person Games
This page was built for publication: An algorithmic approach toward the tracing procedure for bi-matrix games