activity
20212024
most citedSurvey of Self-Play in Reinforcement Learning

4 citations · 6 across the 5 of their papers we have counts for

collaborators
Showing cs.GTShow all

5 papers · 1 filter

cs.GT2024

Safe Pareto Improvements for Expected Utility Maximizers in Program Games

Anthony DiGiovanni, Jesse Clifton, Nicolas Macé

Agents in mixed-motive coordination problems such as Chicken may fail to coordinate on a Pareto-efficient outcome. Safe Pareto improvements (SPIs) were originally proposed to mitig…

cs.GT2022

Evolutionary Stability of Other-Regarding Preferences Under Complexity Costs

Anthony DiGiovanni, Nicolas Macé, Jesse Clifton

The evolution of preferences that account for other agents' fitness, or other-regarding preferences, has been modeled with the "indirect approach" to evolutionary game theory. Unde…

cs.GT2022★ 2 cited

Commitment games with conditional information disclosure

Anthony DiGiovanni, Jesse Clifton

The conditional commitment abilities of mutually transparent computer agents have been studied in previous work on commitment games and program equilibrium. This literature has sho…

cs.GT2021

Balancing Adaptability and Non-exploitability in Repeated Games

Anthony DiGiovanni, Ambuj Tewari

We study the problem of guaranteeing low regret in repeated games against an opponent with unknown membership in one of several classes. We add the constraint that our algorithm is…

cs.GT2021★ 4 cited

Survey of Self-Play in Reinforcement Learning

Anthony DiGiovanni, Ethan C. Zell

In reinforcement learning (RL), the term self-play describes a kind of multi-agent learning (MAL) that deploys an algorithm against copies of itself to test compatibility in variou…