Pages that link to "Item:Q904834"

The following pages link to Efficient extensions of the Myerson value (Q904834):

Displaying 21 items.

• Efficiency and collusion neutrality in cooperative games and networks (Q380886) (← links)
• Graph monotonic values (Q647557) (← links)
• A matrix approach to TU games with coalition and communication structures (Q656796) (← links)
• Efficient quotient extensions of the Myerson value (Q827102) (← links)
• Efficient extensions of communication values (Q1639272) (← links)
• On the existence of efficient and fair extensions of communication values for connected graphs (Q1668516) (← links)
• Fair distribution of surplus and efficient extensions of the Myerson value (Q1787416) (← links)
• A non-parametric approach to testing the axioms of the Shapley value with limited data (Q1792558) (← links)
• Uncertain production environment and communication structure (Q2092783) (← links)
• Cohesive efficiency in TU-games: axiomatizations of variants of the Shapley value, egalitarian values and their convex combinations (Q2241132) (← links)
• The efficient proportional Myerson values (Q2294383) (← links)
• Two efficient values of cooperative games with graph structure based on \(\tau\)-values (Q2410098) (← links)
• The Egalitarian efficient extension of the Aumann-Drèze value (Q2420827) (← links)
• An efficient and fair solution for communication graph games (Q2440450) (← links)
• The efficient partition surplus Owen graph value (Q2678599) (← links)
• Efficient Myerson value for union stable structures (Q2827122) (← links)
• An axiomatization of the Myerson value (Q2827159) (← links)
• Graph games and edge density of graphs (Q5197303) (← links)
• Efficient extensions of the Myerson value based on endogenous claims from players (Q6115567) (← links)
• The efficient proportional Myerson values for hypergraph games (Q6484070) (← links)
• Allocation rules for communication situations with incompatibilities (Q6638851) (← links)