5 citations · 18 across the 9 of their papers we have counts for
5 papers · 1 filter
The Computational Complexity of Single-Player Imperfect-Recall Games
Emanuel Tewolde, Caspar Oesterheld, Vincent Conitzer +1
We study single-player extensive-form games with imperfect recall, such as the Sleeping Beauty problem or the Absentminded Driver game. For such games, two natural equilibrium conc…
Game Theory with Simulation of Other Players
Vojtech Kovarik, Caspar Oesterheld, Vincent Conitzer
Game-theoretic interactions with AI agents could differ from traditional human-human interactions in various ways. One such difference is that it may be possible to simulate an AI…
A Note on the Compatibility of Different Robust Program Equilibria of the Prisoner's Dilemma
Caspar Oesterheld
We study a program game version of the Prisoner's Dilemma, i.e., a two-player game in which each player submits a computer program, the programs are given read access to each other…
Similarity-based cooperative equilibrium
Caspar Oesterheld, Johannes Treutlein, Roger Grosse +2
As machine learning agents act more autonomously in the world, they will increasingly interact with each other. Unfortunately, in many social dilemmas like the one-shot Prisoner's…
For Learning in Symmetric Teams, Local Optima are Global Nash Equilibria
Scott Emmons, Caspar Oesterheld, Andrew Critch +2
Although it has been known since the 1970s that a globally optimal strategy profile in a common-payoff game is a Nash equilibrium, global optimality is a strict requirement that li…