Аннотации:
As is known, the problem of finding a three-dimensional stable matching with cyclic preferences (3DSM-CYC) always has a solution, if the number of objects of each type (i.e., the problem size n) does not exceed 5. According to the conjecture proposed by Eriksson et al. (2006), this is true for any n. However, Lam and Plaxton (2019) have proposed an algorithm for constructing preference lists in 3DSM-CYC which has allowed them to disprove the mentioned conjecture. The size of the initially constructed counterexample equals 90; however, according to the results obtained by us recently for the problem with incomplete preference lists, one can use the same construction for getting a counterexample of size 45. The main contribution of this paper consists of reducing the size of the counterexample to n=20. We summarize results of the application of the technique developed by us for constructing counterexamples for 3DSM-CYC. In the final section of the paper we discuss a new variant of 3DSM, whose solution always exists and can be found within the same time as that required for solving 2DSM.
