17 citations · 18 across the 4 of their papers we have counts for
7 papers
Robust Cooperation in the Prisoner's Dilemma: Program Equilibrium via Provability Logic
Mihaly Barasz, Paul Christiano, Benja Fallenstein +3
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 ac…
Maximal Functions for Lacunary Dilation Structures
Patrick LaVictoire
If mu is a smooth density on a hypersurface in R^d whose curvature never vanishes to infinite order, and A is a d-by-d matrix whose eigenvalues all have absolute value greater than…
Multivariable averaging on sparse sets
Patrick LaVictoire, Andrew Parrish, Joseph Rosenblatt
Nonstandard ergodic averages can be defined for a measure-preserving action of a group on a probability space, as a natural extension of classical (nonstandard) ergodic averages. W…
Pointwise Convergence for Subsequences of Weighted Averages
Patrick LaVictoire
We prove that if are probability measures on such that converges to 0 uniformly on every compact subset of , then there exists a subsequence s…
Universally L^1-Bad Arithmetic Sequences
Patrick LaVictoire
We present a modified version of Buczolich and Mauldin's proof that the sequence of square numbers is universally L^1-bad. We extend this result to a large class of sequences, incl…
An L^1 Ergodic Theorem for Sparse Random Subsequences
Patrick LaVictoire
We prove an L^1 subsequence ergodic theorem for sequences chosen by independent random selector variables, thereby showing the existence of universally L^1-good sequences nearly as…