On Hill's Worst-Case Guarantee for Indivisible Bads
Bo Li, Herv\'e Moulin, Ankang Sun, Yu Zhou

TL;DR
This paper extends Hill's worst-case guarantee approach to the allocation of indivisible bads, providing a tight closed-form characterization of the MinMaxShare and demonstrating its effectiveness and optimality within Hill's model.
Contribution
It applies Hill's guarantee concept to bads, derives a closed-form solution for the worst-case MinMaxShare, and proves the monotonic cover as the best possible guarantee in this setting.
Findings
Derived a closed-form expression for the worst-case MinMaxShare for bads.
Showed Hill's guarantee is close to the original MinMaxShare in effectiveness.
Proved the monotonic cover of Hill's share is the optimal guarantee in Hill's model.
Abstract
When allocating objects among agents with equal rights, people often evaluate the fairness of an allocation rule by comparing their received utilities to a benchmark share - a function only of her own valuation and the number of agents. This share is called a guarantee if for any profile of valuations there is an allocation ensuring the share of every agent. When the objects are indivisible goods, Budish [J. Political Econ., 2011] proposed MaxMinShare, i.e., the least utility of a bundle in the best partition of the objects, which is unfortunately not a guarantee. Instead, an earlier pioneering work by Hill [Ann. Probab., 1987] proposed for a share the worst-case MaxMinShare over all valuations with the same largest possible single-object value. Although Hill's share is more conservative than the MaxMinShare, it is an actual guarantee and its computation is elementary, unlike that of…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsLaw, Economics, and Judicial Systems · Game Theory and Voting Systems · Auction Theory and Applications
