We survey eight research areas organized around one question: As learning systems become increasingly intelligent and autonomous, what design principles can best ensure that their behavior is aligned… (More)

We consider the one-shot Prisoner’s Dilemma between algorithms with read-access to one anothers’ source codes, and we use the modal logic of provability to build agents that can achieve mutual… (More)

Applications of game theory often neglect that real-world agents normally have some amount of out-of-band information about each other. We consider the limiting case of a one-shot Prisoner’s Dilemma… (More)

We prove an L subsequence ergodic theorem for sequences chosen by independent random selector variables, thereby showing the existence of universally L-good sequences nearly as sparse as the set of… (More)

We prove an L subsequence ergodic theorem for sequences chosen by independent random selector variables, thereby showing the existence of universally L-good sequences nearly as sparse as the set of… (More)

Pointwise Ergodic Theorems for Nonconventional L Averages by Patrick LaVictoire Doctor of Philosophy in Mathematics University of California, Berkeley Professor F. Michael Christ, Chair A topic of… (More)

We prove an L subsequence ergodic theorem for sequences chosen by independent random selector variables, thereby showing the existence of sparser universally L-good sequences than had been previously… (More)

This is an earlier, but more general, version of ”An L Ergodic Theorem for Sparse Random Subsequences”. We prove an L ergodic theorem for averages defined by independent random selector variables, in… (More)