19/08/2021

Fair and Efficient Resource Allocation with Partial Information

Daniel Halpern, Nisarg Shah

Keywords: Agent-based and Multi-agent Systems, Computational Social Choice, Resource Allocation, Fairness

Abstract Paper Similar Papers

Abstract: We study the fundamental problem of allocating indivisible goods to agents with additive preferences. We consider eliciting from each agent only a ranking of her k most preferred goods instead of her full cardinal valuations. We characterize the amount of preference information that must be elicited in order to satisfy envy-freeness up to one good and approximate maximin share guarantee, two widely studied fairness notions. We also analyze the multiplicative loss in social welfare incurred due to the lack of full information with and without fairness requirements.

 0
 0
 0
 0
  Share    
This is an embedded video. Talk and the respective paper are published at IJCAI 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
 15:00 
 0
 0
 0
 0
 14:42 
 0
 0
 0
 0
 15:40 
 0
 0
 0
 0
 18:01 
 0
 0
 0
 0
 13:41 
 0
 0
 0
 0
 11:02 
 0
 0
 0
 0
 19:32 
 0
 0
 0
 0
 15:26 
 0
 0
 0
 0
 14:16 
 0
 0
 0
 0
 13:32 
 0
 0
 0
 0
 14:51 
 0
 0
 0
 0
 19:55 
 0
 0
 0
 0
 3:23 
 0
 0
 0
 0
 17:39 
 0
 0
 0
 0
 24:42 
 0
 0
 0
 0
 3:21 
 0
 0
 0
 0
 15:05 
 0
 0
 0
 0
 2:50 
 0
 0
 0
 0
 15:42 
 0
 0
 0
 0
 20:02 
 0
 0
 0
 0
 14:56 
 0
 0
 0
 0
 13:47 
 0
 0
 0
 0
 13:41 
 0
 0
 0
 0
 18:53 
 0
 0
 0
 0
 12:07 
 0
 0
 0
 0
 18:15 
 0
 0
 0
 0
 5:17 
 0
 0
 0
 0
 18:31 
 0
 0
 0
 0
 14:52 
 0
 0
 0
 0
 19:21 
 0
 0
 0
 0
 5:18 
 0
 0
 0
 0
 3:27 
 0
 0
 0
 0
 19:33 
 0
 0
 0
 0
 14:39 
 0
 0
 0
 0
 14:22 
 0
 0
 0
 0
 4:20 
 0
 0
 0
 0
 16:00 
 0
 0
 0
 0
 15:48 
 0
 0
 0
 0
 3:05 
 0
 0
 0
 0
 5:16