Subquadratic Algorithms for Succinct Stable Matching
- 27 March 2019
- journal article
- research article
- Published by Springer Nature in Algorithmica
- Vol. 81 (7) , 2991-3024
Abstract
No abstract availableKeywords
Funding Information
- Army Research Office (W911NF-15-1-0253)
- National Science Foundation (CCF-1213151, CCF-1213151)
This publication has 40 references indexed in Scilit:
- Cheating Strategies for the Gale-Shapley Algorithm with Complete Preference ListsAlgorithmica, 2009
- Geometric stable roommatesInformation Processing Letters, 2009
- Models of Greedy Algorithms for Graph ProblemsAlgorithmica, 2007
- Which Problems Have Strongly Exponential Complexity?Journal of Computer and System Sciences, 2001
- A Pedestrian Approach to Ray Shooting: Shoot a Ray, Take a WalkJournal of Algorithms, 1995
- Lower bounds on the size of bounded depth circuits over a complete basis with logical additionMathematical Notes, 1987
- Stable matching with preferences derived from a psychological modelOperations Research Letters, 1986
- An efficient algorithm for the “stable roommates” problemJournal of Algorithms, 1985
- A linear algorithm for determining the separation of convex polyhedraJournal of Algorithms, 1985
- On cores and indivisibilityJournal of Mathematical Economics, 1974