A Hierarchical Model for Cooperative Games
From MaRDI portal
Publication:5459987
DOI10.1007/978-3-540-79309-0_21zbMath1136.91315OpenAlexW1593040950MaRDI QIDQ5459987
Publication date: 2 May 2008
Published in: Algorithmic Game Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-79309-0_21
Related Items (3)
The Shapley value for arbitrary families of coalitions ⋮ A system-theoretic model for cooperation, interaction and allocation ⋮ Augmenting and Decreasing Systems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The restricted core of games on distributive lattices: how to share benefits in a hierarchy
- Choice functions over a finite set: A summary
- The theory of convex geometries
- Games with permission structures: The conjunctive approach
- The Shapley value for cooperative games under precedence constraints
- Increasing the rooted connectivity of a digraph by one
- Choice functions and abstract convex geometries
- On the core of ordered submodular cost games
- The core of games on convex geometries
- Cooperative games on antimatroids
- Hierarchical organization structures and constraints on coalition formation
- Submodular linear programs on forests
- Shapley value for multichoice cooperative games. I
- Dual greedy polyhedra, choice functions, and abstract convex geometries
- A new approach to the core and Weber set of multichoice games
- Cores of convex games
- Submodular functions and optimization.
- Cores of games with restricted cooperation
- THE MARGINAL OPERATORS FOR GAMES ON CONVEX GEOMETRIES
- An order-theoretic framework for the greedy algorithm with applications to the core and Weber set of cooperative games
This page was built for publication: A Hierarchical Model for Cooperative Games
