Pages that link to "Item:Q662281"
From MaRDI portal
The following pages link to Computing solutions for matching games (Q662281):
Displaying 15 items.
- Analysis of stochastic matching markets (Q378330) (← links)
- Efficient stabilization of cooperative matching games (Q526875) (← links)
- Computing the least-core and nucleolus for threshold cardinality matching games (Q897924) (← links)
- The stable fixtures problem with payments (Q1651275) (← 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)
- Coalitional games induced by matching problems: complexity and islands of tractability for the Shapley value (Q2289024) (← links)
- Solutions for the stable roommates problem with payments (Q2453162) (← links)
- Arboricity games: the core and the nucleolus (Q2687037) (← links)
- The Stable Fixtures Problem with Payments (Q2827801) (← links)
- Stabilizing Weighted Graphs (Q3387926) (← links)
- (Q5002762) (← links)
- Computing the nucleolus of weighted cooperative matching games in polynomial time (Q5918923) (← links)
- The complexity of matching games: a survey (Q6488787) (← links)
