Choosing k from m: Feasible elimination procedures reconsidered

Bezalel Peleg and Hans Peters

Games and Economic Behavior, 2017, vol. 103, issue C, 254-261

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 show that the problem of determining whether a specific k-tuple can result from a feasible elimination procedure is computationally equivalent to the problem of finding a maximal matching in a bipartite graph.

Keywords: Feasible elimination procedure; Choosing k from m; Axiomatization; Computation (search for similar items in EconPapers)
JEL-codes: C70 D71 (search for similar items in EconPapers)
Date: 2017
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0899825615001657
Full text for ScienceDirect subscribers only

Related works:
Working Paper: Choosing k from m: feasible elimination procedures reconsidered (2014)
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:eee:gamebe:v:103:y:2017:i:c:p:254-261

DOI: 10.1016/j.geb.2015.12.008

Access Statistics for this article

Games and Economic Behavior is currently edited by E. Kalai

More articles in Games and Economic Behavior from Elsevier
Bibliographic data for series maintained by Catherine Liu ().