Polymatrix Games with Joint Constraints

DOI10.1137/0124043zbMath0253.90067OpenAlexW1984519282MaRDI QIDQ5668640

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)

Related Items (10)

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

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