Computing Nash equilibria by iterated polymatrix approximation
From MaRDI portal
Publication:953636
DOI10.1016/S0165-1889(03)00108-8zbMATH Open1200.91019MaRDI QIDQ953636FDOQ953636
Authors: Srihari Govindan, Robert Wilson 
Publication date: 6 November 2008
Published in: Journal of Economic Dynamics and Control (Search for Journal in Brave)
Recommendations
- Computing approximate Nash equilibria in polymatrix games
- Computing approximate Nash equilibria in polymatrix games
- Polynomial algorithms for approximating Nash equilibria of bimatrix games
- Computing constrained approximate equilibria in polymatrix games
- Computing generalized Nash equilibria by polynomial programming
- Approximating Nash equilibria in tree polymatrix games
- Computing exact and approximate Nash equilibria in 2-player games
- An algorithm for finding approximate Nash equilibria in bimatrix games
- scientific article; zbMATH DE number 4141839
- On the complexity of approximating a Nash equilibrium
Approximation methods and heuristics in mathematical programming (90C59) Methods of quasi-Newton type (90C53) Noncooperative games (91A10) (n)-person games, (n>2) (91A06)
Cites Work
- Title not available (Why is that?)
- On a Generalization of the Lemke–Howson Algorithm to Noncooperative N-Person Games
- New maximal numbers of equilibria in bimatrix games
- Title not available (Why is that?)
- The tracing procedure: A Bayesian approach to defining a solution for n- person noncooperative games
- Quantal response equilibria for normal form games
- Title not available (Why is that?)
- On the Strategic Stability of Equilibria
- Bimatrix Equilibrium Points and Mathematical Programming
- Equilibrium Points of Bimatrix Games
- Title not available (Why is that?)
- A convergent process of price adjustment and global Newton methods
- Structure theorems for game trees
- Computation of economic equilibria by a sequence of linear complementarity problems
- Bayesian Equilibria of Finite Two-Person Games with Incomplete Information
- Computing Equilibria of N-Person Games
- The Solution of Systems of Piecewise Linear Equations
- A global Newton method to compute Nash equilibria.
- Computing Simply Stable Equilibria
- A procedure for finding Nash equilibria in bi-matrix games
- A course in triangulations for solving equations with deformations
- A differentiable homotopy to compute Nash equilibria of \(n\)-person games
- General equilibrium models and homotopy methods
- A Bound on the Proportion of Pure Strategy Equilibria in Generic Games
- Equivalence of LCP and PLS
- Further remarks on the global Newton method
- Finding a Nash equilibrium in noncooperativeN-person games by solving a sequence of linear stationary point problems
Cited In (35)
- Towards a black-box solver for finite games: computing all equlibria with gambit and PHCpack
- Partially observable game-theoretic agent programming in Golog
- Title not available (Why is that?)
- Zero-sum polymatrix games with link uncertainty: a Dempster-Shafer theory solution
- A differentiable homotopy method to compute perfect equilibria
- A global Newton method to compute Nash equilibria.
- Equilibrium tracing in strategic-form games
- Action-graph games
- Game Theory Explorer: software for the applied game theorist
- Title not available (Why is that?)
- Complementarity enhanced Nash's mappings and differentiable homotopy methods to select perfect equilibria
- On perfect Nash equilibria of polymatrix games
- Algorithm for computing approximate Nash equilibrium in continuous games with application to continuous blotto
- Computing approximate Nash equilibria in polymatrix games
- Finding multiple Nash equilibria via machine learning-supported Gröbner bases
- Homotopy methods to compute equilibria in game theory
- The Zero Regrets Algorithm: Optimizing over Pure Nash Equilibria via Integer Programming
- Smoothing techniques for computing Nash equilibria of sequential games
- Simple search methods for finding a Nash equilibrium
- An inverse-adjusted best response algorithm for Nash equilibria
- Finding a Nash equilibrium in noncooperativeN-person games by solving a sequence of linear stationary point problems
- The polymatrix gap conjecture
- A proximal/gradient approach for computing the Nash equilibrium in controllable Markov games
- A dynamic homotopy interpretation of the logistic quantal response equilibrium correspondence
- Presenting an algorithm to find Nash equilibrium in two-person static games with many strategies
- Title not available (Why is that?)
- Automated equilibrium analysis of \(2\times 2\times 2\) games
- A globally convergent algorithm to compute all Nash equilibria for \(n\)-person games
- A decomposition algorithm for \(N\)-player games
- A finite convergence algorithm for solving linear-quadratic network games with strategic complements and bounded strategies
- Multiple oracle algorithm to solve continuous games
- The return function: a new computable perspective on Bayesian-Nash equilibria
- SOLVING LARGE GAMES WITH SIMULATED FICTITIOUS PLAY
- A continuation method for Nash equilibria in structured games
- Effectiveness of Nash equilibrium search algorithms in four-person games in general and multi-matrix settings
This page was built for publication: Computing Nash equilibria by iterated polymatrix approximation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q953636)
