Democratic fair allocation
Several items have to be allocated among several families. In each family, there are members with different preferences over the items. The goal is to divide the items such that, in each family, as many members as possible will perceive the division as "fair".
I will show that this problem combines two seemingly-unrelated problems: fair allocation of items among individuals, and finding winning-strategies in combinatorial games. I will present division algorithms, upper bounds and some open questions.
Joint work with Warut Suksompong (Oxford University).
Full paper: https://arxiv.org/abs/1709.02564