Title
A general elicitation-free protocol for allocating indivisible goods
Abstract
We consider the following sequential allocation process. A benevolent central authority has to allocate a set of indivisible goods to a set of agents whose preferences it is totally ignorant of. We consider the process of allocating objects one after the other by designating an agent and asking her to pick one of the objects among those that remain. The 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 criterion 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 strategical issues.
Year
DOI
Venue
2011
10.5591/978-1-57735-516-8/IJCAI11-024
IJCAI
Keywords
Field
DocType
general elicitation-free protocol,optimality criterion,strategical issue,preference relation,indivisible goods,different agent,additive preference,social welfare,following sequential allocation process,benevolent central authority
Mathematical economics,Preference elicitation,Preference relation,Optimality criterion,Ranking,Central authority,Computer science,Resource allocation,Artificial intelligence,Machine learning,Computation,Social Welfare
Conference
Citations 
PageRank 
References 
5
0.72
1
Authors
2
Name
Order
Citations
PageRank
Sylvain Bouveret125117.61
Jérôme Lang22838260.90