Fast algorithms for rank-1 bimatrix games
| Year of publication: |
2021
|
|---|---|
| Authors: | Adsul, Bharat ; Garg, Jugal ; Mehta, Ruta ; Sohoni, Milind ; Stengel, Bernhard von |
| Published in: |
Operations research. - Catonsville, MD : INFORMS, ISSN 0030-364X, ZDB-ID 123389-0. - Vol. 69.2021, 2, p. 613-631
|
| Subject: | bimatrix game | Nash equilibrium | rank-1 game | polynomial-time algorithm | homeomorphism | Spieltheorie | Game theory | Nash-Gleichgewicht | Algorithmus | Algorithm |
-
Savani, Rahul, (2016)
-
Suzuki, Ken-ichi, (2018)
-
Technical note: characterizing and computing the set of nash equilibria via vector optimization
Feinstein, Zachary, (2024)
- More ...
-
Efficient computation of behavior strategies
Stengel, Bernhard von, (1996)
-
Computing equilibria for two-person games
Stengel, Bernhard von, (2002)
-
Zero-sum games and linear programming duality
Stengel, Bernhard von, (2024)
- More ...