02/02/2021

Fair and Efficient Allocations with Limited Demands

Sushirdeep Narayana, Ian A. Kash

Keywords:

Abstract Paper Similar Papers

Abstract: We study the fair division problem of allocating multiple resources among a set of agents with Leontief preferences that are each required to complete a finite amount of work, which we term "limited demands". We examine the behavior of the classic Dominant Resource Fairness (DRF) mechanism in this setting and show it is fair but only weakly Pareto optimal and inefficient in many natural examples. We propose as an alternative the Least Cost Product (LCP) mechanism, a natural adaptation of Maximum Nash Welfare to this setting. We characterize the structure of allocation of the LCP mechanism in this setting, show that it is Pareto efficient, and that it satisfies the relatively weak fairness property of sharing incentives. While we prove that it satisfies the stronger fairness property of (expected) envy freeness in some special cases, we provide a counterexample showing it does not do so in general, a striking contrast to the "unreasonable fairness" of Maximum Nash Welfare in other settings. Simulations suggest, however, that these violations of envy freeness are rare in randomly generated examples.

The video of this talk cannot be embedded. You can watch it here:
https://slideslive.com/38948979
(Link will open in new window)
 0
 0
 0
 0
  Share    
This is an embedded video. Talk and the respective paper are published at AAAI 2021 virtual conference. If you are one of the authors of the paper and want to manage your upload, see the question "My papertalk has been externally embedded..." in the FAQ section.

Comments

Post Comment
no comments yet
code of conduct: tbd Characters remaining: 140

Similar Papers

 0
 0
 0
 0
 13:41 
 0
 0
 0
 0
 13:41 
 0
 0
 0
 0
 14:52 
 0
 0
 0
 0
 20:02 
 0
 0
 0
 0
 15:26 
 0
 0
 0
 0
 17:39 
 0
 0
 0
 0
 15:40 
 0
 0
 0
 0
 19:40 
 0
 0
 0
 0
 13:41 
 0
 0
 0
 0
 14:39 
 0
 0
 0
 0
 14:57 
 0
 0
 0
 0
 3:22 
 0
 0
 0
 0
 9:07 
 0
 0
 0
 0
 14:16 
 0
 0
 0
 0
 24:42 
 0
 0
 0
 0
 12:52 
 0
 0
 0
 0
 3:18 
 0
 0
 0
 0
 14:22 
 0
 0
 0
 0
 3:19 
 0
 0
 0
 0
 12:07 
 0
 0
 0
 0
 5:19 
 0
 0
 0
 0
 14:58 
 0
 0
 0
 0
 16:15 
 0
 0
 0
 0
 5:18 
 0
 0
 0
 0
 18:31 
 0
 0
 0
 0
 15:26 
 0
 0
 0
 0
 17:42 
 0
 0
 0
 0
 15:42 
 0
 0
 0
 0
 3:23 
 0
 0
 0
 0
 14:55 
 0
 0
 0
 0
 2:50 
 0
 0
 0
 0
 3:10 
 0
 0
 0
 0
 19:36 
 0
 0
 0
 0
 26:10 
 0
 0
 0
 0
 15:05 
 0
 0
 0
 0
 15:17 
 0
 0
 0
 0
 14:42 
 0
 0
 0
 0
 13:26 
 0
 0
 0
 0
 14:02 
 0
 0
 0
 0
 19:46