This work demonstrates new sufficient conditions for strong Nash equilibria, suggesting efficient algorithms may exist.
Game theory problems have a wide array of applications and intricate structures. Because of this, there are different types of solution concepts available in the literature. In this work, strong Nash equilibria (a type of solution to game theoretic problems that extends Nash equilibria) are explored. Some new sufficient conditions for the existence of said solutions are put forth. An algorithm is also provided that, when convergent, will lead to a strong Nash equilibrium. Some tests to determine the practical efficiency of the algorithm are included.
No takes yet. Share an insight, caveat, or question.
Harris et al. (2025) studied this question.
Synapse has enriched one closely related paper. Consider it for comparative context: