A Dynamic Theory for the Class of Games with Nonempty Cores
From MaRDI portal
Publication:4126098
Cited in
(11)- The core can be accessed with a bounded number of blocks
- Enlarged cores and bargaining schemes in games with fuzzy coalitions
- The equivalence of the minimal dominant set and the myopic stable set for coalition function form games
- Anytime coalition structure generation: an average case study
- The coalition structure core is accessible
- U-CYCLES IN n-PERSON TU-GAMES WITH ONLY 1, n - 1 AND n-PERSON PERMISSIBLE COALITIONS
- Complexity of constructing solutions in the core based on synergies among coalitions
- The minimal dominant set is a non-empty core-extension
- On the \(k\)-accessibility of cores of \textit{TU}-cooperative games
- Accessibility and stability of the coalition structure core
- Characterization of TU games with stable cores by nested balancedness
This page was built for publication: A Dynamic Theory for the Class of Games with Nonempty Cores
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4126098)