Impartial selection and the power of up to two choices

Bjelde, A., Fischer, F. and Klimm, M. (2017) Impartial selection and the power of up to two choices. ACM Transactions on Economics and Computation, 5(4), 21. (doi: 10.1145/3107922)

Full text not currently available from Enlighten.

Abstract

We study mechanisms that select members of a set of agents based on nominations by other members and that are impartial in the sense that agents cannot influence their own chance of selection. Prior work has shown that deterministic mechanisms for selecting any fixed number k of agents are severely limited and cannot extract a constant fraction of the nominations of the k most highly nominated agents. We prove here that this impossibility result can be circumvented by allowing the mechanism to sometimes but not always select fewer than k agents. This added flexibility also improves the performance of randomized mechanisms, for which we show a separation between mechanisms that make exactly two or up to two choices and give upper and lower bounds for mechanisms allowed more than two choices.

Item Type:Articles
Status:Published
Refereed:Yes
Glasgow Author(s) Enlighten ID:Fischer, Dr Felix
Authors: Bjelde, A., Fischer, F., and Klimm, M.
College/School:College of Science and Engineering > School of Computing Science
Journal Name:ACM Transactions on Economics and Computation
Publisher:Association for Computing Machinery (ACM)
ISSN:2167-8375
ISSN (Online):2167-8383
Published Online:22 December 2017

University Staff: Request a correction | Enlighten Editors: Update this record