Equilibrium identification and selection in finite games

DOI10.1287/OPRE.2022.2413MaRDI QIDQ6579662zbMATH OpenFDO

Authors Tobias Crönert, Stefan Minner

Publication date 25 July 2024

Published in Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/OPRE.2022.2413

zbMATH Keywords

column-and-row generationfinite gameNash equilibrium identification and selectionoptimization

Mathematics Subject Classification ID

Applications of game theory (91A80) Decision theory (91B06)

Recommendations

• About selecting the ``best Nash equilibrium
• A mixed 0-1 linear programming approach to the computation of all pure-strategy Nash equilibria of a finite \(n\)-person game in normal form
• Equilibrium selection via optimal transport
• Nash equilibrium sorting genetic algorithm for simultaneous competitive maximal covering location with multiple players
• Some concepts of non-myopic equilibria in games with finite strategy sets and their properties

Cited in

(3)

• Fifty years of decision analysis in operational research: a review
• Existence theorems of generalized K-lateral support equilibria via local cooperative strategies for multi-player pure strategy games in tensor form
• Computing approximate Nash equilibria for integer programming games

This page was built for publication: Equilibrium identification and selection in finite games

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