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 条
  • [21] A note on contestation-based tournament solutions
    Scott Moser
    Social Choice and Welfare, 2013, 41 : 133 - 143
  • [22] Tournament solutions based on cooperative game theory
    Aleksei Y. Kondratev
    Vladimir V. Mazalov
    International Journal of Game Theory, 2020, 49 : 119 - 145
  • [23] Extending invariant solutions
    Vermeulen, AJ
    Jansen, MJM
    GAMES AND ECONOMIC BEHAVIOR, 1997, 21 (1-2) : 135 - 147
  • [24] Computing tournament solutions using relation algebra and RELVIEW
    Berghammer, Rudolf
    Rusinowska, Agnieszka
    de Swart, Harrie
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2013, 226 (03) : 636 - 645
  • [25] Extending super-solutions
    Hebrard, E
    PRINCIPLES AND PRACTICE OF CONSTRAINT PROGRAMMING - CP 2004, PROCEEDINGS, 2004, 3258 : 798 - 798
  • [26] Extending super-solutions
    Hebrard, Emmanuel
    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2004, 3258
  • [27] ON EXTENDING SOLUTIONS TO DIRICHLET PROBLEMS ACROSS THE BOUNDARY AS SOLUTIONS
    WILLIAMS, M
    DUKE MATHEMATICAL JOURNAL, 1985, 52 (03) : 547 - 563
  • [28] Composition-consistent tournament solutions and social choice functions
    Laffond, G
    Laine, J
    Laslier, JF
    SOCIAL CHOICE AND WELFARE, 1996, 13 (01) : 75 - 93
  • [29] Maximizing breaks and bounding solutions to the mirrored traveling tournament problem
    Urrutia, Sebastian
    Ribeiro, Celso C.
    DISCRETE APPLIED MATHEMATICS, 2006, 154 (13) : 1932 - 1938
  • [30] Dueling Bandits: Beyond Condorcet Winners to General Tournament Solutions
    Ramamohan, Siddartha
    Rajkumar, Arun
    Agarwal, Shivani
    ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 29 (NIPS 2016), 2016, 29