Description of field of research:

The project concerns a setting called multi-agent resource allocation in which agents express their utilities or preferences over items and the goal is to allocation the items among the agents in a fair manner. There are several ways how fairness can be defined and for each of the fairness concepts, researchers have been looking at the following questions: does a fair allocation always exist? Can a fair allocation be computed efficiently? 

The goal of the project will be to undertake a detailed theoretical study of fair division algorithms for real-life allocation problems that give rise to particular feasibility constraints. 

The project will have a major theoretical focus and it requires advanced skills in writing mathematical proofs and undertaking formal analysis. Prior experience in algorithm design courses, discrete mathematics, and game theory will be highly valuable.

School

Computer Science and Engineering

Research areas

Algorithms, Mult-agent systems, fair division

The project will involve working with members of the Algormithmic Decision Theory group at UNSW.

The expected outcome of the project will be a technical report which reports on the the relative merits of algorithms considered during the project as well as an understanding of some of they key issues involved in the field of fair division. 

Fair Division of Indivisible Goods: A Survey. Georgios Amanatidis, Haris Aziz, Georgios Birmpas, Aris Filos-Ratsikas, Bo Li, Herva© Moulin, Alexandros A. Voudouris, Xiaowei Wu. https://arxiv.org/abs/2208.08782

Brams, Steven J., and Alan D. Taylor (1996). Fair Division: From Cake-Cutting to Dispute Resolution. New York: Cambridge University Press.