We study a fundamental model of online preference aggregation, where an
algorithm maintains an ordered list of $n$ elements. An input is a stream of
preferred sets $R_1, R_2, \dots, R_t, \dots$. Upon seeing $R_t$ and without
knowledge of any future sets, an algorithm has to rerank elem