The cone of supermodular games on finite distributive lattices
From MaRDI portal
Publication:1741508
DOI10.1016/j.dam.2019.01.024zbMath1409.05137arXiv1803.07557OpenAlexW2915044897WikidataQ128369938 ScholiaQ128369938MaRDI QIDQ1741508
Publication date: 3 May 2019
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1803.07557
Cooperative games (91A12) Games involving graphs (91A43) Games on graphs (graph-theoretic aspects) (05C57)
Related Items
Order cones: a tool for deriving \(k\)-dimensional faces of cones of subfamilies of monotone games ⋮ Incomplete cooperative games with player-centered information
Uses Software
Cites Work
- Core-based criterion for extreme supermodular functions
- Set functions, games and capacities in decision making
- The restricted core of games on distributive lattices: how to share benefits in a hierarchy
- A generalization of the Shapley-ichiishi result
- Triangulations. Structures for algorithms and applications
- Super-modularity: Applications to convex games and to the greedy algorithm for LP
- The Shapley value for cooperative games under precedence constraints
- Extreme convex set functions with finite carrier: General theory
- Characterizing convexity of games using marginal vectors
- Hierarchical organization structures and constraints on coalition formation
- Axiomatizations of the conjunctive permission value for games with permission structures
- Cores of convex games
- Submodular functions and optimization.
- Subjective Probability and Expected Utility without Additivity
- [https://portal.mardi4nfdi.de/wiki/Publication:5731810 On the foundations of combinatorial theory I. Theory of M�bius Functions]
- Introduction to the Theory of Cooperative Games
- The core of games on ordered structures and graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item