In:
Mathematics of Operations Research, Institute for Operations Research and the Management Sciences (INFORMS), Vol. 46, No. 2 ( 2021-05), p. 811-833
Abstract:
Finitely many agents have preferences on a finite set of alternatives, single-peaked with respect to a connected graph with these alternatives as vertices. A probabilistic rule assigns to each preference profile a probability distribution over the alternatives. First, all unanimous and strategy-proof probabilistic rules are characterized when the graph is a tree. These rules are uniquely determined by their outcomes at those preference profiles at which all peaks are on leaves of the tree and, thus, extend the known case of a line graph. Second, it is shown that every unanimous and strategy-proof probabilistic rule is random dictatorial if and only if the graph has no leaves. Finally, the two results are combined to obtain a general characterization for every connected graph by using its block tree representation.
Type of Medium:
Online Resource
ISSN:
0364-765X
,
1526-5471
DOI:
10.1287/moor.2020.1089
Language:
English
Publisher:
Institute for Operations Research and the Management Sciences (INFORMS)
Publication Date:
2021
detail.hit.zdb_id:
2004273-5
detail.hit.zdb_id:
195683-8
SSG:
3,2
Bookmarklink