Copositive-plus Lemke algorithm solves polymatrix games
DOI10.1016/0167-6377(91)90015-HzbMath0742.90077OpenAlexW2092245690MaRDI QIDQ1180832
Steven W. Zucker, Douglas A. Miller
Publication date: 27 June 1992
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0167-6377(91)90015-h
artificial neural networkscopositive-plus Lemke algorithmNash equilibria for polymatrix \(n\)-person gamesvisual labeling
Noncooperative games (91A10) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Neural networks for/in biological studies, artificial life and related topics (92B20) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items (9)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- ``Neural computation of decisions in optimization problems
- The complexity of recognizing polyhedral scenes
- Complementary pivot theory of mathematical programming
- Non-cooperative games
- On the Foundations of Relaxation Labeling Processes
- Equilibrium Points of Bimatrix Games
- Bimatrix Equilibrium Points and Mathematical Programming
- Computing Equilibria of N-Person Games
- The Linear Complementarity Problem
- Equilibria of Polymatrix Games
- On Quadratic Programming
- Polymatrix Games with Joint Constraints
This page was built for publication: Copositive-plus Lemke algorithm solves polymatrix games