Choosing k from m: Feasible elimination procedures reconsidered

• 成果类型: Article
• 署名作者: Peleg, Bezalel; Peters, Hans
• 署名单位: Hebrew University of Jerusalem; Hebrew University of Jerusalem; Maastricht University
• 刊物名称: GAMES AND ECONOMIC BEHAVIOR
• ISSN/ISSBN: 0899-8256
• DOI: 10.1016/j.geb.2015.12.008
• 发表日期: 2017
• 页码: 254-261
• 关键词: Feasible elimination procedure; Choosing k from m; Axiomatization; computation

摘要

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. (C) 2016 Elsevier Inc. All rights reserved.