02/02/2021

Almost Envy-freeness, Envy-rank, and Nash Social Welfare Matchings

Alireza Farhadi, MohammadTaghi Hajiaghai, Mohamad Latifian, Masoud Seddighin, Hadi Yami

Keywords:

Abstract Paper Similar Papers

Abstract: Envy-freeness up to one good (EF1) and envy-freeness up to any good (EFX) are two well-known extensions of envy-freeness for the case of indivisible items. It is shown that EF1 can always be guaranteed for agents with subadditive valuations. In sharp contrast, it is unknown whether or not an EFX allocation always exists, even for four agents and additive valuations. In addition, the best approximation guarantee for EFX is (φ − 1) ≃ 0.61 by Amanitidis et al.. In order to find a middle ground to bridge this gap, in this paper we suggest another fairness criterion, namely envy-freeness up to a random good or EFR, which is weaker than EFX, yet stronger than EF1. For this notion, we provide a polynomial-time 0.73-approximation allocation algorithm. For our algorithm we introduce Nash Social Welfare Matching which makes a connection between Nash Social Welfare and envy freeness.

The video of this talk cannot be embedded. You can watch it here:
https://slideslive.com/38948854
(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
 20:02 
 0
 0
 0
 0
 13:41 
 0
 0
 0
 0
 17:06 
 0
 0
 0
 0
 14:56 
 0
 0
 0
 0
 19:32 
 0
 0
 0
 0
 14:16 
 0
 0
 0
 0
 15:40 
 0
 0
 0
 0
 16:31 
 0
 0
 0
 0
 14:22 
 0
 0
 0
 0
 15:26 
 0
 0
 0
 0
 19:46 
 0
 0
 0
 0
 12:52 
 0
 0
 0
 0
 13:41 
 0
 0
 0
 0
 5:25 
 0
 0
 0
 0
 19:57 
 0
 0
 0
 0
 14:41 
 0
 0
 0
 0
 2:50 
 0
 0
 0
 0
 9:07 
 0
 0
 0
 0
 4:48 
 0
 0
 0
 0
 26:10 
 0
 0
 0
 0
 16:29 
 0
 0
 0
 0
 13:41 
 0
 0
 0
 0
 3:23 
 0
 0
 0
 0
 15:42 
 0
 0
 0
 0
 17:44 
 0
 0
 0
 0
 2:57 
 0
 0
 0
 0
 11:54 
 0
 0
 0
 0
 3:16 
 0
 0
 0
 0
 2:53 
 0
 0
 0
 0
 14:02 
 0
 0
 0
 0
 15:49 
 0
 0
 0
 0
 15:45 
 0
 0
 0
 0
 9:20 
 0
 0
 0
 0
 11:38 
 0
 0
 0
 0
 10:53 
 0
 0
 0
 0
 18:15 
 0
 0
 0
 0
 5:00 
 0
 0
 0
 0
 5:09 
 0
 0
 0
 0
 5:10 
 0
 0
 0
 0
 13:05