100 citations · 251 across the 21 of their papers we have counts for
4 papers · 1 filter
Cooperative and uncooperative institution designs: Surprises and problems in open-source game theory
Andrew Critch, Michael Dennis, Stuart Russell
It is increasingly possible for real-world agents, such as software-based agents or human institutions, to view the internal programming of other such agents that they interact wit…
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…
Multi-Principal Assistance Games: Definition and Collegial Mechanisms
Arnaud Fickinger, Simon Zhuang, Andrew Critch +2
We introduce the concept of a multi-principal assistance game (MPAG), and circumvent an obstacle in social choice theory, Gibbard's theorem, by using a sufficiently collegial prefe…
Parametric Bounded Löb's Theorem and Robust Cooperation of Bounded Agents
Andrew Critch
Löb's theorem and Gödel's theorems make predictions about the behavior of systems capable of self-reference with unbounded computational resources with which to write and evaluate…