Search Results for author:
Found 2 papers, 0 papers with code
Nash, Conley, and Computation: Impossibility and Incompleteness in Game Dynamics
We also prove a stronger result for $\epsilon$-approximate Nash equilibria: there are games such that no game dynamics can converge (in an appropriate sense) to $\epsilon$-Nash equilibria, and in fact the set of such games has positive measure.
Exploration-Exploitation in Multi-Agent Competition: Convergence with Bounded Rationality
The interplay between exploration and exploitation in competitive multi-agent learning is still far from being well understood.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
