4 citations · 6 across the 9 of their papers we have counts for
Showing 2026Show all
2 papers · 1 filter
cs.GT2026
Avoiding the Worst: The Computational Complexity of Not Worst-Responding
Mete Şeref Ahunbay, Paul W. Goldberg, Edwin Lock +3
Finding, counting, or determining the existence of pure Nash equilibria, where players must play optimally given the others' actions, are known to be computationally intractable pr…
econ.TH2026
Game connectivity and adaptive dynamics in many-action games
Tom Johnston, Michael Savery, Alex Scott +1
We study the typical structure of games in terms of their connectivity properties. A game is `connected' if it has a pure Nash equilibrium and there is a best-response path from ev…