Stable sets and max-convex decompositions of TU games
From MaRDI portal
(Redirected from Publication:356514)
Recommendations
- Convex games and stable sets
- Maximal stable sets of two-player games
- Stable sets and cores for multi-criteria simple games and for their extensions
- scientific article; zbMATH DE number 1031405
- On the computation of stable sets for bimatrix games
- scientific article; zbMATH DE number 4035611
- STABLE SETS FOR SIMPLE GAMES WITH ORDINAL PREFERENCES
- scientific article; zbMATH DE number 3849014
- A characterisation of stable sets in games with transitive preference
- On the convexity of independent set games
Cites work
- scientific article; zbMATH DE number 3139280 (Why is no real title available?)
- scientific article; zbMATH DE number 1099364 (Why is no real title available?)
- scientific article; zbMATH DE number 3106184 (Why is no real title available?)
- A game with no solution
- An intersection theorem in TU cooperative game theory
- Cores of convex games
- Introduction to the Theory of Cooperative Games
- On the cores of cooperative games and the stability of the Weber set
- Super-modularity: Applications to convex games and to the greedy algorithm for LP
- The Shapley value on some lattices of monotonic games
- The vector lattice structure of the n-person TU games
Cited in
(3)
This page was built for publication: Stable sets and max-convex decompositions of TU games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q356514)
