Results 1  10
of
1,453,507
SinkStable Sets of Digraphs
, 2011
"... We introduce the notion of sinkstable sets of a digraph and prove a minmax formula for the maximum cardinality of the union of k sinkstable sets. The results imply a recent minmax theorem of Abeledo and Atkinson [1] on the Clar number of bipartite plane graphs and a sharpening of Minty’s colori ..."
Abstract
 Add to MetaCart
We introduce the notion of sinkstable sets of a digraph and prove a minmax formula for the maximum cardinality of the union of k sinkstable sets. The results imply a recent minmax theorem of Abeledo and Atkinson [1] on the Clar number of bipartite plane graphs and a sharpening of Minty’s
Stable Set and Voting Rules
, 2003
"... We consider a voting situation where a society has to decide on the rule to use when choosing among two alternatives in the uncertain future. Our analysis is related to the set up of Barbera and Jackson (2001). While they consider …nite societies in our set up the economy has an in…nite amount of ag ..."
Abstract
 Add to MetaCart
of agents. We de…ne a binary dominance relation over the set of decision rules and determine the von Neumann and Morgenstern stable set of voting rules. It turns out that the stable set always exists and is unique in the in…nite economy’s case. The stable set is however not a singleton. Additionally
Stable sets of weak tournaments
 Yugoslav Journal of Operations Research
, 2004
"... Abstract: In this paper we obtain conditions on weak tournaments, which guarantee that every nonempty subset of alternatives admits a stable set. We also show that there exists a unique stable set for each nonempty subset of alternatives which coincides with its set of best elements, if and only i ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Abstract: In this paper we obtain conditions on weak tournaments, which guarantee that every nonempty subset of alternatives admits a stable set. We also show that there exists a unique stable set for each nonempty subset of alternatives which coincides with its set of best elements, if and only
Minimal Stable Sets in Tournaments
, 2009
"... We propose a systematic methodology for defining tournament solutions as extensions of maximality. The central concepts of this methodology are maximal qualified subsets and minimal stable sets. We thus obtain an infinite hierarchy of tournament solutions, which encompasses the top cycle, the uncove ..."
Abstract

Cited by 17 (12 self)
 Add to MetaCart
We propose a systematic methodology for defining tournament solutions as extensions of maximality. The central concepts of this methodology are maximal qualified subsets and minimal stable sets. We thus obtain an infinite hierarchy of tournament solutions, which encompasses the top cycle
COMPOSITION OF STABLE SET POLYHEDRA
, 2006
"... Barahona and Mahjoub defined the minimal system of the stable set polytope for a graph G when G has a cutset of cardinality 2. We extend this result, derive a class of facets, and provide a short proof for a theorem of Chvátal. 1 ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Barahona and Mahjoub defined the minimal system of the stable set polytope for a graph G when G has a cutset of cardinality 2. We extend this result, derive a class of facets, and provide a short proof for a theorem of Chvátal. 1
STABLE SET OF SELFMAP
, 2009
"... The attracting set and the inverse limit set are important objects associated to a selfmap on a set. We call stable set of the selfmap the projection of the inverse limit set. It is included in the attracting set, but is not equal in the general case. Here we determine whether or not the equality ..."
Abstract
 Add to MetaCart
The attracting set and the inverse limit set are important objects associated to a selfmap on a set. We call stable set of the selfmap the projection of the inverse limit set. It is included in the attracting set, but is not equal in the general case. Here we determine whether
STABLE SETS, HYPERBOLICITY AND DIMENSION
, 2003
"... Abstract. In this note we derive an upper bound for the Hausdorff dimension of the stable set of a hyperbolic set Λ of a C 2 diffeomorphisms on a ndimensional manifold. As a consequence we obtain that dimH W s (Λ) = n is equivalent to the existence of a SRBmeasure. We also discuss related results ..."
Abstract
 Add to MetaCart
Abstract. In this note we derive an upper bound for the Hausdorff dimension of the stable set of a hyperbolic set Λ of a C 2 diffeomorphisms on a ndimensional manifold. As a consequence we obtain that dimH W s (Λ) = n is equivalent to the existence of a SRBmeasure. We also discuss related
On cores and stable sets for fuzzy games
, 2002
"... In this paper cores and stable sets for games with fuzzy coalitions are introduced and their relations studied. For convex fuzzy games it turns out that all cores coincide and that the core is the unique stable set. Also relations between cores and stable sets for fuzzy clan games are discussed. ..."
Abstract

Cited by 6 (2 self)
 Add to MetaCart
In this paper cores and stable sets for games with fuzzy coalitions are introduced and their relations studied. For convex fuzzy games it turns out that all cores coincide and that the core is the unique stable set. Also relations between cores and stable sets for fuzzy clan games are discussed.
Dynamics of Stable Sets of Constitutions
, 2007
"... A SelfDesignating social choice correspondence designates itself when it is implemented as a constitution and when the society has to choose a constitution from the set it is a member of. A set of constitutions is Stable if it has at least one selfdesignating correspondence for any preference pro ..."
Abstract
 Add to MetaCart
A SelfDesignating social choice correspondence designates itself when it is implemented as a constitution and when the society has to choose a constitution from the set it is a member of. A set of constitutions is Stable if it has at least one selfdesignating correspondence for any preference
ON THE COMPUTATION OF STABLE SETS FOR BIMATRIX GAMES
"... In this paper it is shown how to compute stable sets, defined by Mertens (1989), in the context of bimatrix games only using linear optimization techniques. 1. ..."
Abstract
 Add to MetaCart
In this paper it is shown how to compute stable sets, defined by Mertens (1989), in the context of bimatrix games only using linear optimization techniques. 1.
Results 1  10
of
1,453,507