The complexity of approximately counting stable matchings-Reference-Cited by-同舟云学术

The complexity of approximately counting stable matchings

Published:2012-06 Issue: Volume:437 Page:35-68
ISSN:0304-3975
Container-title:Theoretical Computer Science
language:en
Short-container-title:Theoretical Computer Science

Author:

Chebolu Prasad,Goldberg Leslie Ann,Martin Russell

Publisher

Elsevier BV

Subject

General Computer Science,Theoretical Computer Science

Reference20 articles.

1. N. Bhatnagar, S. Greenberg, D. Randall, Sampling stable marriages: why spouse-swapping won’t work, in: Proc. 19th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2008, pp. 1223–1232.

2. Euclidean preferences;Bogomolnaia;J. Math. Econom.,2007

3. Canadian resident matching service, http://www.carms.ca./eng/operations_algorithm_e.shtml.

4. Linear datalog and bounded path duality of relational structures;Dalmau;Log. Methods Comput. Sci.,2005

5. Introduction to Lattices and Order;Davey,1990

Cited by 9 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Stable Matchings with Restricted Preferences: Structure and Complexity;ACM Transactions on Economics and Computation;2022-09-30

2. Counting Vertices of Integral Polytopes Defined by Facets;Discrete & Computational Geometry;2022-07-05

3. Solving hard stable matching problems involving groups of similar agents;Theoretical Computer Science;2020-12

4. Algorithms for #BIS-Hard Problems on Expander Graphs;SIAM Journal on Computing;2020-01

5. A simply exponential upper bound on the maximum number of stable matchings;Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing;2018-06-20