Munich Personal RePEc Archive

Dominant, weakly stable, uncovered sets: properties and extensions

Subochev, Andrey (2008): Dominant, weakly stable, uncovered sets: properties and extensions. Published in: NRU HSE PH Working papers series No. WP7/2008/03 (2008): pp. 1-32.

[thumbnail of MPRA_paper_53421.pdf]

Download (788kB) | Preview


Twelve sets, proposed as social choice solution concepts, are compared: the core, five versions of the uncovered set, two versions of the minimal weakly stable sets, the uncaptured set, the untrapped set, the minimal undominated set (strong top cycle) and the minimal dominant set (weak top cycle). The main results presented are the following.

A criterion to determine whether an alternative belongs to a minimal weakly stable set is found. It establishes the logical connection between minimal weakly stable sets and covering relation.

In tournaments and in general case it is determined for all twelve sets, whether each two of them are related by inclusion or not.

In tournaments the concept of stability is employed to generalize the notions of weakly stable and uncovered sets. New concepts of k-stable alternatives and k-stable sets are introduced and their properties and mutual relations are explored.

A concept of the minimal dominant set is generalized. It helps to establish that in general case all dominant sets are ordered by strict inclusion. In tournaments the hierarchies of the classes of k-stable alternatives and k-stable sets combined with the system of dominant sets constitute tournament’s structure (“microstructure” and “macrostructure” respectively). This internal structure may be treated as a system of reference, which is based on difference in degrees of stability.

Atom RSS 1.0 RSS 2.0

Contact us: mpra@ub.uni-muenchen.de

This repository has been built using EPrints software.

MPRA is a RePEc service hosted by Logo of the University Library LMU Munich.