Semi-Infinite Models for Equilibrium Selection

Authors

  • Maren Beck, Oliver Stein Author

Keywords:

Equilibrium selection, Nash game, payoff dominance, semi-infinite optimization, cutting algorithm.

Abstract

In their seminal work “A General Theory of Equilibrium Selection in Games” [The MIT Press, Cambridge 1988] J.C.Harsanyi and R.Selten introduce the notion of payoff dominance to explain how players select some solution of a Nash equilibrium problem from a set of nonunique equilibria. We formulate this concept for generalized Nash equilibrium problems, relax payoff dominance to the more widely applicable requirement of payoff nondominatedness, and show how different characterizations of generalized Nash equilibria yield different semi-infinite optimization problems for the computation of payoff nondominated equilibria. Since all these problems violate a standard constraint qualification, we also formulate regularized versions of the optimization problems. Under additional assumptions we state a nonlinear cutting algorithm and provide numerical results for a multi-agent portfolio optimization problem

Downloads

Download data is not yet available.

Downloads

Published

2024-01-05

How to Cite

Semi-Infinite Models for Equilibrium Selection. (2024). Minimax Theory and Its Applications, 9(1), 1–18. https://journalmta.com/index.php/jmta/article/view/110