Extending tournament solutions

被引:0
|
作者
Felix Brandt
Markus Brill
Paul Harrenstein
机构
[1] Technische Universität München,Institut für Informatik
[2] Technische Universität Berlin,Institut für Softwaretechnik und Theoretische Informatik
[3] University of Oxford,Department of Computer Science
来源
Social Choice and Welfare | 2018年 / 51卷
关键词
D O I
暂无
中图分类号
学科分类号
摘要
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 antisymmetric 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.
引用
下载
收藏
页码:193 / 222
页数:29
相关论文
共 50 条
  • [1] Extending Tournament Solutions
    Brandt, Felix
    Brill, Markus
    Harrenstein, Paul
    PROCEEDINGS OF THE TWENTY-EIGHTH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE, 2014, : 580 - 586
  • [2] Extending tournament solutions
    Brandt, Felix
    Brill, Markus
    Harrenstein, Paul
    SOCIAL CHOICE AND WELFARE, 2018, 51 (02) : 193 - 222
  • [3] Margin of victory for tournament solutions
    Brill, Markus
    Schmidt-Kraepelin, Ulrike
    Suksompong, Warut
    ARTIFICIAL INTELLIGENCE, 2022, 302
  • [4] Tournament solutions and majority voting
    Schofield, N
    JOURNAL OF ECONOMICS-ZEITSCHRIFT FUR NATIONALOKONOMIE, 1998, 68 (03): : 313 - 317
  • [5] Query Complexity of Tournament Solutions
    Dey, Palash
    THIRTY-FIRST AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE, 2017, : 2992 - 2998
  • [6] Query complexity of tournament solutions
    Maiti, Arnab
    Dey, Palash
    THEORETICAL COMPUTER SCIENCE, 2024, 991
  • [7] On the structure of stable tournament solutions
    Brandt, Felix
    Brill, Markus
    Seedig, Hans Georg
    Suksompong, Warut
    ECONOMIC THEORY, 2018, 65 (02) : 483 - 507
  • [8] A survey on the complexity of tournament solutions
    Hudry, Olivier
    MATHEMATICAL SOCIAL SCIENCES, 2009, 57 (03) : 292 - 303
  • [9] On the structure of stable tournament solutions
    Felix Brandt
    Markus Brill
    Hans Georg Seedig
    Warut Suksompong
    Economic Theory, 2018, 65 : 483 - 507
  • [10] Strategic Nominee Selection in Tournament Solutions
    Lisowski, Grzegorz
    MULTI-AGENT SYSTEMS, EUMAS 2022, 2022, 13442 : 239 - 256