Minimal Extending Sets in Tournaments

被引：0
|
作者：
Brandt, Felix [1 ]
Harrenstein, Paul [2 ]
Seedig, Hans Georg [1 ]
机构：
[1] Tech Univ Munich, Inst Informat, Munich, Germany
[2] Univ Oxford, Dept Comp Sci, Oxford, England
来源：
AAMAS'14: PROCEEDINGS OF THE 2014 INTERNATIONAL CONFERENCE ON AUTONOMOUS AGENTS & MULTIAGENT SYSTEMS | 2014年
关键词：
Tournament solutions; Banks set; Minimal extending set;
D O I：
暂无
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
In 2011, Brandt proposed a new tournament solution called the minimal extending set (ME). It was conjectured that ME satisfies a large number of desirable properties. In this paper, we non-constructively show that ME fails to satisfy most of these properties. However, no concrete examples of these violations are known and it appears that ME satisfies these properties for all practical purposes. This casts doubt on the axiomatic method.
引用
收藏
页码：1539 / 1540
页数：2
相关论文
共 50 条
  • [1] Minimal extending sets in tournaments
    Brandt, Felix
    Harrenstein, Paul
    Seedig, Hans Georg
    MATHEMATICAL SOCIAL SCIENCES, 2017, 87 : 55 - 63
  • [2] Minimal stable sets in tournaments
    Brandt, Felix
    JOURNAL OF ECONOMIC THEORY, 2011, 146 (04) : 1481 - 1499
  • [3] Minimal retentive sets in tournaments
    Felix Brandt
    Markus Brill
    Felix Fischer
    Paul Harrenstein
    Social Choice and Welfare, 2014, 42 : 551 - 574
  • [4] Minimal retentive sets in tournaments
    Brandt, Felix
    Brill, Markus
    Fischer, Felix
    Harrenstein, Paul
    SOCIAL CHOICE AND WELFARE, 2014, 42 (03) : 551 - 574
  • [5] SORTING, MINIMAL FEEDBACK SETS, AND HAMILTON PATHS IN TOURNAMENTS
    BARNOY, A
    NAOR, J
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 1990, 3 (01) : 7 - 20
  • [6] Improved bounds for minimal feedback vertex sets in tournaments
    Mnich, M.
    Teutrine, E.
    JOURNAL OF GRAPH THEORY, 2018, 88 (03) : 482 - 506
  • [7] Extending partial tournaments
    Beasley, LeRoy B.
    Brown, David E.
    Reid, K. Brooks
    MATHEMATICAL AND COMPUTER MODELLING, 2009, 50 (1-2) : 287 - 291
  • [8] ON SCORE SETS FOR TOURNAMENTS
    HAGER, M
    DISCRETE MATHEMATICS, 1986, 58 (01) : 25 - 34
  • [9] Computing minimal extending sets by relation-algebraic modeling and development
    Berghammer, Rudolf
    JOURNAL OF LOGICAL AND ALGEBRAIC METHODS IN PROGRAMMING, 2014, 83 (02) : 103 - 119
  • [10] Random graphs, sets and tournaments
    Spencer, J
    PAUL ERDOS AND HIS MATHEMATICS II, 2002, 11 : 637 - 648
12345