The solution of generalized stable sets and its refinement
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1600673 (Why is no real title available?)
- scientific article; zbMATH DE number 3139280 (Why is no real title available?)
- scientific article; zbMATH DE number 3972536 (Why is no real title available?)
- scientific article; zbMATH DE number 1099364 (Why is no real title available?)
- scientific article; zbMATH DE number 3226832 (Why is no real title available?)
- scientific article; zbMATH DE number 3106184 (Why is no real title available?)
- A dynamic solution concept for abstract games
- A note on extended stable sets
- A note on generalized stable sets
- A refinement of the uncovered set in tournaments
- A reformulation of von Neumann-Morgenstern stability: \(m\)-stability
- A solution for general exchange markets with indivisible goods when indifferences are allowed
- An admissible set occurring in various bargaining situations
- Characterization of dominance relations in finite coalitional games
- Choosing from a tournament
- Condorcet Social Choice Functions
- Handbook of Computational Social Choice
- Maximal elements of not necessarily acyclic binary relations
- More on the stable, generalized stable, absorbing and admissible sets
- Multiple criteria decision analysis. State of the art surveys
- On the solution of \(w\)-stable sets
- Solutions of irreflexive relations
- Tournament solutions and majority voting
- Uncovered sets
Cited in
(5)- A solution for abstract decision problems based on maximum flow value
- Applications of the Inverse Theta Number in Stable Set Problems
- More on the stable, generalized stable, absorbing and admissible sets
- Dominating, weakly stable, and uncovered sets: properties and generalizations
- On the solution of \(w\)-stable sets
This page was built for publication: The solution of generalized stable sets and its refinement
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2243513)