论文信息 - Stable Sets of Weak Tournaments

Stable Sets of Weak Tournaments

In this paper we obtain sufficient conditions for the existence of a stable set of a weak tournament. We also provide necessary and sufficient conditions for unique stable sets as well as necessary and sufficient conditions for the stable sets to coincide with cores.

Somdeb Lahiri | S. Lahiri

[1] Begoña Subiza Martínez,et al. Condorcet choice correspondences for weak tournaments , 1997 .

[2] Nicholas R. Miller. A New Solution Set for Tournaments and Majority Voting: Further Graph- Theoretical Approaches to the Theory of Voting , 1980 .

[3] Nicholas R. Miller,et al. Graph- Theoretical Approaches to the Theory of Voting* , 1977 .

[4] Hervé Moulin,et al. Choice functions over a finite set: A summary , 1985 .

[5] Ki Hang Kim,et al. Introduction to mathematical consensus theory , 1980 .

[6] H. Moulin. Choosing from a tournament , 1986 .

[7] A. Roth,et al. Two-sided matching , 1990 .

[8] William F. Lucas,et al. Von Neumann-Morgenstern stable sets , 1992 .