Skip to main content
SpringerLink
Log in

Subquadratic Algorithms for Succinct Stable Matching

  • Published:
Algorithmica Aims and scope Submit manuscript

Abstract

We consider the stable matching problem when the preference lists are not given explicitly but are represented in a succinct way and ask whether the problem becomes computationally easier and investigate other implications. We give subquadratic algorithms for finding a stable matching in special cases of natural succinct representations of the problem, the d-attribute, d-list, geometric, and single-peaked models. We also present algorithms for verifying a stable matching in the same models. We further show that for \(d = \omega (\log n)\) both finding and verifying a stable matching in the d-attribute and d-dimensional geometric models requires quadratic time assuming the Strong Exponential Time Hypothesis. This suggests that these succinct models are not significantly simpler computationally than the general case for sufficiently large d.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3

Similar content being viewed by others

References

  1. Abboud, A., Backurs, A., Williams, V.V.: Quadratic-time hardness of LCS and other sequence similarity measures. In: 2015 IEEE 56th Annual Symposium on Foundations of Computer Science (FOCS). IEEE (2015)

  2. Agarwal, P.K., Arge, L., Erickson, J., Franciosa, P.G., Vitter, J.S.: Efficient searching with linear constraints. In: Proceedings of the Seventeenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, pp. 169–178. ACM (1998)

  3. Agarwal, P.K., Erickson, J., et al.: Geometric range searching and its relatives. Contemp. Math. 223, 1–56 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  4. Alman, J., Williams, R.: Probabilistic polynomials and hamming nearest neighbors. In: 2015 IEEE 56th Annual Symposium on Foundations of Computer Science (FOCS). IEEE (2015)

  5. Arkin, E.M., Bae, S.W., Efrat, A., Okamoto, K., Mitchell, J.S., Polishchuk, V.: Geometric stable roommates. Inf. Process. Lett. 109(4), 219–224 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  6. Backurs, A., Indyk, P.: Edit distance cannot be computed in strongly subquadratic time (unless SETH is false). In: Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing, STOC 2015, Portland, OR, USA, June 14-17, 2015, pp. 51–58 (2015). https://doi.org/10.1145/2746539.2746612

  7. Bartholdi, J., Trick, M.A.: Stable matching with preferences derived from a psychological model. Oper. Res. Lett. 5(4), 165–169 (1986)

    Article  MathSciNet  MATH  Google Scholar 

  8. Bhatnagar, N., Greenberg, S., Randall, D.: Sampling stable marriages: why spouse-swapping won’t work. In: Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1223–1232. Society for Industrial and Applied Mathematics (2008)

  9. Bogomolnaia, A., Laslier, J.F.: Euclidean preferences. J. Math. Econ. 43(2), 87–98 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  10. Bringmann, K.: Why walking the dog takes time: Fréchet distance has no strongly subquadratic algorithms unless seth fails. In: 2014 IEEE 55th Annual Symposium on Foundations of Computer Science (FOCS), pp. 661–670. IEEE (2014)

  11. Carmosino, M.L., Gao, J., Impagliazzo, R., Mihajlin, I., Paturi, R., Schneider, S.: Nondeterministic extensions of the strong exponential time hypothesis and consequences for non-reducibility. In: Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer Science, pp. 261–270. ACM (2016)

  12. Chebolu, P., Goldberg, L.A., Martin, R.: The complexity of approximately counting stable matchings. In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, pp. 81–94. Springer (2010)

  13. Chung, K.S.: On the existence of stable roommate matchings. Games Econ. Behav. 33(2), 206–230 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  14. Dabney, J., Dean, B.C.: Adaptive stable marriage algorithms. In: Proceedings of the 48th Annual Southeast Regional Conference, p. 35. ACM (2010)

  15. Davis, S., Impagliazzo, R.: Models of greedy algorithms for graph problems. Algorithmica 54(3), 269–317 (2009). https://doi.org/10.1007/s00453-007-9124-4

    Article  MathSciNet  MATH  Google Scholar 

  16. Dobkin, D.P., Kirkpatrick, D.G.: A linear algorithm for determining the separation of convex polyhedra. J. Algorithms 6(3), 381–392 (1985)

    Article  MathSciNet  MATH  Google Scholar 

  17. Gale, D., Shapley, L.S.: College admissions and the stability of marriage. Am. Math. Mon. 69(1), 9–15 (1962)

    Article  MathSciNet  MATH  Google Scholar 

  18. Gale, D., Sotomayor, M.: Ms. Machiavelli and the stable matching problem. Am. Math. Mon. 92(4), 261–268 (1985)

    Article  MathSciNet  MATH  Google Scholar 

  19. Gonczarowski, Y.A., Nisan, N., Ostrovsky, R., Rosenbaum, W.: A stable marriage requires communication. In: Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1003–1017. SIAM (2015)

  20. Gusfield, D.: Three fast algorithms for four problems in stable marriage. SIAM J. Comput. 16(1), 111–128 (1987)

    Article  MathSciNet  MATH  Google Scholar 

  21. Gusfield, D., Irving, R.W.: The Stable Marriage Problem: Structure and Algorithms. Foundations of Computing Series. MIT Press, Cambridge (1989)

    MATH  Google Scholar 

  22. Hershberger, J., Suri, S.: A pedestrian approach to ray shooting: shoot a ray, take a walk. J. Algorithms 18(3), 403–431 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  23. Impagliazzo, R., Paturi, R.: On the complexity of k-sat. J. Comput. Syst. Sci. 62(2), 367–375 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  24. Impagliazzo, R., Paturi, R., Schneider, S.: A satisfiability algorithm for sparse depth two threshold circuits. In: 2013 IEEE 54th Annual Symposium on Foundations of Computer Science (FOCS), pp. 479–488. IEEE (2013)

  25. Impagliazzo, R., Paturi, R., Zane, F.: Which problems have strongly exponential complexity? J. Comput. Syst. Sci. 63, 512–530 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  26. Irving, R.W.: An efficient algorithm for the “stable roommates” problem. J. Algorithms 6(4), 577–595 (1985)

    Article  MathSciNet  MATH  Google Scholar 

  27. Irving, R.W., Leather, P.: The complexity of counting stable marriages. SIAM J. Comput. 15(3), 655–667 (1986)

    Article  MathSciNet  MATH  Google Scholar 

  28. Khuller, S., Mitchell, S.G., Vazirani, V.V.: On-line algorithms for weighted bipartite matching and stable marriages. Theor. Comput. Sci. 127(2), 255–267 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  29. Knuth, D.E.: Stable Marriage and Its Relation to Other Combinatorial Problems: An Introduction to the Mathematical analysis of Algorithms, vol. 10. American Mathematical Society, Providence (1997)

    Google Scholar 

  30. Kobayashi, H., Matsui, T.: Cheating strategies for the gale-shapley algorithm with complete preference lists. Algorithmica 58(1), 151–169 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  31. Matoušek, J.: Efficient partition trees. Discrete Comput. Geom. 8(1), 315–334 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  32. Matoušek, J., Schwarzkopf, O.: Linear optimization queries. In: Proceedings of the Eighth Annual Symposium on Computational Geometry, pp. 16–25. ACM (1992)

  33. Ng, C., Hirschberg, D.S.: Lower bounds for the stable marriage problem and its variants. SIAM J. Comput. 19(1), 71–77 (1990)

    Article  MathSciNet  MATH  Google Scholar 

  34. Patrascu, M., Williams, R.: On the possibility of faster SAT algorithms. In: Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2010, Austin, Texas, USA, January 17-19, 2010, pp. 1065–1075 (2010)

  35. Razborov, A.A.: Lower bounds on the size of bounded depth circuits over a complete basis with logical addition. Math. Notes 41(4), 333–338 (1987)

    Article  MATH  Google Scholar 

  36. Roth, A.E.: The economics of matching: stability and incentives. Math. Oper. Res. 7(4), 617–628 (1982)

    Article  MathSciNet  MATH  Google Scholar 

  37. Roth, A.E., Sotomayor, M.A.O.: Two-Sided Matching: A Study in Game—Theoretic Modeling and Analysis. Econometric Society Monographs. Cambridge University, Cambridge (1990)

    Book  MATH  Google Scholar 

  38. Segal, I.: The communication requirements of social choice rules and supporting budget sets. J. Econ. Theory 136(1), 341–378 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  39. Shapley, L., Scarf, H.: On cores and indivisibility. J. Math. Econ. 1(1), 23–37 (1974)

    Article  MathSciNet  MATH  Google Scholar 

  40. Smolensky, R.: Algebraic methods in the theory of lower bounds for boolean circuit complexity. In: Proceedings of the Nineteenth Annual ACM Symposium on Theory of Computing, pp. 77–82. ACM (1987)

  41. Teo, C.P., Sethuraman, J., Tan, W.P.: Gale-shapley stable marriage problem revisited: strategic issues and applications. Manag. Sci. 47(9), 1252–1267 (2001)

    Article  MATH  Google Scholar 

  42. Williams, R.: A new algorithm for optimal constraint satisfaction and its implications. In: Automata, Languages and Programming, pp. 1227–1237. Springer (2004)

  43. Williams, R.: Faster all-pairs shortest paths via circuit complexity. In: Proceedings of the 46th Annual ACM Symposium on Theory of Computing, pp. 664–673. ACM (2014)

  44. Williams, R.: Strong ETH breaks with merlin and arthur: short non-interactive proofs of batch evaluation. In: 31st Conference on Computational Complexity, CCC 2016, May 29 to June 1, 2016, Tokyo, Japan, pp. 2:1–2:17 (2016). https://doi.org/10.4230/LIPIcs.CCC.2016.2

Download references

Acknowledgements

We would like to thank Russell Impagliazzo, Vijay Vazirani, and the anonymous reviewers for helpful discussions and comments.

Author information

Authors and Affiliations

  1. Max-Planck-Institut für Informatik, Saarbrücken, Germany

    Marvin Künnemann

  2. University of California, San Diego, USA

    Daniel Moeller, Ramamohan Paturi & Stefan Schneider

Authors
  1. Marvin Künnemann
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Daniel Moeller
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Ramamohan Paturi
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Stefan Schneider
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Stefan Schneider.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Part of this research was conducted while visiting the Simons Institute for the Theory of Computing, Berkeley. This research was partially supported by the Army Research Office Grant Number W911NF-15-1-0253. This research is supported by the Simons Foundation. This research is supported by NSF Grant CCF-1213151 from the Division of Computing and Communication Foundations. Any opinions, findings and conclusions or recommendations expressed in this material are those of the authors and do not necessarily reflect the views of the National Science Foundation. The conference version is available at Springer via https://doi.org/10.1007/978-3-319-34171-221.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Künnemann, M., Moeller, D., Paturi, R. et al. Subquadratic Algorithms for Succinct Stable Matching. Algorithmica 81, 2991–3024 (2019). https://doi.org/10.1007/s00453-019-00564-x

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00453-019-00564-x

Keywords

Search

Navigation