Searcharxiv⌕ Search

arXiv subjects

Hervé Moulin

Publications and source records attributed to Hervé Moulin.

3 recordsLinked to original sources

Tight Guarantees in the Commons

In our context-free model of a commons, the function$\mathcal{W}$ transforms the profile of the agents' types $(x_{1},..,x_{n})$ to a freely transferable output $\mathcal{W}(x_{1},..,x_{n})$ that they must share fairly. We expand the ubiquitous concept of \textit{endogenous fair shares} to include both a lower and an upper bound on agent $i$'s share at the interim stage where $i$ only knows its own type $x_{i}$. Two functions $(g^{-},g^{+})$ form a pair of tight guarantees if 1) they satisfy the system of inequalities $% \sum_{1}^{n}g^{-}(x_{i})\leq \mathcal{W}(x)\leq \sum_{1}^{n}g^{+}(x_{i})$ for all profiles, and 2) the interval $[g^{-}(x_{i}),g^{+}(x_{i})]$ is inclusion minimal across all types. For super (resp sub) modular functions 1) the \textit{Unanimity }share% \textit{\ }$\frac{1}{n}\mathcal{W}(x_{i},x_{i},..,x_{i})$ is the unique tight upper (resp lower) guarantee, 2) two \textit{Stand Alone} shares $% g(x_{i})=\mathcal{W}(x_{i},\overbrace{x_{0},..,x_{0}})-\frac{n-1}{n}\mathcal{% W}(\overbrace{x_{0},..,x_{0}})$ (where $x_{0}$ is the smallest or largest type) bracket all tight guarantees on the other side of Unanimity, 3) serial cost sharing implements the Unanimity and Stand Alone guarantees. In applications to specific microeconomic models, tight guarantees vindicate or dismiss familiar deterministic sharing rules and suggest new ones with a clear normative interpretation. Our examples include joint production with substitute or complementary inputs, allocating an indivisible good and cash transfers, sharing the cost (or benefit) of the variance or the spread of types, the waiting cost in a queue, and more.

econ.TH↗

Fair Division of Indivisible Goods: Recent Progress and Open Questions

Allocating resources to individuals in a fair manner has been a topic of interest since ancient times, with most of the early mathematical work on the problem focusing on resources that are infinitely divisible. Over the last decade, there has been a surge of papers studying computational questions regarding the indivisible case, for which exact fairness notions such as envy-freeness and proportionality are hard to satisfy. One main theme in the recent research agenda is to investigate the extent to which their relaxations, like maximin share fairness (MMS) and envy-freeness up to any good (EFX), can be achieved. In this survey, we present a comprehensive review of the recent progress made in the related literature by highlighting different ways to relax fairness notions, common algorithm design techniques, and the most interesting questions for future research.

cs.GT↗

On Hill's Worst-Case Guarantee for Indivisible Bads

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 the MaxMinShare which involves solving an NP-hard problem. We apply Hill's approach to the allocation of indivisible bads (objects with disutilities or costs), and characterise the tight closed form of the worst-case MinMaxShare for a given value of the worst bad. We argue that Hill's share for allocating bads is effective in the sense of being close to the original MinMaxShare value, and there is much to learn about the guarantee an agent can be offered from the disutility of her worst single bad. Furthermore, we prove that the monotonic cover of Hill's share is the best guarantee that can be achieved in Hill's model for all allocation instances.

cs.GT↗