Search Results for author: Caspar Oesterheld

Found 8 papers, 3 papers with code

Recursive Joint Simulation in Games

no code implementations12 Feb 2024 Vojtech Kovarik, Caspar Oesterheld, Vincent Conitzer

In this paper, we study an interaction between AI agents where the agents run a recursive joint simulation.

A Theory of Bounded Inductive Rationality

no code implementations11 Jul 2023 Caspar Oesterheld, Abram Demski, Vincent Conitzer

In this paper, we develop a theory of rational decision making that does not assume logical omniscience.

Decision Making

The Computational Complexity of Single-Player Imperfect-Recall Games

no code implementations28 May 2023 Emanuel Tewolde, Caspar Oesterheld, Vincent Conitzer, Paul W. Goldberg

For such games, two natural equilibrium concepts have been proposed as alternative solution concepts to ex-ante optimality.

Incentivizing honest performative predictions with proper scoring rules

1 code implementation28 May 2023 Caspar Oesterheld, Johannes Treutlein, Emery Cooper, Rubi Hudson

We show that, for binary predictions, if the influence of the expert's prediction on outcomes is bounded, it is possible to define scoring rules under which optimal reports are arbitrarily close to fixed points.

For Learning in Symmetric Teams, Local Optima are Global Nash Equilibria

1 code implementation7 Jul 2022 Scott Emmons, Caspar Oesterheld, Andrew Critch, Vincent Conitzer, Stuart Russell

In this work, we show that any locally optimal symmetric strategy profile is also a (global) Nash equilibrium.

Reinforcement Learning in Newcomblike Environments

no code implementations NeurIPS 2021 James Bell, Linda Linsefors, Caspar Oesterheld, Joar Skalse

This gives us a powerful tool for reasoning about the limit behaviour of agents -- for example, it lets us show that there are Newcomblike environments in which a reinforcement learning agent cannot converge to any optimal policy.

reinforcement-learning Reinforcement Learning (RL)

A New Formalism, Method and Open Issues for Zero-Shot Coordination

1 code implementation11 Jun 2021 Johannes Treutlein, Michael Dennis, Caspar Oesterheld, Jakob Foerster

We introduce an extension of the algorithm, other-play with tie-breaking, and prove that it is optimal in the LFC problem and an equilibrium in the LFC game.

Multi-agent Reinforcement Learning

Cannot find the paper you are looking for? You can Submit a new open access paper.