This website uses third party cookies to improve your experience. If you continue browsing or close this notice, you will accept their use.

Picking sequences for the allocation of indivisible goods

24 May 2016 at 12:00 PM - 1:00 PM

Room 207, Campus on Viale Romania, 32

Speaker: Jerome Lang, Lamsade, Université Paris-Dauphine

Abstract:

Picking  sequences  are  a  natural  way  of  allocating  indivisible  items  to  agents  in  a
decentralized manner: at each stage, a designated agent chooses an item among those
that  remain  available.

The main problem consists in choosing the “best” sequence of agents,  according to some optimality criterion.
We  assume  that  agents  have  additive  preferences over  objects.   The  choice  of  an  optimality  crite-
rion depends on three parameters:  how utilities of objects  are  related  to  their  ranking  in  an  agent’s
preference relation; how the preferences of different agents are correlated; and how social welfare is
defined from the agents’ utilities.  We address the computation  of  a  sequence  maximizing  expected
social welfare under several assumptions.  We also address strategic issues.

Based on the following two papers
Sylvain Bouveret, Jérôme Lang:
Manipulating picking sequences. ECAI 2014: 141-146
Sylvain Bouveret, Jérôme Lang:
A General Elicitation-Free Protocol for Allocating Indivisible Goods. IJCAI 2011: 73-78