Finding a Nash equilibrium in noncooperativeN-person games by solving a sequence of linear stationary point problems
From MaRDI portal
Publication:4300608
DOI10.1007/BF01435463zbMath0820.90133OpenAlexW2568017486MaRDI QIDQ4300608
Antoon van den Elzen, Adolphus J. J. Talman
Publication date: 15 August 1994
Published in: [https://portal.mardi4nfdi.de/entity/Q4300601 ZOR Zeitschrift f�r Operations Research Mathematical Methods of Opeartions Research] (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01435463
Nash equilibriumbi-matrix gamenonlinear stationary point problemnoncooperative normal form \(N\)-person game
Related Items (1)
Cites Work
- Simplicial algorithms on the simplotope
- A procedure for finding Nash equilibria in bi-matrix games
- Computation of economic equilibria by a sequence of linear complementarity problems
- Computational Experience in Solving Equilibrium Models by a Sequence of Linear Complementarity Problems
- An algorithm based on a sequence of linear complementarity problems applied to a walrasian equilibrium model: An example
- A new simplicial variable dimension algorithm to find equilibria on the product space of unit simplices
- Equilibrium Points of Bimatrix Games
- Computing Equilibria of N-Person Games
- On a Generalization of the Lemke–Howson Algorithm to Noncooperative N-Person Games
This page was built for publication: Finding a Nash equilibrium in noncooperativeN-person games by solving a sequence of linear stationary point problems
