@techreport{88ad9262e4d74c239c073755102e5c95,
title = "Choosing k from m: feasible elimination procedures reconsidered",
abstract = "We show that feasible elimination procedures (Peleg, 1978) can be used to select k from m alternatives. An important advantage of this method is the core property: no coalition can guarantee an outcome that is preferred by all its members. We also provide an axiomatic characterization for the case k=1, using the conditions of anonymity, Maskin monotonicity, and independent blocking. Finally, we show for any k that outcomes of feasible elimination procedures can be computed in polynomial time, by showing that the problem is computationally equivalent to finding a maximal matching in a bipartite graph.",
author = "B. Peleg and H.J.M. Peters",
year = "2014",
month = jan,
day = "1",
doi = "10.26481/umagsb.2014033",
language = "English",
series = "GSBE Research Memoranda",
publisher = "Maastricht University, Graduate School of Business and Economics",
number = "033",
address = "Netherlands",
type = "WorkingPaper",
institution = "Maastricht University, Graduate School of Business and Economics",
}