Pages that link to "Item:Q5918923"
From MaRDI portal
The following pages link to Computing the nucleolus of weighted cooperative matching games in polynomial time (Q5918923):
Displaying 8 items.
- Simple games versus weighted voting games: bounding the critical threshold value (Q1986594) (← links)
- The general graph matching game: approximate core (Q2078093) (← links)
- On the population monotonicity of independent set games (Q2084006) (← links)
- Population monotonicity in matching games (Q2136163) (← links)
- On the complexity of nucleolus computation for bipartite \(b\)-matching games (Q2670922) (← links)
- Arboricity games: the core and the nucleolus (Q2687037) (← links)
- (Q5919393) (redirect page) (← links)
- The complexity of matching games: a survey (Q6488787) (← links)
