10 citations · 15 across the 18 of their papers we have counts for
3 papers · 1 filter
Multiplicative Optimism for Constant Regret in Games
Ashkan Soleymani, Georgios Piliouras
We introduce Multiplicatively Optimistic Regret Matching (MORM), an uncoupled learning rule for finite general-sum games. Under simultaneous full-information self-play, every playe…
Paradoxes of Game Theoretic Equilibria and Price of Anarchy
Georgios Piliouras, Ian Gemp, Siqi Liu +1
For decades, static solution concepts (Nash, Correlated, and Coarse Correlated Equilibria) and the Price of Anarchy (PoA) have formed the bedrock of algorithmic game theory, with n…
Debate is efficient with your time
Jonah Brown-Cohen, Geoffrey Irving, Simon C. Marshall +3
AI safety via debate uses two competing models to help a human judge verify complex computational tasks. Previous work has established what problems debate can solve in principle,…