Stable sets of weak tournaments
Abstract
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.
Published
Oct 11, 2016
How to Cite
LAHIRI, S..
Stable sets of weak tournaments.
Yugoslav Journal of Operations Research, [S.l.], v. 14, n. 1, oct. 2016.
ISSN 2334-6043.
Available at: <http://yujor.fon.bg.ac.rs/index.php/yujor/article/view/220>. Date accessed: 04 may 2024.
Section
Articles
This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.