4 citations · 8 across the 9 of their papers we have counts for
Showing cs.GTShow all
2 papers · 1 filter
cs.GT2026
Computationally Efficient Collaborative Communication Via Regularity-Based Coarsening
Mark Bedaywi, Scott Emmons, Nika Haghtalab +1
Our results show that the existence of a short high-utility protocol already suffices for efficient communication. In particular, in a game with possible observations and a…
cs.GT2024
The Partially Observable Off-Switch Game
Andrew Garber, Rohan Subramani, Linus Luu +3
A wide variety of goals could cause an AI to disable its off switch because "you can't fetch the coffee if you're dead" (Russell 2019). Prior theoretical work on this shutdown prob…