Stable Sets of Weak Tournaments

U of Witwatersrand at Johannesburg, School of Economic and Business Sciences Working Paper

8 Pages Posted: 28 Feb 2003

Multiple version iconThere are 2 versions of this paper

Date Written: March 2003

Abstract

The purpose of this paper is to obtain conditions on weak tournaments, which guarantee that every non-empty subset of alternatives admits a stable set. We show that every stable set always contains the core. We also show that there exists a unique stable set for each non-empty subset of alternatives which coincides with its core if and only if the weak tournament is quasi-transitive. However, a unique stable set exists for each non-empty subset of alternatives (which may or may not coincide with its core) if and only if the weak tournament is acyclic.

Keywords: stable sets, core

Suggested Citation

Lahiri, Somdeb, Stable Sets of Weak Tournaments (March 2003). U of Witwatersrand at Johannesburg, School of Economic and Business Sciences Working Paper, Available at SSRN: https://ssrn.com/abstract=378600 or http://dx.doi.org/10.2139/ssrn.378600

Somdeb Lahiri (Contact Author)

Lok Jagruti (LJ) University ( email )

S.G. Road & Kataria Motors
Sarkhej Circle
Ahmedabad, IN Gujarat 382210
India

HOME PAGE: http://https://sites.google.com/view/somdeblahiri/home

Do you have negative results from your research you’d like to share?

Paper statistics

Downloads
55
Abstract Views
704
Rank
567,594
PlumX Metrics