Pages that link to "Item:Q3329250"
From MaRDI portal
The following pages link to On the core and nucleolus of minimum cost spanning tree games (Q3329250):
Displayed 35 items.
- Cooperative location games based on the minimum diameter spanning Steiner subgraph problem (Q423895) (← links)
- A cost allocation rule for \(k\)-hop minimum cost spanning tree problems (Q433843) (← links)
- A characterization of kruskal sharing rules for minimum cost spanning tree problems (Q532655) (← links)
- Merge-proofness in minimum cost spanning tree problems (Q548071) (← links)
- Axiomatization of the Shapley value on minimum cost spanning tree games (Q700116) (← links)
- Cost monotonicity, consistency and minimum cost spanning tree games (Q705853) (← links)
- Sequential contributions rules for minimum cost spanning tree problems (Q712474) (← links)
- On the core of network synthesis games (Q757264) (← links)
- Optimal equilibria in the non-cooperative game associated with cost spanning tree problem (Q816509) (← links)
- A vertex oriented approach to the equal remaining obligations rule for minimum cost spanning tree situations (Q845585) (← links)
- Sharing the cost of multicast transmissions in wireless networks (Q861267) (← links)
- A characterization of optimistic weighted Shapley rules in minimum cost spanning tree problems (Q926221) (← links)
- On obligation rules for minimum cost spanning tree problems (Q980946) (← links)
- Sharing a minimal cost spanning tree: beyond the folk solution (Q980947) (← links)
- Extended cooperative networks games (Q1028468) (← links)
- Network flow problems and permutationally concave games (Q1042338) (← links)
- On the core of a traveling salesman cost allocation game (Q1122517) (← links)
- Operations research games: A survey. (With comments and rejoinder) (Q1348703) (← links)
- Three-person spanning tree games (Q1596863) (← links)
- On the core of the minimum cost Steiner tree game in networks (Q1897387) (← links)
- The kernel/nucleolus of a standard tree game (Q1914097) (← links)
- Computation of the Shapley value of minimum cost spanning tree games: P-hardness and polynomial cases (Q1926641) (← links)
- A cooperative location game based on the 1-center location problem (Q2275823) (← links)
- On the core of information graph games (Q2366097) (← links)
- ``Optimistic'' weighted Shapley rules in minimum cost spanning tree problems (Q2456424) (← links)
- The optimistic \(TU\) game in minimum cost spanning tree problems (Q2458425) (← links)
- A fair rule in minimum cost spanning tree problems (Q2469848) (← links)
- COST SHARING IN NETWORKS: SOME OPEN QUESTIONS (Q2854000) (← links)
- CHARACTERIZATIONS OF THE KAR AND FOLK SOLUTIONS FOR MINIMUM COST SPANNING TREE PROBLEMS (Q2854002) (← links)
- A note on Steiner tree games (Q2892158) (← links)
- The irreducible Core of a minimum cost spanning tree game (Q3142157) (← links)
- Cooperative networks games with elastic demands (Q3515388) (← links)
- Noncooperative cost spanning tree games with budget restrictions (Q3612297) (← links)
- A generalized linear production model: A unifying model (Q3743164) (← links)
- Tarification par des jeux Coopératifs avec Demandes Élastiques (Q4531459) (← links)