The question of how to fairly divide a collection of indivisible items amongst a set of agents has remained of central importance to humanity since antiquity. In this fundamental problem, the agents have varied preferences, and an allocator seeks to find a single allocation such that every agent perceives its bundle as fair. This problem arises in various applications, ranging from classical examples like the division of inherited estates and international borders to modern considerations such as assigning seats in college courses and allocating computational resources fairly.
Recent decades have witnessed significant progress, transforming this problem into a fascinating mathematical landscape with surprising results and intriguing new challenges. The broad goal of the community is to devise definitions of fairness that mirror our intuitive understanding of what it means to be fair, and then study questions such as: does a fair allocation always exist?; can one be (efficiently) computed?; what are the precise limits to the degree of fairness one can guarantee? Fair division is emerging as a major research area, with an increasing number of publications at CS Theory and AI conferences each year. In this talk, I will focus on selected recent papers of mine, highlighting three techniques (Quantiles, Subsidies, and Randomization) we use to extend the study of fair allocations to general valuation classes and resolve some conjectures and open problems. This talk will also provide an overview of my research trajectory and plans for future work.
Zoom link: https://icts-res-in.zoom.us/j/98287596569?pwd=E47jUlCAae9tbufPcYTwzdMBzTJNLS.1
Meeting ID: 982 8759 6569
Passcode: 202030