Computing Nash equilibria by iterated polymatrix approximation
From MaRDI portal
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
Cites work
- scientific article; zbMATH DE number 4029737 (Why is no real title available?)
- scientific article; zbMATH DE number 3487169 (Why is no real title available?)
- scientific article; zbMATH DE number 3571895 (Why is no real title available?)
- scientific article; zbMATH DE number 1099369 (Why is no real title available?)
- A Bound on the Proportion of Pure Strategy Equilibria in Generic Games
- A convergent process of price adjustment and global Newton methods
- A course in triangulations for solving equations with deformations
- A differentiable homotopy to compute Nash equilibria of \(n\)-person games
- A global Newton method to compute Nash equilibria.
- A procedure for finding Nash equilibria in bi-matrix games
- Bayesian Equilibria of Finite Two-Person Games with Incomplete Information
- Bimatrix Equilibrium Points and Mathematical Programming
- Computation of economic equilibria by a sequence of linear complementarity problems
- Computing Equilibria of N-Person Games
- Computing Simply Stable Equilibria
- Equilibrium Points of Bimatrix Games
- Equivalence of LCP and PLS
- Finding a Nash equilibrium in noncooperativeN-person games by solving a sequence of linear stationary point problems
- Further remarks on the global Newton method
- General equilibrium models and homotopy methods
- New maximal numbers of equilibria in bimatrix games
- On a Generalization of the Lemke–Howson Algorithm to Noncooperative N-Person Games
- On the Strategic Stability of Equilibria
- Quantal response equilibria for normal form games
- Structure theorems for game trees
- The Solution of Systems of Piecewise Linear Equations
- The tracing procedure: A Bayesian approach to defining a solution for n- person noncooperative games
Cited in
(35)- Partially observable game-theoretic agent programming in Golog
- A proximal/gradient approach for computing the Nash equilibrium in controllable Markov games
- scientific article; zbMATH DE number 2151184 (Why is no real title available?)
- Algorithm for computing approximate Nash equilibrium in continuous games with application to continuous blotto
- scientific article; zbMATH DE number 2034487 (Why is no real title available?)
- Zero-sum polymatrix games with link uncertainty: a Dempster-Shafer theory solution
- A differentiable homotopy method to compute perfect equilibria
- The polymatrix gap conjecture
- Multiple oracle algorithm to solve continuous games
- SOLVING LARGE GAMES WITH SIMULATED FICTITIOUS PLAY
- Simple search methods for finding a Nash equilibrium
- An inverse-adjusted best response algorithm for Nash equilibria
- Computing approximate Nash equilibria in polymatrix games
- Presenting an algorithm to find Nash equilibrium in two-person static games with many strategies
- Complementarity enhanced Nash's mappings and differentiable homotopy methods to select perfect equilibria
- Towards a black-box solver for finite games: computing all equlibria with gambit and PHCpack
- Game Theory Explorer: software for the applied game theorist
- scientific article; zbMATH DE number 3956853 (Why is no real title available?)
- Homotopy methods to compute equilibria in game theory
- A global Newton method to compute Nash equilibria.
- Automated equilibrium analysis of \(2\times 2\times 2\) games
- Action-graph games
- A globally convergent algorithm to compute all Nash equilibria for \(n\)-person games
- A dynamic homotopy interpretation of the logistic quantal response equilibrium correspondence
- A continuation method for Nash equilibria in structured games
- The Zero Regrets Algorithm: Optimizing over Pure Nash Equilibria via Integer Programming
- Equilibrium tracing in strategic-form games
- Finding a Nash equilibrium in noncooperativeN-person games by solving a sequence of linear stationary point problems
- Effectiveness of Nash equilibrium search algorithms in four-person games in general and multi-matrix settings
- Finding multiple Nash equilibria via machine learning-supported Gröbner bases
- The return function: a new computable perspective on Bayesian-Nash equilibria
- A decomposition algorithm for \(N\)-player games
- A finite convergence algorithm for solving linear-quadratic network games with strategic complements and bounded strategies
- On perfect Nash equilibria of polymatrix games
- Smoothing techniques for computing Nash equilibria of sequential games
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)
