Pages that link to "Item:Q1290660"
From MaRDI portal
The following pages link to The nucleon of cooperative games and an algorithm for matching games (Q1290660):
Displaying 15 items.
- Efficient stabilization of cooperative matching games (Q526875) (← links)
- Computing solutions for matching games (Q662281) (← links)
- An algorithm for finding the nucleolus of assignment games (Q1327070) (← links)
- On the nucleolus of neighbor games (Q1869507) (← links)
- Simple games versus weighted voting games: bounding the critical threshold value (Q1986594) (← links)
- The general graph matching game: approximate core (Q2078093) (← links)
- Population monotonicity in matching games (Q2136163) (← links)
- Clique games: a family of games with coincidence between the nucleolus and the Shapley value (Q2173166) (← links)
- On the vertices of the \(k\)-additive core (Q2519834) (← links)
- The nucleolus is well-posed (Q2581468) (← links)
- A note on the nucleolus of assignment games. (Q2753323) (← links)
- (Q5409906) (← links)
- Computing the nucleolus of weighted cooperative matching games in polynomial time (Q5918923) (← links)
- The complexity of matching games: a survey (Q6488787) (← links)
- Approximate core allocations for edge cover games (Q6535804) (← links)