mirror of
https://github.com/tgorordo/carousel.git
synced 2026-06-05 18:12:14 -07:00
75 lines
2.5 KiB
BibTeX
75 lines
2.5 KiB
BibTeX
@article{gale&shapley1962,
|
|
ISSN = {0002989, 19300972},
|
|
URL = {https://www.jstor.org/stable/2312726},
|
|
author = {D. Gale and L. S. Shapley},
|
|
journal = {The American Mathematical Monthly},
|
|
number = {1},
|
|
pages = {9--15},
|
|
publisher = {[Taylor & Francis, Ltd., Mathematical Association of America]},
|
|
title = {College Admissions and the Stability of Marriage},
|
|
urldate = {2025-04-01},
|
|
volume = {69},
|
|
year = {1962},
|
|
}
|
|
|
|
@article{doi:10.1137/0215048,
|
|
author = {Irving, Robert W. and Leather, Paul},
|
|
title = {The Complexity of Counting Stable Marriages},
|
|
journal = {SIAM Journal on Computing},
|
|
volume = {15},
|
|
number = {3},
|
|
pages = {655-667},
|
|
year = {1986},
|
|
doi = {10.1137/0215048},
|
|
URL = {https://doi.org/10.1137/0215048},
|
|
eprint = {https://doi.org/10.1137/0215048}
|
|
}
|
|
|
|
@article{doi:10.1137/0216010,
|
|
author = {Gusfield, Dan},
|
|
title = {Three Fast Algorithms for Four Problems in Stable Marriage},
|
|
journal = {SIAM Journal on Computing},
|
|
volume = {16},
|
|
number = {1},
|
|
pages = {111-128},
|
|
year = {1987},
|
|
doi = {10.1137/0216010},
|
|
URL = { https://doi.org/10.1137/0216010},
|
|
eprint = { https://doi.org/10.1137/0216010 }
|
|
}
|
|
|
|
@article{https://doi.org/10.3982/TE4830,
|
|
author = {Huang, Chao},
|
|
title = {Stable matching: An integer programming approach},
|
|
journal = {Theoretical Economics},
|
|
volume = {18},
|
|
number = {1},
|
|
pages = {37-63},
|
|
keywords = {Two-sided matching, stability, integer programming, many-to-one matching, complementarity, total unimodularity, demand type, C61, C78, D47, D63},
|
|
doi = {https://doi.org/10.3982/TE4830},
|
|
url = {https://onlinelibrary.wiley.com/doi/abs/10.3982/TE4830},
|
|
eprint = {https://onlinelibrary.wiley.com/doi/pdf/10.3982/TE4830}
|
|
}
|
|
|
|
@article{DELORME2019426,
|
|
title = {Mathematical models for stable matching problems with ties and incomplete lists},
|
|
journal = {European Journal of Operational Research},
|
|
volume = {277},
|
|
number = {2},
|
|
pages = {426-441},
|
|
year = {2019},
|
|
issn = {0377-2217},
|
|
doi = {https://doi.org/10.1016/j.ejor.2019.03.017},
|
|
url = {https://www.sciencedirect.com/science/article/pii/S0377221719302565},
|
|
author = {Maxence Delorme and Sergio García and Jacek Gondzio and Jörg Kalcsics and David Manlove and William Pettersson},
|
|
}
|
|
|
|
@misc{gutin2024findingstablematchingsassignment,
|
|
title={Finding all stable matchings with assignment constraints},
|
|
author={Gregory Gutin and Philip R. Neary and Anders Yeo},
|
|
year={2024},
|
|
eprint={2204.03989},
|
|
archivePrefix={arXiv},
|
|
primaryClass={econ.TH},
|
|
url={https://arxiv.org/abs/2204.03989},
|
|
}
|