{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,5]],"date-time":"2026-04-05T15:39:00Z","timestamp":1775403540276,"version":"3.50.1"},"reference-count":10,"publisher":"World Scientific Pub Co Pte Ltd","issue":"03","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Math. Algorithm. Appl."],"published-print":{"date-parts":[[2023,4]]},"abstract":"<jats:p> Given n men, n women, and n dogs, each man has an incomplete preference list of women, each woman has an incomplete preference list of dogs, and each dog has an incomplete preference list of men. We understand a family as a triple consisting of one man, one woman, and one dog such that the dog belongs to the preference list of the woman, who, in turn, belongs to the preference list of the man, while the latter belongs to the preference list of the dog. We understand a matching as a collection of nonintersecting families (some agents, possibly, remain single). A matching is said to be nonstable, if one can find a man, a woman, and a dog who do not live together currently but each of them would become \u201chappier\u201d if they do. Otherwise, the matching is said to be stable (a weakly stable matching). We give an example of this problem for [Formula: see text] where no stable matching exists. Moreover, we prove the absence of such an example for [Formula: see text]. Such an example was known earlier only for [Formula: see text] [P. Bir\u00f3 and E. McDermid, Three-sided stable matchings with cyclic preferences, Algorithmica\u00a058 (2010) 5\u201318]. The constructed examples also allow one to halve the size of the recently constructed analogous example for complete preference lists [C.-K. Lam and C.G. Plaxton, On the existence of three-dimensional stable matchings with cyclic preferences, in Algorithmic Game Theory, Lecture Notes in Computer Science, Vol. 11801 (Springer, 2019), pp. 329\u2013342]. <\/jats:p>","DOI":"10.1142\/s1793830922500951","type":"journal-article","created":{"date-parts":[[2022,4,19]],"date-time":"2022-04-19T15:08:03Z","timestamp":1650380883000},"source":"Crossref","is-referenced-by-count":3,"title":["Minimal instances with no weakly stable matching for three-sided problem with cyclic incomplete preferences"],"prefix":"10.1142","volume":"15","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5129-5820","authenticated-orcid":false,"given":"Eduard Yu.","family":"Lerner","sequence":"first","affiliation":[{"name":"Department of Data Analysis and Programming Technologies, Institute of Computational Mathematics and Information Technologies, Kazan Federal University, Russia"}]},{"given":"Regina E.","family":"Lerner","sequence":"additional","affiliation":[{"name":"Phystech School of Applied Mathematics and Informatics, Moscow Institute of Physics and Technology, Russia"}]}],"member":"219","published-online":{"date-parts":[[2022,5,5]]},"reference":[{"key":"S1793830922500951BIB001","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1007\/s00453-009-9315-2","volume":"58","author":"Bir\u00f3 P.","year":"2010","journal-title":"Algorithmica"},{"issue":"1","key":"S1793830922500951BIB002","first-page":"1","volume":"289","author":"Boros E.","year":"2004","journal-title":"Discrete Math."},{"key":"S1793830922500951BIB003","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1016\/j.mathsocsci.2006.03.005","volume":"52","author":"Eriksson K.","year":"2006","journal-title":"Math. Soc. Sci."},{"key":"S1793830922500951BIB004","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1080\/00029890.1962.11989827","volume":"69","author":"Gale D.","year":"1962","journal-title":"Amer. Math. Monthly"},{"key":"S1793830922500951BIB005","series-title":"CRM Proceedings and Lecture Notes","doi-asserted-by":"crossref","DOI":"10.1090\/crmp\/010","volume-title":"Stable Marriage and its Relation to Other Combinatorial Problems: An Introduction to the Mathematical Analysis of Algorithms","author":"Knuth D. E.","year":"1996"},{"key":"S1793830922500951BIB006","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1007\/978-3-030-30473-7_22","volume-title":"Algorithmic Game Theory","volume":"11801","author":"Lam C.-K.","year":"2019"},{"key":"S1793830922500951BIB007","doi-asserted-by":"publisher","DOI":"10.1142\/8591"},{"issue":"3","key":"S1793830922500951BIB008","first-page":"1","volume":"2020","author":"Pashkovich K.","year":"2020","journal-title":"Optim. Lett."},{"key":"S1793830922500951BIB009","doi-asserted-by":"crossref","first-page":"530","DOI":"10.1137\/0402048","volume":"2","author":"Pittel B.","year":"1989","journal-title":"SIAM J. Discrete Math."},{"key":"S1793830922500951BIB010","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.aam.2020.102061","volume":"120","author":"Pittel B.","year":"2020","journal-title":"Adv. Appl. Math."}],"container-title":["Discrete Mathematics, Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S1793830922500951","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,3,24]],"date-time":"2023-03-24T10:15:28Z","timestamp":1679652928000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/10.1142\/S1793830922500951"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,5,5]]},"references-count":10,"journal-issue":{"issue":"03","published-print":{"date-parts":[[2023,4]]}},"alternative-id":["10.1142\/S1793830922500951"],"URL":"https:\/\/doi.org\/10.1142\/s1793830922500951","relation":{},"ISSN":["1793-8309","1793-8317"],"issn-type":[{"value":"1793-8309","type":"print"},{"value":"1793-8317","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,5,5]]},"article-number":"2250095"}}