2000 character limit reached
Ranked Pairs minimizes the $p$-norm as $p \to \infty$
Published 13 Jul 2025 in econ.TH and cs.GT | (2507.09654v1)
Abstract: We prove that Ranked Pairs orders candidates in such a way as to minimize the $p$-norm, in the limit as $p \to \infty$, of those head-to-head margins of victory which go against its ordering.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.