Pages that link to "Item:Q1914097"
From MaRDI portal
The following pages link to The kernel/nucleolus of a standard tree game (Q1914097):
Displaying 21 items.
- Sharing costs in highways: a game theoretic approach (Q257250) (← links)
- The nucleolus of a standard tree game revisited: a study of its monotonicity and computational properties (Q532713) (← links)
- A generalization of the Shapley-ichiishi result (Q532758) (← links)
- Convex and exact games with non-transferable utility (Q617519) (← links)
- The nucleolus of trees with revenues (Q857952) (← links)
- Computing the least-core and nucleolus for threshold cardinality matching games (Q897924) (← links)
- The \({\mathcal B}\)-nucleolus of TU-games (Q1268656) (← links)
- Operations research games: A survey. (With comments and rejoinder) (Q1348703) (← links)
- Tree enterprises and bankruptcy ventures. A game theoretic similarity due to a graph theoretic proof (Q1372734) (← links)
- The nucleolus of arborescence games in directed acyclic graphs (Q1785328) (← links)
- Characterizing convexity of games using marginal vectors (Q1887064) (← links)
- Naturally submodular digraphs and forbidden digraph configurations (Q1962020) (← links)
- Network disconnection games: a game theoretic approach to checkpoint evaluation in networks (Q2064296) (← links)
- Cost-allocation problems for fuzzy agents in a fixed-tree network (Q2096663) (← links)
- Finding and verifying the nucleolus of cooperative games (Q2235144) (← links)
- Weighted nucleoli and dually essential coalitions (Q2280044) (← links)
- Network strength games: the core and the nucleolus (Q2297643) (← links)
- A new rule for source connection problems (Q2514781) (← links)
- On the complexity of nucleolus computation for bipartite \(b\)-matching games (Q2670922) (← links)
- Arboricity games: the core and the nucleolus (Q2687037) (← links)
- The Complexity of the Nucleolus in Compact Games (Q2828226) (← links)