Pages that link to "Item:Q2572447"
From MaRDI portal
The following pages link to Strongly essential coalitions and the nucleolus of peer group games (Q2572447):
Displaying 14 items.
- Sharing costs in highways: a game theoretic approach (Q257250) (← links)
- Games with a permission structure -- a survey on generalizations and applications (Q526627) (← links)
- A polynomial time algorithm for computing the nucleolus for a class of disjunctive games with a permission structure (Q637584) (← links)
- An algorithm for computing the nucleolus of disjunctive non-negative additive games with an acyclic permission structure (Q992684) (← links)
- Characterization sets for the nucleolus in balanced games (Q1694788) (← links)
- The general graph matching game: approximate core (Q2078093) (← links)
- Weighted nucleoli and dually essential coalitions (Q2280044) (← links)
- On the set of extreme core allocations for minimal cost spanning tree problems (Q2397642) (← links)
- On the complexity of nucleolus computation for bipartite \(b\)-matching games (Q2670922) (← links)
- Axiomatic analysis of liability problems with rooted-tree networks in tort law (Q2683485) (← links)
- ON COOPERATIVE GAMES RELATED TO MARKET SITUATIONS AND AUCTIONS (Q3560094) (← links)
- Networks, Communication and Hierarchy: Applications to Cooperative Games (Q5057948) (← links)
- Finding nucleolus of flow game (Q5896983) (← links)
- Computing the nucleolus of weighted cooperative matching games in polynomial time (Q5918923) (← links)
