Choosing k from m: feasible elimination procedures reconsidered

Bezalel Peleg and Hans Peters

Discussion Paper Series from The Federmann Center for the Study of Rationality, the Hebrew University, Jerusalem

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.

Keywords: Feasible elimination procedure; choosing k from m; axiomatization; computation (search for similar items in EconPapers)
Pages: 38 pages
Date: 2014-12
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://ratio.huji.ac.il/sites/default/files/publications/dp671.pdf (application/pdf)
Our link check indicates that this URL is bad, the error code is: 404 Not Found (http://ratio.huji.ac.il/sites/default/files/publications/dp671.pdf [302 Moved Temporarily]--> https://ratio.huji.ac.il/sites/default/files/publications/dp671.pdf)

Related works:
Journal Article: Choosing k from m: Feasible elimination procedures reconsidered (2017)
Working Paper: Choosing k from m: feasible elimination procedures reconsidered (2014)
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:huj:dispap:dp671

Access Statistics for this paper

More papers in Discussion Paper Series from The Federmann Center for the Study of Rationality, the Hebrew University, Jerusalem Contact information at EDIRC.
Bibliographic data for series maintained by Michael Simkin ().