BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//University of Liverpool Computer Science Seminar System//v2//EN
BEGIN:VEVENT
DTSTAMP:20260921T105441Z
UID:Seminar-pizza-1088@lxserverM.csc.liv.ac.uk
ORGANIZER:CN=Qiyi Tang:MAILTO:Qiyi.Tang@liverpool.ac.uk
DTSTART:20231027T140000
DTEND:20231027T150000
SUMMARY:Friday Lunch and Talk Series
DESCRIPTION:Georgios Birmpas: Fairly allocating indivisible goods to strategic agents\n\nWe consider the problem of fairly allocating a set of indivisible goods to a set of strategic agents with additive valuation functions. We assume no monetary transfers and, therefore, a mechanism in our setting is an algorithm that takes as input the reported---rather than the true---values of the agents. Our main goal is to explore whether there exist mechanisms that have pure Nash equilibria for every instance and, at the same time, provide fairness guarantees for the allocations that correspond to these equilibria. We focus on a relaxation of envy-freeness, namely envy-freeness up to one good (EF1), and we positively answer the above question. In particular, we study an algorithm that is known to produce such allocations in the non-strategic setting: Round-Robin. We show that all of its pure Nash equilibria induce allocations that are EF1 with respect to the underlying true values, while we also prove that surprisingly, a version of this result holds even for agents with cancelable or submodular valuation functions.\n\nhttps://www.csc.liv.ac.uk/research/seminars/abstract.php?id=1088
LOCATION:Ashton Lecture Theatre
END:VEVENT
END:VCALENDAR