Pages that link to "Item:Q5898285"
From MaRDI portal
The following pages link to Three-dimensional stable matching with cyclic preferences (Q5898285):
Displaying 24 items.
- \(d\)-dimensional stable matching with cyclic preferences (Q309847) (← links)
- Stable marriage with general preferences (Q506532) (← links)
- Geometric stable roommates (Q976079) (← links)
- Three-dimensional matching instances are rich in stable matchings (Q1626726) (← links)
- Three-sided stable matching problem with two of them as cooperative partners (Q1740415) (← links)
- Three-dimensional stable matching with hybrid preferences (Q1740420) (← links)
- Stable matchings in three-sided systems with cyclic preferences (Q1763331) (← links)
- Three-sided stable matchings with cyclic preferences (Q1959723) (← links)
- Circular stable matching and 3-way kidney transplant (Q1959729) (← links)
- Three-sided matching problem with mixed preferences (Q2060065) (← links)
- Matching with ownership (Q2075636) (← links)
- A collection of constraint programming models for the three-dimensional stable matching problem with cyclic preferences (Q2079273) (← links)
- On random stable matchings: cyclic ones with strict preferences and two-sided ones with partially ordered preferences (Q2197901) (← links)
- Balanced weights and three-sided coalition formation (Q2344935) (← links)
- Counterexamples of small size for three-sided stable matching with cyclic preferences (Q2678463) (← links)
- Reconsidering the existence of stable solutions in three-sided matching problems with mixed preferences (Q2698011) (← links)
- A counterexample of size 20 for the problem of finding a 3-dimensional stable matching with cyclic preferences (Q2700602) (← links)
- On the existence of three-dimensional stable matchings with cyclic preferences (Q5918706) (← links)
- Three-dimensional stable matching with cyclic preferences (Q5919088) (← links)
- Hardness results for stable exchange problems (Q5965780) (← links)
- Review of the theory of stable matchings and contract systems (Q6039790) (← links)
- Computing relaxations for the three-dimensional stable matching problem with cyclic preferences (Q6073306) (← links)
- Minimal instances with no weakly stable matching for three-sided problem with cyclic incomplete preferences (Q6132243) (← links)
- On a many-sided matching problem with mixed preferences (Q6660155) (← links)