5 November 2019, Computational Social Choice Seminar, Simon Rey

Abstract

In this talk I will present some recent work I have been doing with Haris Aziz. We consider a multiagent resource allocation setting in which an agent's utility may decrease or increase when an item is allocated. We present stronger and relaxed versions of the group envy-freeness concept that are especially suitable for the allocation of indivisible items. Of particular interest is a concept called group envy-freeness up to one item (GEF1). We study which fairness concepts guarantee the existence of a fair allocation under which preference domain. For two natural classes of additive utilities, we design polynomial-time algorithms to compute a GEF1 allocation.

For more information on the Computational Social Choice Seminar, please consult https://staff.science.uva.nl/u.endriss/seminar/.