Three-dimensional stable matching with cyclic preferences

DOI10.1007/s11590-020-01557-4zbMath1457.91274arXiv1807.05638OpenAlexW3013373065MaRDI QIDQ5919088

Laurent Poirrier, Kanstantsin Pashkovich

Publication date: 17 February 2021

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1807.05638

zbMATH Keywords

stablematchingthree-dimensionalstable matching

Mathematics Subject Classification ID

Matching models (91B68) Algorithmic game theory and complexity (91A68)

Related Items

Counterexamples of small size for three-sided stable matching with cyclic preferences, Computing relaxations for the three-dimensional stable matching problem with cyclic preferences, Minimal instances with no weakly stable matching for three-sided problem with cyclic incomplete preferences, Reconsidering the existence of stable solutions in three-sided matching problems with mixed preferences, A counterexample of size 20 for the problem of finding a 3-dimensional stable matching with cyclic preferences, On the existence of three-dimensional stable matchings with cyclic preferences, A collection of constraint programming models for the three-dimensional stable matching problem with cyclic preferences

Uses Software

• MiniSat
• Plingeling
• Treengeling
• Lingeling
• YalSAT
• CaDiCaL

Cites Work

• Unnamed Item
• \(d\)-dimensional stable matching with cyclic preferences
• Stable marriage with general preferences
• Stable matchings in three-sided systems with cyclic preferences
• Three-sided stable matchings with cyclic preferences
• Lazy Clause Exchange Policy for Parallel SAT Solvers
• Three-Dimensional Stabl Matching Problems
• Towards an Optimal CNF Encoding of Boolean Cardinality Constraints
• Theory and Applications of Satisfiability Testing
• Three-dimensional stable matching with cyclic preferences
• College Admissions and the Stability of Marriage
• On the existence of three-dimensional stable matchings with cyclic preferences