- Start Date:
May 29, 2026
- Event Start Time:
10:00 AM
- Event End Time:
11:00 AM
- Organizers:
Lazaros Gallos
- Seminar Series:
REU Seminar
- Presenter(s):
Xin Huang - Kyushu University
- Event Location:
DIMACS Seminar room
- Abstract:
Fair division of indivisible items is a central problem in algorithmic game theory, with many natural applications in resource allocation. Unlike divisible resources, indivisible items cannot always be allocated in a perfectly fair way, so one of the main goals is to design algorithms with provable fairness guarantees. In this introductory talk, I will focus on the maximin share (MMS), one of the most widely studied fairness notions for indivisible items. I will explain the basic motivation behind MMS and discuss why large items play an important role in designing fair allocation algorithms. The main message of the talk is that allocating large items early can be a useful and intuitive principle for obtaining strong approximation guarantees.
