Extending Tournament Solutions

被引:0
|
作者
Brandt, Felix [1 ]
Brill, Markus [2 ]
Harrenstein, Paul [3 ]
机构
[1] Tech Univ Munich, Inst Informat, D-85748 Garching, Germany
[2] Duke Univ, Dept Comp Sci, Durham, NC 27708 USA
[3] Univ Oxford, Dept Comp Sci, Oxford OX1 3QD, England
来源
PROCEEDINGS OF THE TWENTY-EIGHTH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE | 2014年
关键词
CHOICE; COMPLEXITY;
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
An important subclass of social choice functions, so-called majoritarian (or C1) functions, only take into account the pairwise majority relation between alternatives. In the absence of majority ties-e.g., when there is an odd number of agents with linear preferences-the majority relation is anti-symmetric and complete and can thus conveniently be represented by a tournament. Tournaments have a rich mathematical theory and many formal results for majoritarian functions assume that the majority relation constitutes a tournament. Moreover, most majoritarian functions have only been defined for tournaments and allow for a variety of generalizations to unrestricted preference profiles, none of which can be seen as the unequivocal extension of the original function. In this paper, we argue that restricting attention to tournaments is justified by the existence of a conservative extension, which inherits most of the commonly considered properties from its underlying tournament solution.
引用
收藏
页码:580 / 586
页数:7
相关论文
共 50 条
  • [11] A new monotonicity condition for tournament solutions
    İpek Özkal-Sanver
    M. Remzi Sanver
    Theory and Decision, 2010, 69 : 439 - 452
  • [12] Tournament solutions and majority voting.
    Saari, DG
    JOURNAL OF ECONOMIC LITERATURE, 1998, 36 (04) : 2168 - 2169
  • [13] Bounds on the disparity and separation of tournament solutions
    Brandt, Felix
    Dau, Andre
    Seedig, Hans Georg
    DISCRETE APPLIED MATHEMATICS, 2015, 187 : 41 - 49
  • [14] A new monotonicity condition for tournament solutions
    Ozkal-Sanver, Ipek
    Sanver, M. Remzi
    THEORY AND DECISION, 2010, 69 (03) : 439 - 452
  • [15] Tournament Solutions and Their Applications to Multiagent Decision Making
    Brandt, Felix
    MULTIAGENT SYSTEM TECHNOLOGIES, 2010, 6251 : 1 - 1
  • [16] Refining Tournament Solutions via Margin of Victory
    Brill, Markus
    Schmidt-Kraepelin, Ulrike
    Suksompong, Warut
    THIRTY-FOURTH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE, THE THIRTY-SECOND INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE CONFERENCE AND THE TENTH AAAI SYMPOSIUM ON EDUCATIONAL ADVANCES IN ARTIFICIAL INTELLIGENCE, 2020, 34 : 1862 - 1869
  • [17] CALIBRATION DESIGNS BASED ON SOLUTIONS TO TOURNAMENT PROBLEM
    BOSE, RC
    CAMERON, JM
    JOURNAL OF RESEARCH OF THE NATIONAL BUREAU OF STANDARDS SECTION B-MATHEMATICAL SCIENCES, 1967, B 71 (04): : 149 - +
  • [18] A note on contestation-based tournament solutions
    Moser, Scott
    SOCIAL CHOICE AND WELFARE, 2013, 41 (01) : 133 - 143
  • [19] Refinements and Randomised Versions of Some Tournament Solutions
    Kruger, Justin
    Airiau, Stephane
    AAMAS'17: PROCEEDINGS OF THE 16TH INTERNATIONAL CONFERENCE ON AUTONOMOUS AGENTS AND MULTIAGENT SYSTEMS, 2017, : 1584 - 1586
  • [20] Tournament solutions based on cooperative game theory
    Kondratev, Aleksei Y.
    Mazalov, Vladimir V.
    INTERNATIONAL JOURNAL OF GAME THEORY, 2020, 49 (01) : 119 - 145