Workshop on Fair Resource Allocation:

Concepts, Algorithms and Complexity

Program

Friday, 23 July 2021

(All times are ET)

8.50 - 9.00. Opening Remarks

9.00 - 9.40. Xiaohui Bei: Fair Division in a Connected World

9.40 - 9.50. Break

9.50 - 10.30. Herve Moulin: Fair Division of a Non-Atomic Cake: Beyond Positivity and Equal Rights

10.30 - 10.40. Break

10.40 - 11.40. Short talks

Xinhang Lu: Fair Division of Mixed Divisible and Indivisible Goods

Rohit Vaish: Approximate Envy-Freeness for Indivisible Chores

Nidhi Rathi: Fair Cake Division Under Monotone Likelihood Ratios F

Argyrios Deligkas: The Parameterized Complexity of Connected Fair Division

Evi Micha: Two-Sided Matching Meets Fair Division

Daniel Schoepflin: Proportionality Up to the Maximin Item for Indivisible Goods

11.40 - 12.00. Break

12.00 - 12.40. Edith Elkind: Mind the Gap: Fair Division under Separation Constraints

12.40 - 12.50. Break

12.50 - 13.30. Jugal Garg: Approximating Maximin Shares


Saturday, 24 July 2021

(All times are ET)

9.00 - 9.40. Warut Suksompong: Asymptotic Results in Fair Division

9.40 - 9.50. Break

9.50 - 10.30. Alexandros Psomas: Dynamic Fair Division - An overview

10.30 - 10.40. Break

10.40 - 11.20. Bhaskar Ray Chaudhury: On the Existence of EFX Allocations

11.20 - 11.50. Break

11.50 - 12.30. Alexandros Hollender: The Complexity of Consensus-Halving and Necklace-Splitting

12.30 - 12.40. Short Break

12.40 - 13.20. Ruta Mehta: On the Computability of Competitive Allocation for Mixed Manna