Democratic fair allocation

Seminar
Speaker
Erel Segal-Halevi (Ariel University)
Date
13/01/2019 - 15:30 - 14:00Add to Calendar 2019-01-13 14:00:00 2019-01-13 15:30:00 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 Room 201, Math and CS Building (Bldg. 216) אוניברסיטת בר-אילן - המחלקה למתמטיקה mathoffice@math.biu.ac.il Asia/Jerusalem public
Place
Room 201, Math and CS Building (Bldg. 216)
Abstract

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 paperhttps://arxiv.org/abs/1709.02564

תאריך עדכון אחרון : 07/01/2019