{"ID":2895242,"CreatedAt":"2026-06-01T04:54:23.091178241Z","UpdatedAt":"2026-06-01T04:54:23.091178241Z","DeletedAt":null,"paper_url":"https://arxiv.org/abs/2507.09654","arxiv_id":"2507.09654","title":"Ranked Pairs minimizes the $p$-norm as $p \\to \\infty$","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.","short_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.","url_abs":"https://arxiv.org/abs/2507.09654","url_pdf":"https://arxiv.org/pdf/2507.09654v1","authors":"[\"Amir Babak Aazami\",\"Hubert L. Bray\"]","published":"2025-07-13T14:40:15Z","proceeding":"econ.TH","tasks":"[\"econ.TH\",\"cs.GT\"]","methods":"[]","has_code":false}