Identifying socially optimal equilibria using combinatorial properties of nash equilibria in bimatrix games
Year of publication: |
2024
|
---|---|
Authors: | Dehghanian, Amin ; Xie, Yujia ; Serban, Nicoleta |
Published in: |
INFORMS journal on computing : JOC ; charting new directions in operations research and computer science ; a journal of the Institute for Operations Research and the Management Sciences. - Linthicum, Md. : INFORMS, ISSN 1526-5528, ZDB-ID 2004082-9. - Vol. 36.2024, 5, p. 1261-1286
|
Subject: | branch-and-cut | Benders’ decomposition | bimatrix game | minimally infeasible subsystem | socially optimal equilibrium | support of a strategy profile | Spieltheorie | Game theory | Nash-Gleichgewicht | Nash equilibrium | Mathematische Optimierung | Mathematical programming | Nichtkooperatives Spiel | Noncooperative game | Gleichgewichtsmodell | Equilibrium model |
-
Entangled equilibria for bimatrix games
Beek, Andries van, (2024)
-
Computational aspects of the open-loop equilibrium in linear quadratic games
Engwerda, Jacob Christiaan, (1997)
-
Foundations of models with complementarities
Sabarwal, Tarun, (2023)
- More ...
-
Parallel subgradient algorithm with block dual decomposition for large-scale optimization
Zheng, Yuchen, (2022)
-
Wait time speeds up : effects of scent arousal on time perception in service marketing
Yu, Ziyue, (2024)
-
Service operations classification for risk management
Shafti, F., (2010)
- More ...