Choosing k from m: Feasible elimination procedures reconsidered

Bezalel Peleg; Hans Peters

doi:10.1016/j.geb.2015.12.008

Choosing k from m: Feasible elimination procedures reconsidered

Bezalel Peleg
, Hans Peters^*

^*Corresponding author for this work

QE Math. Economics & Game Theory

Research output: Contribution to journal › Article › Academic › peer-review

235 Downloads (Pure)

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.

Original language	English
Pages (from-to)	254-261
Number of pages	8
Journal	Games and Economic Behavior
Volume	103
DOIs	https://doi.org/10.1016/j.geb.2015.12.008
Publication status	Published - May 2017

JEL classifications

c70 - Game Theory and Bargaining Theory: General
d71 - "Social Choice; Clubs; Committees; Associations"

Keywords

Feasible elimination procedure
Choosing k from m
Axiomatization
Computation

Access to Document

10.1016/j.geb.2015.12.008

Full TextFinal published version, 312 KBLicence: Taverne

Cite this

@article{b2a9f4ec59624d6cbae2d920dbad7d61,

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 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",

author = "Bezalel Peleg and Hans Peters",

note = "No data used",

year = "2017",

month = may,

doi = "10.1016/j.geb.2015.12.008",

language = "English",

volume = "103",

pages = "254--261",

journal = "Games and Economic Behavior",

issn = "0899-8256",

publisher = "Academic Press Inc.",

}

TY - JOUR

T1 - Choosing k from m: Feasible elimination procedures reconsidered

AU - Peleg, Bezalel

AU - Peters, Hans

N1 - No data used

PY - 2017/5

Y1 - 2017/5

N2 - 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.

AB - 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.

KW - Feasible elimination procedure

KW - Choosing k from m

KW - Axiomatization

KW - Computation

U2 - 10.1016/j.geb.2015.12.008

DO - 10.1016/j.geb.2015.12.008

M3 - Article

SN - 0899-8256

VL - 103

SP - 254

EP - 261

JO - Games and Economic Behavior

JF - Games and Economic Behavior

ER -

Choosing k from m: Feasible elimination procedures reconsidered

Abstract

JEL classifications

Keywords

Access to Document

Fingerprint

Cite this