The Shapley value on convex geometries

DOI10.1016/S0166-218X(99)00218-8zbMath0955.91002OpenAlexW2136112566MaRDI QIDQ1570819

Jésus Mario Bilbao, Paul H. Edelman

Publication date: 16 November 2000

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0166-218x(99)00218-8

zbMATH Keywords

convex geometriesShapley value for games

Mathematics Subject Classification ID

Cooperative games (91A12)

Related Items (32)

Entropy of capacities on lattices and set systems ⋮ Values for cooperative games over graphs and games with inadmissible coalitions ⋮ Cooperative games on convex geometries with a coalition structure ⋮ Indices of Criticality in Simple Games ⋮ Power measures and solutions for games under precedence constraints ⋮ Efficient extensions of the Myerson value based on endogenous claims from players ⋮ Games on concept lattices: Shapley value and core ⋮ Harsanyi power solution for games with restricted cooperation ⋮ The presence of lattice theory in discrete problems of mathematical social sciences. Why. ⋮ A system-theoretic model for cooperation, interaction and allocation ⋮ Customer satisfaction analysis: identification of key drivers. ⋮ Games with nested constraints given by a level structure ⋮ Solution concepts for games with general coalitional structure ⋮ A coalitional value for games on convex geometries with a coalition structure ⋮ Geodetic and Steiner geodetic sets in 3-Steiner distance hereditary graphs ⋮ A value for communication situations with players having different bargaining abilities ⋮ Proportional coalition values for monotonic games on convex geometries with a coalition structure ⋮ The \(\tau\)-value for games on matroids. ⋮ Cooperative games with partial information ⋮ Restricted cooperative games on metabolic networks reveal functionally important reactions ⋮ Cooperative games with restricted formation of coalitions ⋮ Algorithms for computing the Shapley value of cooperative games on lattices ⋮ Augmenting and Decreasing Systems ⋮ Cooperative games on intersection closed systems and the Shapley value ⋮ A note on voting ⋮ Values on regular games under Kirchhoff's laws ⋮ Axiomatizations of the Shapley value for games on augmenting systems ⋮ On 3-Steiner simplicial orderings ⋮ Rebuilding convex sets in graphs ⋮ The Banzhaf power index on convex geometries ⋮ Information decomposition based on cooperative game theory ⋮ Simple games on closure spaces

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The theory of convex geometries
• Optimal location of candidates in ideological space
• The Shapley value for cooperative games under precedence constraints
• A note on voting
• On the core of ordered submodular cost games
• Graphs and Cooperation in Games

This page was built for publication: The Shapley value on convex geometries