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 条
12345