Axiomatizations of two types of Shapley values for games on union closed systems
From MaRDI portal
Publication:535178
Recommendations
- An Axiomatization of Shapley Values of Games on Set Systems
- Axiomatizations of the Shapley value for games on augmenting systems
- Axiomatic of the Shapley value of a game with a priori unions
- On axiomatizations of the Shapley value for assignment games
- Axiomatizations of the Shapley value for cooperative games on antimatroids
- Cooperative games on intersection closed systems and the Shapley value
- Values for two-stage games: Another view of the Shapley axioms
- A new axiomatization of the Shapley-solidarity value for games with a coalition structure
- A new axiomatization of the Shapley value
- On a result of Aumann and Shapley about values of non-atomic games
Cites work
- scientific article; zbMATH DE number 1599890 (Why is no real title available?)
- scientific article; zbMATH DE number 3138565 (Why is no real title available?)
- scientific article; zbMATH DE number 3078997 (Why is no real title available?)
- A characterization of optimistic weighted Shapley rules in minimum cost spanning tree problems
- A characterization of the Shapley value in queueing problems
- An axiomatization of the disjunctive permission value for games with a permission structure
- Axiomatizations of the Shapley value for cooperative games on antimatroids
- Axiomatizations of the conjunctive permission value for games with permission structures
- Component efficient solutions in line-graph games with applications
- Conference structures and fair allocation rules
- Cooperative games on antimatroids
- Games with permission structures: The conjunctive approach
- Graphs and Cooperation in Games
- Lattices with unique irreducible decompositions
- No-envy in queueing problems
- The Shapley value of a patent licensing game: the asymptotic equivalence to non-cooperative results
- The asymptotic Shapley value for a simple market game
Cited in
(16)- Games with a permission structure -- a survey on generalizations and applications
- Comparable characterizations of four solutions for permission tree games
- Harsanyi power solution for games with restricted cooperation
- Incomplete cooperative games with player-centered information
- Harsanyi power solutions for graph-restricted games
- Cooperative games on intersection closed systems and the Shapley value
- Values for Markovian coalition processes
- The Shapley value of conjunctive-restricted games
- On axiomatizations of the Shapley value for assignment games
- Axiomatizations of the Shapley value for cooperative games on antimatroids
- Harsanyi power solutions for games on union stable systems
- Characterization of the average tree solution and its kernel
- Networks, communication and hierarchy: applications to cooperative games
- Cohesive efficiency in TU-games: axiomatizations of variants of the Shapley value, egalitarian values and their convex combinations
- The average tree permission value for games with a permission tree
- Average tree solutions and the distribution of Harsanyi dividends
This page was built for publication: Axiomatizations of two types of Shapley values for games on union closed systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q535178)