Template-type: ReDif-Paper 1.0
Author-Name: Peleg, B.
Author-workplace-name: Externe publicaties SBE
Author-Name: Peters, H.J.M.
Author-workplace-name: Quantitative Economics
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.<br/>
Series: GSBE Research Memoranda
Creation-Date: 20140101
Number: 033
File-URL: https://cris.maastrichtuniversity.nl/ws/files/568877/guid-999ccc63-ecd3-41ad-b4a6-9628b29949e7-ASSET1.0.pdf
File-Format: application/pdf
File-Size: 407960
Handle: Repec:unm:umagsb:2014033
DOI: 10.26481/umagsb.2014033