On the vertices of the \(k\)-additive core
From MaRDI portal
Publication:2519834
DOI10.1016/j.disc.2007.09.042zbMath1156.91009OpenAlexW1991679101MaRDI QIDQ2519834
Pedro Miranda, Michel Grabisch
Publication date: 27 January 2009
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2007.09.042
Related Items
Multicoalitional solutions, Remarkable polyhedra related to set functions, games and capacities, An algorithm for finding the vertices of the \(k\)-additive monotone core, Finding the Set of k-additive Dominating Measures Viewed as a Flow Problem, On the set of imputations induced by the \(k\)-additive core, Preserving coalitional rationality for non-balanced games, \(k\)-balanced games and capacities, \(k\)-core covers and the core, Autonomous coalitions
Cites Work
- Some characterizations of lower probabilities and other monotone capacities through the use of Möbius inversion
- Super-modularity: Applications to convex games and to the greedy algorithm for LP
- The nucleon of cooperative games and an algorithm for matching games
- \(k\)-order additive discrete fuzzy measures and their representation
- The selectope for games with partial cooperation
- On the core of ordered submodular cost games
- Cooperative games on antimatroids
- Cores of convex games
- Submodular functions and optimization.
- OPTIMIZATION ISSUES FOR FUZZY MEASURES
- A Simplified Bargaining Model for the n-Person Cooperative Game
- [https://portal.mardi4nfdi.de/wiki/Publication:5731810 On the foundations of combinatorial theory I. Theory of M�bius Functions]
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item