Dear all,

The next talk in the Computational Social Choice Seminar at the ILLC will be given on Tuesday by Simon Rey, who started his PhD at the ILLC a few weeks ago. Simon will be speaking about fair division in the presence of both goods and bads. Hope to see you there!

As always, for more information on the COMSOC Seminar please consult http://www.illc.uva.nl/~ulle/seminar/.

All the best, Ulle

-------------------------------------------------------------------------

Speaker: Simon Rey (ILLC) Title: Almost Group Envy-free Allocation of Indivisible Goods and Chores Date and time: Tuesday 5 November 2019, 16:00 Location: F3.20, Science Park 107, Amsterdam

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.