On Covering Single Points by Randomly Ordered Intervals

A strictly increasing, pure jump process with stationary, independent increments hits a single point $r > 0$ with probability 0. Adapting a method of proof, due to Carleson, we obtain a similar result for processes with exchangeable increments. This enables us to solve a regularity problem from game theory concerning probabilities of covering single points by randomly ordered intervals.