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] The Traveling Tournament Problem with Maximum Tour Length Two: A Practical Algorithm with An Improved Approximation Bound
    Zhao, Jingyang
    Xiao, Mingyu
    PROCEEDINGS OF THE THIRTIETH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, IJCAI 2021, 2021, : 4206 - 4212
  • [22] Extending Conditional Dependencies with Built-in Predicates
    Ma, Shuai
    Duan, Liang
    Fan, Wenfei
    Hu, Chunming
    Chen, Wenguang
    IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2015, 27 (12) : 3274 - 3288
  • [23] Extending dynamic logic with refinements of abstract actions
    Roos, Nico
    JOURNAL OF LOGIC AND COMPUTATION, 2022, 32 (07) : 1317 - 1351
  • [24] Extending Digital Infrastructures: A Typology of Growth Tactics
    Koutsikouri, Dina
    Lindgren, Rikard
    Henfridsson, Ola
    Rudmark, Daniel
    JOURNAL OF THE ASSOCIATION FOR INFORMATION SYSTEMS, 2018, 19 (10): : 1001 - 1019
  • [25] Extending the Condorcet Jury Theorem to a general dependent jury
    Peleg, Bezalel
    Zamir, Shmuel
    SOCIAL CHOICE AND WELFARE, 2012, 39 (01) : 91 - 125
  • [26] Extending stimulus preference assessment with the operant demand framework
    Gilroy, Shawn P.
    Waits, Jodie A.
    Feck, Cassie
    JOURNAL OF APPLIED BEHAVIOR ANALYSIS, 2021, 54 (03) : 1032 - 1044
  • [27] Extending Statistical Boosting An Overview of Recent Methodological Developments
    Mayr, A.
    Binder, H.
    Gefeller, O.
    Schmid, M.
    METHODS OF INFORMATION IN MEDICINE, 2014, 53 (06) : 428 - 435
  • [28] Extending the Contraposition Property of Propositional Logic for Fuzzy Abduction
    Chakraborty, Aruna
    Konar, Amit
    Pal, Nikhil R.
    Jain, Lakhmi C.
    IEEE TRANSACTIONS ON FUZZY SYSTEMS, 2013, 21 (04) : 719 - 734
  • [29] Extending the Failure-to-Engage theory of task switch costs
    Poboka, Dane
    Karayanidis, Frini
    Heathcote, Andrew
    COGNITIVE PSYCHOLOGY, 2014, 72 : 108 - 141
  • [30] Contact Representations of Planar Graphs: Extending a Partial Representation is Hard
    Chaplick, Steven
    Dorbec, Paul
    Kratochvil, Jan
    Montassier, Mickael
    Stacho, Juraj
    GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE, 2014, 8747 : 139 - 151