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, the speaker will present an overview of his work on this fair resource allocation problem.
In the first part of the talk, he will focus on the fair resource allocation problem in the context of indivisible item resources, i.e., allocating parking spaces and tasks among employees, courses and dormitory rooms amongst college students, or jury and military duties among citizens. He will show the existence result of mixed allocation that achieves both efficiency and fairness.
In the second part of the talk, he will focus on 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). He will discuss multiple aspects of Fisher markets, i.e., equilibrium computation, market dynamics, etc. Lastly, he will conclude the talk with a discussion on future directions and his other works in algorithmic game theory.
About the Speaker
Yixin Tao is a Postdoctoral Researcher at London School of Economics, hosted by László Végh. He earned his Ph.D. in computer science from New York University in 2020, where he was advised by Richard Cole. His main research area is algorithmic game theory. He is particularly interested in Fisher markets, fair division, and dynamics.
He is a tenure-track faculty candidate for Artificial Intelligence & Data Science, Intelligent Systems & Optimization cluster.
