Fair division

Graduate Seminar on Algorithms and Optimization (S4C3), Summer 2025

Course instructors: Hannaneh Akrami, Wenzheng Li, László Végh

Course information

Slides from the planning meeting

Schedule

Regular talks normally run 14:15-15:45, and practice talks on 16:15-17:45 on Friday. The seminars will take place at the Seminar room in the Discrete Mathematics Institute (Lennéstr. 2).

Nr. Practice talk Presentation Name Topic Mentoring
1 27.03 11.04 Lilian Witters Rental Harmony: Sperner's Lemma in Fair Division Wenzheng Li
2 17.04. 2.05. Johann Haas-Jobelius The Unreasonable Fairness of Maximum Nash Welfare Hana Akrami
3 24.04. 09.05. Jonas Handwerker Finding Fair and Efficient Allocations Wenzheng Li
4 02.05. 16.05. Milica Šobot Convex Program Duality, Fisher Markets, and Nash Social Welfare Wenzheng Li
5 09.05. 23.05. Owen Cardwell On Approximate Envy-Freeness for Indivisible Chores and Mixed Resources Hana Akrami
6 16.05. 30.05. Abdullah Irfan Basheer A Little Charity Guarantees Almost Envy-Freeness Hana Akrami
7 23.05. 06.06. Jakob Gierschmann EFX: A Simpler Approach and an (Almost) Optimal Guarantee via Rainbow Cycle Number Hana Akrami
8 03.06. 20.06. Miká Kruschel Simplification and Improvement of MMS Approximation Hana Akrami
9 16.06. 27.06. Lucia Krajčoviechová Reduction from Chores Allocation to Job Scheduling Hana Akrami
10 20.06. 04.07. Leonard Weismantel Approximating Nash Social Welfare by Matching and Local Search Wenzheng Li
11 27.06. 11.07. Jofre Costa i Delgado A Note on Approximating Weighted Nash Social Welfare with Additive Valuations Wenzheng Li
12 04.07 18.07. Moritz Petrich Best of Both Worlds: Ex-Ante and Ex-Post Fairness in Resource Allocation Hana Akrami