Choosing k from m: feasible elimination procedures reconsidered

Bezalel Peleg and Hans Peters

No 33, Research Memorandum from Maastricht University, Graduate School of Business and Economics (GSBE)

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.

Date: 2014-01-01
New Economics Papers: this item is included in nep-gth
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
https://cris.maastrichtuniversity.nl/ws/files/5688 ... 29949e7-ASSET1.0.pdf (application/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:unm:umagsb:2014033

DOI: 10.26481/umagsb.2014033

Access Statistics for this paper

More papers in Research Memorandum from Maastricht University, Graduate School of Business and Economics (GSBE) Contact information at EDIRC.
Bibliographic data for series maintained by Andrea Willems (a.willems@maastrichtuniversity.nl) and Leonne Portz (l.portz@maastrichtuniversity.nl).