Copositive-plus Lemke algorithm solves polymatrix games

DOI10.1016/0167-6377(91)90015-HMaRDI QIDQ1180832zbMATH OpenOpenAlexFDO

Authors Douglas A. Miller, Steven W. Zucker

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

zbMATH Keywords

artificial neural networkscopositive-plus Lemke algorithmNash equilibria for polymatrix \(n\)-person gamesvisual labeling

Mathematics Subject Classification ID

Noncooperative games (91A10) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Neural networks for/in biological studies, artificial life and related topics (92B20) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Recommendations

• Computing Nash equilibria by iterated polymatrix approximation
• Publication:3468904
• Polymatrix games and optimization problems
• Finding a Nash equilibrium in noncooperativeN-person games by solving a sequence of linear stationary point problems

Cites work

• scientific article; zbMATH DE number 3716008 (Why is no real title available?)
• scientific article; zbMATH DE number 192986 (Why is no real title available?)
• scientific article; zbMATH DE number 3067835 (Why is no real title available?)
• Bimatrix Equilibrium Points and Mathematical Programming
• Complementary pivot theory of mathematical programming
• Computing Equilibria of N-Person Games
• Equilibria of Polymatrix Games
• Equilibrium Points of Bimatrix Games
• Non-cooperative games
• On Quadratic Programming
• On the Foundations of Relaxation Labeling Processes
• Polymatrix Games with Joint Constraints
• The Linear Complementarity Problem
• The complexity of recognizing polyhedral scenes
• ``Neural computation of decisions in optimization problems

Cited in

(10)

• Completely positive matrices: real, rational, and integral
• Zero-sum polymatrix games with link uncertainty: a Dempster-Shafer theory solution
• Copositivity and complete positivity. Abstracts from the workshop held October 29 -- Novermber 4, 2017
• Think co(mpletely)positive! Matrix properties, examples and a clustered bibliography on copositive optimization
• Optimality conditions and numerical algorithms for a class of linearly constrained minimax optimization problems
• Graph transduction as a noncooperative game
• On perfect Nash equilibria of polymatrix games
• Generalized linear complementarity in a problem of \(n\)-person games
• Solving multispecies population games in continuous space and time
• The polymatrix gap conjecture

This page was built for publication: Copositive-plus Lemke algorithm solves polymatrix games

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1180832)