4 citations · 5 across the 3 of their papers we have counts for
3 papers
Nash, Conley, and Computation: Impossibility and Incompleteness in Game Dynamics
Jason Milionis, Christos Papadimitriou, Georgios Piliouras +1
Under what conditions do the behaviors of players, who play a game repeatedly, converge to a Nash equilibrium? If one assumes that the players' behavior is a discrete-time or conti…
Morse Theoretic Templates for High Dimensional Homology Computation
Shaun Harker, Konstantin Mischaikow, Kelly Spendlove
We introduce the notion of a template for discrete Morse theory. Templates provide a memory efficient approach to the computation of homological invariants (e.g., homology, persist…
Exploration-Exploitation in Multi-Agent Competition: Convergence with Bounded Rationality
Stefanos Leonardos, Georgios Piliouras, Kelly Spendlove
The interplay between exploration and exploitation in competitive multi-agent learning is still far from being well understood. Motivated by this, we study smooth Q-learning, a pro…