Pages that link to "Item:Q1185760"

The following pages link to Allocation rules for hypergraph communication situations (Q1185760):

Displaying 42 items.

• Networks and outside options (Q733765) (← links)
• An allocation rule for dynamic random network formation processes (Q747347) (← links)
• On the convexity of communication games (Q811421) (← links)
• Cominimum additive operators (Q878007) (← links)
• Conference structures and consistency (Q1044966) (← links)
• Communication situations with asymmetric players. (Q1403161) (← links)
• The degree value for games with communication structure (Q1621730) (← links)
• Cost sharing on prices for games on graphs (Q1680478) (← links)
• The position value and the Myerson value for hypergraph communication situations (Q1712743) (← links)
• The within groups and the between groups Myerson values (Q1752842) (← links)
• The Myerson value and superfluous supports in union stable systems (Q1935304) (← links)
• The Myerson value for complete coalition structures (Q1935915) (← links)
• Potential maximizers and network formation (Q1964741) (← links)
• Values and potential of games with cooperation structure (Q1972566) (← links)
• The Myerson value for directed graph games (Q1984682) (← links)
• Cooperative games with partial information (Q2021800) (← links)
• On the structural stability of values for cooperative games (Q2046545) (← links)
• The average tree value for hypergraph games (Q2074839) (← links)
• The nucleolus and inheritance of properties in communication situations (Q2095955) (← links)
• A value for communication situations with players having different bargaining abilities (Q2241248) (← links)
• The Myerson value on local structures of coalitions (Q2326080) (← links)
• Harsanyi power solutions for games on union stable systems (Q2348763) (← links)
• The position value is the Myerson value, in a sense (Q2384722) (← links)
• Decomposition of network communication games (Q2407987) (← links)
• A note on a value with incomplete communication (Q2491883) (← links)
• Adaptive allocation rules for hypergraph games (Q2670453) (← links)
• A Note on the Position Value for Hypergraph Communication Situations (Q3297833) (← links)
• Cost allocation and communication (Q4201456) (← links)
• New Characteristic Function for Cooperative Games with Hypergraph Communication Structure (Q5048468) (← links)
• Networks, Communication and Hierarchy: Applications to Cooperative Games (Q5057948) (← links)
• The core of games on ordered structures and graphs (Q5902298) (← links)
• Axiomatization and Core Stability of Allocation Rules for Hypergraph Situations (Q6048090) (← links)
• Power surplus solutions for weighted hypergraph communication situations (Q6060660) (← links)
• Capability accumulation and conglomeratization in the information age (Q6166473) (← links)
• The two-step average tree value for graph and hypergraph games (Q6170573) (← links)
• The efficient proportional Myerson values for hypergraph games (Q6484070) (← links)
• Essential Players in Cooperative Games with Graph Communication Structure (Q6495224) (← links)
• Allocation of portfolio risk and outside options: which is the best coalition structure value to solve the low-risk anomaly? (Q6562706) (← links)
• Patent package structures and sharing rules for royalty revenue (Q6624509) (← links)
• Analyzing the Zerkani network with the Owen value (Q6637509) (← links)
• The allowable value for cooperative games with restricted permutations (Q6638860) (← links)
• Axiomatic characterizations of the core and the Shapley value of the broadcasting game (Q6665450) (← links)