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
DOI10.1155/2014/640960zbMath1407.91023OpenAlexW1965019781WikidataQ59068526 ScholiaQ59068526MaRDI QIDQ1718839
Zhengtian Wu, Qing Gao, Hamid Reza Karimi, Chuangyin Dang, Changan Zhu
Publication date: 8 February 2019
Published in: Mathematical Problems in Engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2014/640960
Integer programming (90C10) Noncooperative games (91A10) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Related Items (2)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Computation of the Nash equilibrium selected by the tracing procedure in \(N\)-person games
- A globally convergent algorithm to compute all Nash equilibria for \(n\)-person games
- Homotopy methods to compute equilibria in game theory
- Finding all Nash equilibria of a finite game using polynomial algebra
- Enumeration of Nash equilibria for two-player games
- On equilibria in finite games
- The tracing procedure: A Bayesian approach to defining a solution for n- person noncooperative games
- The computation of fixed points and applications
- A convergent process of price adjustment and global Newton methods
- An algorithmic approach toward the tracing procedure for bi-matrix games
- A global Newton method to compute Nash equilibria.
- Piecewise linear methods for nonlinear equations and optimization
- A differentiable homotopy approach for solving polynomial optimization problems and noncooperative games
- Non-cooperative games
- Data-driven monitoring for stochastic systems and its application on batch process
- The complexity of computing a Nash equilibrium
- A unified approach to the implementation of several restart fixed point algorithms and a new variable dimension algorithm
- A procedure for finding Nash equilibria in bi-matrix games
- The D1-Triangulation of Rn for Simplicial Algorithms for Computing Solutions of Nonlinear Equations
- Finding Pure Nash Equilibrium of Graphical Game Via Constraints Satisfaction Approach
- Simplicial Variable Dimension Algorithms for Solving the Nonlinear Complementarity Problem on a Product of Unit Simplices Using a General Labelling
- A Continuous Deformation Algorithm on the Product Space of Unit Simplices
- A restart algorithm for computing fixed points without an extra dimension
- Homotopies for computation of fixed points
- A new simplicial variable dimension algorithm to find equilibria on the product space of unit simplices
- Equilibrium Points of Bimatrix Games
- The Approximation of Fixed Points of a Continuous Mapping
- Computing Equilibria of N-Person Games
- On a Generalization of the Lemke–Howson Algorithm to Noncooperative N-Person Games
- Equilibrium points in n -person games
- A differentiable homotopy to compute Nash equilibria of \(n\)-person games
This page was built for publication: 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
