Abstract

Allocating resources among agents in an efficient and fair manner is a classical problem which has been intensively studied in the areas of economics, social choice, and computer science. In this talk, I will present an overview of my work on this fair resource allocation problem. I will focus on the fair resource allocation problem in the context of indivisible items, i.e., allocating parking spaces and tasks among employees, courses and dormitory rooms amongst college students, or jury and military duties among citizens. I will show the existence result of a mixed allocation that achieves both efficiency and fairness. I will also mention Fisher markets, a special case of general equilibrium theory that can also provide efficient and fair allocations when the resources are divisible goods, i.e., splitting desserts between siblings, deciding international fishing rights. I will conclude the talk with a discussion on future directions and my other work in algorithmic game theory.

Time

2023-02-20  14:00 - 15:00   

Speaker

Yixin Tao,  London School of Economics

Room

Room 602, SIME@SUFE