Pages that link to "Item:Q3348423"
From MaRDI portal
The following pages link to Three-Dimensional Stabl Matching Problems (Q3348423):
Displayed 32 items.
- \(d\)-dimensional stable matching with cyclic preferences (Q309847) (← links)
- Geometric stable roommates (Q976079) (← links)
- Three-sided stable matching problem with two of them as cooperative partners (Q1740415) (← links)
- Three-dimensional stable matching with hybrid preferences (Q1740420) (← links)
- The stable crews problem (Q1827831) (← links)
- Coalitional unanimity versus strategy-proofness in coalition formation problems (Q1939520) (← links)
- Three-sided stable matchings with cyclic preferences (Q1959723) (← links)
- Circular stable matching and 3-way kidney transplant (Q1959729) (← links)
- Bistable versions of the marriages and roommates problems (Q1970204) (← links)
- Three-sided matching problem with mixed preferences (Q2060065) (← links)
- A collection of constraint programming models for the three-dimensional stable matching problem with cyclic preferences (Q2079273) (← links)
- On the complexity of stable hypergraph matching, stable multicommodity flow and related problems (Q2167893) (← links)
- On random stable matchings: cyclic ones with strict preferences and two-sided ones with partially ordered preferences (Q2197901) (← links)
- The stable marriage problem: an interdisciplinary review from the physicist's perspective (Q2231919) (← links)
- Balanced weights and three-sided coalition formation (Q2344935) (← links)
- Pareto optimality in coalition formation (Q2437839) (← links)
- Two hardness results for core stability in hedonic coalition formation games (Q2446827) (← links)
- The exchange-stable marriage problem (Q2576343) (← links)
- The three-dimensional stable roommates problem with additively separable preferences (Q2670931) (← links)
- The Price of Matching with Metric Preferences (Q3452808) (← links)
- Solving stable matching problems using answer set programming (Q4593026) (← links)
- Three-dimensional stable matching with cyclic preferences (Q5898285) (← links)
- On the existence of three-dimensional stable matchings with cyclic preferences (Q5918706) (← links)
- Three-dimensional stable matching with cyclic preferences (Q5919088) (← links)
- On the complexity of exchange-stable roommates (Q5957362) (← links)
- Hardness results for stable exchange problems (Q5965780) (← links)
- Review of the theory of stable matchings and contract systems (Q6039790) (← links)
- Hedonic diversity games: a complexity picture with more than two colors (Q6067039) (← links)
- Computing relaxations for the three-dimensional stable matching problem with cyclic preferences (Q6073306) (← links)
- Balancing stability and efficiency in team formation as a generalized roommate problem (Q6078610) (← links)
- Strategyproof mechanism for two-sided matching with resource allocation (Q6098859) (← links)
- Novel integer programming models for the stable kidney exchange problem (Q6167384) (← links)