Pages that link to "Item:Q2440450"
From MaRDI portal
The following pages link to An efficient and fair solution for communication graph games (Q2440450):
Displaying 12 items.
- Component-wise proportional solutions for communication graph games (Q277301) (← links)
- An Owen-type value for games with two-level communication structure (Q338913) (← links)
- Weighted component-wise solutions for graph games (Q777752) (← links)
- Efficient quotient extensions of the Myerson value (Q827102) (← links)
- Efficient extensions of the Myerson value (Q904834) (← links)
- Efficient extensions of communication values (Q1639272) (← links)
- On the existence of efficient and fair extensions of communication values for connected graphs (Q1668516) (← links)
- Cost sharing on prices for games on graphs (Q1680478) (← 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)
- Fairness and fairness for neighbors: the difference between the Myerson value and component-wise egalitarian solutions (Q1925896) (← links)
- The Myerson value for directed graph games (Q1984682) (← links)
