TY - GEN
T1 - Minimal extending sets in tournaments
AU - Brandt, Felix
AU - Harrenstein, Paul
AU - Seedig, Hans Georg
N1 - Publisher Copyright:
Copyright © 2014, International Foundation for Autonomous Agents and Multiagent Systems (www.ifaamas.org). All rights reserved.
PY - 2014
Y1 - 2014
N2 - 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.
AB - 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.
KW - Banks set
KW - Minimal extending set
KW - Tournament solutions
UR - http://www.scopus.com/inward/record.url?scp=84911417502&partnerID=8YFLogxK
M3 - Conference contribution
AN - SCOPUS:84911417502
T3 - 13th International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2014
SP - 1539
EP - 1540
BT - 13th International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2014
PB - International Foundation for Autonomous Agents and Multiagent Systems (IFAAMAS)
T2 - 13th International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2014
Y2 - 5 May 2014 through 9 May 2014
ER -