Brief introduction on fair allocations of divisible and indivisible goods

Speaker:

Haoyun Jiang and Siyuan Du (undergraduate student in University of Electronic Science and Technology of China)

Time:

10:00-11:00 (Time in Beijing)
15:00-16:00 (Time in Auckland)
December 17, 2021 (Friday)

Venue:

B1-518B, Research Building 4

Abstract:

The problem of fair allocations of goods can be divided into two sub-problems, goods are divisible and goods are indivisible.The two sub-problems have similarities but also many differences. In this presentation, we will briefly introduce some results of these two problems up to now, and give a more detailed description of the algorithms about different fairness concepts like envy-free (EF) and envy-free up to one item (EF1) in these two sub-problems.