Polymatrix Games with Joint Constraints

DOI10.1137/0124043MaRDI QIDQ5668640zbMATH OpenOpenAlexFDO

Authors B. Curtis Eaves

Publication date 1973

Published in SIAM Journal on Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/0124043

Mathematics Subject Classification ID

Noncooperative games (91A10)

Cited in

(10)

• Probabilistic automata
• Copositive-plus Lemke algorithm solves polymatrix games
• Computing solutions of the multiclass network equilibrium problem with affine cost functions
• Solving multispecies population games in continuous space and time
• Committing to correlated strategies with multiple leaders
• On the solution of affine generalized Nash equilibrium problems with shared constraints by Lemke's method
• On perfect Nash equilibria of polymatrix games
• Non-cooperative games with minmax objectives
• Homotopy methods to compute equilibria in game theory
• Enumeration of all the extreme equilibria in game theory: bimatrix and polymatrix games

This page was built for publication: Polymatrix Games with Joint Constraints

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