Allocation rules for hypergraph communication situations

DOI10.1007/BF01253780MaRDI QIDQ1185760zbMATH OpenOpenAlexFDO

Authors Stef Tijs, Anne van den Nouweland, Peter Borm

Publication date 28 June 1992

Published in International Journal of Game Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf01253780

zbMATH Keywords

communicationhypergraphMyerson valueaxiomatic characterizationscoalitional gameposition valuehypergraph communication

Mathematics Subject Classification ID

Cooperative games (91A12) Hypergraphs (05C65)

Recommendations

• The position value and the Myerson value for hypergraph communication situations
• Axiomatization and Core Stability of Allocation Rules for Hypergraph Situations
• A note on the position value for hypergraph communication situations
• Characterizations of the position value for hypergraph communication situations
• The efficient proportional Myerson values for hypergraph games

Cites work

• Conference structures and fair allocation rules
• Graphs and Cooperation in Games
• Values of Graph-Restricted Games

Cited in

(44)

• The nucleolus and inheritance of properties in communication situations
• Patent package structures and sharing rules for royalty revenue
• On the convexity of communication games
• The two-step average tree value for graph and hypergraph games
• The average tree value for hypergraph games
• Conference structures and consistency
• The Myerson value on local structures of coalitions
• Essential Players in Cooperative Games with Graph Communication Structure
• Cost allocation and communication
• A note on the position value for hypergraph communication situations
• A value for communication situations with players having different bargaining abilities
• A note on a value with incomplete communication
• The efficient proportional Myerson values for hypergraph games
• On the structural stability of values for cooperative games
• A new allocation rule for cooperative games with hypergraph communication structure
• Networks and outside options
• The Myerson value for directed graph games
• The Myerson value for complete coalition structures
• An allocation rule for dynamic random network formation processes
• The Myerson value and superfluous supports in union stable systems
• Adaptive allocation rules for hypergraph games
• Power surplus solutions for weighted hypergraph communication situations
• Cost sharing on prices for games on graphs
• Harsanyi power solutions for games on union stable systems
• Potential maximizers and network formation
• Analyzing the Zerkani network with the Owen value
• Cominimum additive operators
• Allocation rules for communication situations with incompatibilities
• The allowable value for cooperative games with restricted permutations
• The position value and the Myerson value for hypergraph communication situations
• The degree value for games with communication structure
• Values and potential of games with cooperation structure
• A new value for communication situations
• New characteristic function for cooperative games with hypergraph communication structure
• Networks, communication and hierarchy: applications to cooperative games
• Capability accumulation and conglomeratization in the information age
• The position value is the Myerson value, in a sense
• Communication situations with asymmetric players.
• The within groups and the between groups Myerson values
• Decomposition of network communication games
• Allocation of portfolio risk and outside options: which is the best coalition structure value to solve the low-risk anomaly?
• Axiomatization and Core Stability of Allocation Rules for Hypergraph Situations
• Axiomatic characterizations of the core and the Shapley value of the broadcasting game
• Cooperative games with partial information

This page was built for publication: Allocation rules for hypergraph communication situations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1185760)