Stable sets of weak tournaments
2004 ◽
Vol 14
(1)
◽
pp. 33-40
◽
In this paper we obtain conditions on weak tournaments, which guarantee that every non-empty subset of alternatives admits a stable set. We also show that there exists a unique stable set for each non-empty subset of alternatives which coincides with its set of best elements, if and only if, the weak tournament is quasi-transitive. A somewhat weaker version of this result, which is also established in this paper, is that there exists a unique stable set for each non-empty subset of alternatives (: which may or may not coincide with its set of best elements), if and only if the weak tournament is acyclic.
1991 ◽
Vol 51
(3)
◽
pp. 468-472
◽
2011 ◽
Vol 03
(02)
◽
pp. 245-252
◽
Keyword(s):
Keyword(s):
2017 ◽
Vol 39
(5)
◽
pp. 1261-1274
◽
Keyword(s):
2006 ◽
Vol 08
(01)
◽
pp. 95-109
◽
1987 ◽
Vol 35
(3)
◽
pp. 321-347
Keyword(s):
2019 ◽
Vol 17
(2)
◽