Pages that link to "Item:Q1365002"
From MaRDI portal
The following pages link to On the complexity of testing membership in the core of min-cost spanning tree games (Q1365002):
Displayed 9 items.
- Computational complexity in additive hedonic games (Q1046065) (← links)
- On approximately fair cost allocation in Euclidean TSP games (Q1384221) (← links)
- Total balancedness condition for Steiner tree games. (Q1811075) (← links)
- Traveling salesman games with the Monge property (Q1827808) (← links)
- NP-completeness in hedonic games (Q1886742) (← links)
- Complexity of constructing solutions in the core based on synergies among coalitions (Q2457626) (← links)
- Computing an element in the lexicographic kernel of a game (Q2474551) (← links)
- COALITION FORMATION GAMES: A SURVEY (Q3444827) (← links)
- (Q3604325) (← links)