2 citations · 5 across the 9 of their papers we have counts for
Showing cs.GTShow all
2 papers · 1 filter
cs.GT2026
Cycle structure of best-response dynamics in random bimatrix games
Georgios Nikolaos Karelas, Gábor Lugosi, Rui-Ray Zhang
We study the best-response dynamics in games with random payoffs. We consider two-player bimatrix games, with strategies each. We assume that payoffs come from a continuous dis…
cs.GT2025
Finding a Nash equilibrium of a random win-lose game in expected polynomial time
Andrea Collevecchio, Gabor Lugosi, Adrian Vetta +1
A long-standing open problem in algorithmic game theory asks whether or not there is a polynomial time algorithm to compute a Nash equilibrium in a random bimatrix game. We study r…