Abstract

Fair division refers to the problem of fairly allocating a set of scarce resources to a set of self-interested agents with different preferences. Despite its seemingly simple setting, the problem compasses rich structures and has been a central topic in resource allocation for many decades.

In this talk, I will give an overview of some recent research on this topic. The goal is to give the audience a taste of different fair division challenges and explain how computational thinking could help in addressing them. Among other things, I will take a game-theoretic viewpoint and discuss the challenge of designing truthful fair division algorithms. I will also discuss the challenge of defining fairness and designing fair division algorithms when the resources contain both divisible and indivisible goods.

Biography

Xiaohui Bei is currently a Nanyang Assistant Professor at Nanyang Technological University. He got his Ph.D. from Tsinghua University at Beijing in 2012. Then he spent two years as a research fellow at NTU, and one year as a researcher at Max Planck Institute for Informatics. His research interests include topics in resource allocation, computational economics, and general algorithm design.

• Admission

Zoom ID: 613 9743 8590
https://zoom.com.cn/j/61397438590