Stable Sets of Weak Tournaments
Yugoslav journal of operations research, Tome 14 (2004) no. 1, p. 33
Cet article a éte moissonné depuis la source eLibrary of Mathematical Institute of the Serbian Academy of Sciences and Arts
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.
@article{YJOR_2004_14_1_a3,
author = {Somdeb Lahiri},
title = {Stable {Sets} of {Weak} {Tournaments}},
journal = {Yugoslav journal of operations research},
pages = {33 },
year = {2004},
volume = {14},
number = {1},
zbl = {1058.91023},
language = {en},
url = {http://geodesic.mathdoc.fr/item/YJOR_2004_14_1_a3/}
}
Somdeb Lahiri. Stable Sets of Weak Tournaments. Yugoslav journal of operations research, Tome 14 (2004) no. 1, p. 33 . http://geodesic.mathdoc.fr/item/YJOR_2004_14_1_a3/