A characterization of strongly stable fractional matchings
Author
Abstract
Suggested Citation
DOI: 10.1007/s11750-019-00528-y
Download full text from publisher
As the access to this document is restricted, you may want to search for a different version of it.
References listed on IDEAS
- Alvin E. Roth & Uriel G. Rothblum & John H. Vande Vate, 1993. "Stable Matchings, Optimal Assignments, and Linear Programming," Mathematics of Operations Research, INFORMS, vol. 18(4), pages 803-828, November.
Citations
Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
Cited by:
- Neme, Pablo & Oviedo, Jorge, 2021.
"On the set of many-to-one strongly stable fractional matchings,"
Mathematical Social Sciences, Elsevier, vol. 110(C), pages 1-13.
- Pablo Neme & Jorge Oviedo, 2020. "On the set of many-to-one strongly stable fractional matchings," Working Papers 19, Red Nacional de Investigadores en Economía (RedNIE).
- Juárez, Noelia & Neme, Pablo & Oviedo, Jorge, 2022.
"Lattice structure of the random stable set in many-to-many matching markets,"
Games and Economic Behavior, Elsevier, vol. 132(C), pages 255-273.
- Noelia Juarez & Pablo A. Neme & Jorge Oviedo, 2020. "Lattice structure of the random stable set in many-to-many matching market," Papers 2002.08156, arXiv.org, revised Jun 2020.
- Noelia Juárez & Pablo Neme & Jorge Oviedo, 2020. "Lattice structure of the random stable set in many-to-many matching markets," Working Papers 18, Red Nacional de Investigadores en Economía (RedNIE).
Most related items
These are the items that most often cite the same works as this one and are cited by the same works as this one.- Fleiner, Tamas, 2003. "On the stable b-matching polytope," Mathematical Social Sciences, Elsevier, vol. 46(2), pages 149-158, October.
- Biermann, Florian M. & Naroditskiy, Victor & Polukarov, Maria & Nguyen, Tri-Dung & Rogers, Alex & Jennings, Nicholas R., 2014. "Task assignment with controlled and autonomous agents," Mathematical Social Sciences, Elsevier, vol. 71(C), pages 116-121.
- Roth, Alvin E. & Sonmez, Tayfun & Utku Unver, M., 2005.
"Pairwise kidney exchange,"
Journal of Economic Theory, Elsevier, vol. 125(2), pages 151-188, December.
- Alvin E. Roth & Tayfun Sonmez & M. Utku Unver, 2004. "Pairwise Kidney Exchange," NBER Working Papers 10698, National Bureau of Economic Research, Inc.
- Sönmez, Tayfun & Utku Ünver, M. & Roth, Alvin E., 2005. "Pairwise kidney exchange," Scholarly Articles 32072400, Harvard University Department of Economics.
- Alvin E. Roth & Tayfun Sonmez & M. Utku Unver, 2004. "Pairwise Kidney Exchange," Levine's Bibliography 122247000000000350, UCLA Department of Economics.
- Alvin E. Roth & Tayfun Sönmez & M. Utku Ünver, 2004. "Pairwise Kidney Exchange," Game Theory and Information 0408001, University Library of Munich, Germany, revised 16 Feb 2005.
- Alvin E. Roth & Tayfun Sönmez & M. Utku Ünver, 2004. "Pairwise Kidney Exchange," Boston College Working Papers in Economics 620, Boston College Department of Economics.
- Adachi, Hiroyuki, 2000. "On a characterization of stable matchings," Economics Letters, Elsevier, vol. 68(1), pages 43-49, July.
- Han, Xiang, 2024. "On the efficiency and fairness of deferred acceptance with single tie-breaking," Journal of Economic Theory, Elsevier, vol. 218(C).
- Xing Wang & Niels Agatz & Alan Erera, 2018. "Stable Matching for Dynamic Ride-Sharing Systems," Transportation Science, INFORMS, vol. 52(4), pages 850-867, August.
- Kolos Csaba Ágoston & Péter Biró & Iain McBride, 2016.
"Integer programming methods for special college admissions problems,"
Journal of Combinatorial Optimization, Springer, vol. 32(4), pages 1371-1399, November.
- Kolos Csaba Agoston & Peter Biro & Iain McBride, 2016. "Integer programming methods for special college admissions problems," CERS-IE WORKING PAPERS 1632, Institute of Economics, Centre for Economic and Regional Studies.
- Schlegel, Jan Christoph & Mamageishvili, Akaki, 2020. "Welfare theorems for random assignments with priorities," Games and Economic Behavior, Elsevier, vol. 124(C), pages 62-81.
- Sperisen, Benjamin & Wiseman, Thomas, 2020. "Too good to fire: Non-assortative matching to play a dynamic game," Games and Economic Behavior, Elsevier, vol. 124(C), pages 491-511.
- Neme, Pablo & Oviedo, Jorge, 2021.
"On the set of many-to-one strongly stable fractional matchings,"
Mathematical Social Sciences, Elsevier, vol. 110(C), pages 1-13.
- Pablo Neme & Jorge Oviedo, 2020. "On the set of many-to-one strongly stable fractional matchings," Working Papers 19, Red Nacional de Investigadores en Economía (RedNIE).
- Pavlos Eirinakis & Dimitrios Magos & Ioannis Mourtos & Panayiotis Miliotis, 2014. "Polyhedral Aspects of Stable Marriage," Mathematics of Operations Research, INFORMS, vol. 39(3), pages 656-671, August.
- Peng, Zixuan & Shan, Wenxuan & Zhu, Xiaoning & Yu, Bin, 2022. "Many-to-one stable matching for taxi-sharing service with selfish players," Transportation Research Part A: Policy and Practice, Elsevier, vol. 160(C), pages 255-279.
- Chao Huang, 2022. "Firm-worker hypergraphs," Papers 2211.06887, arXiv.org, revised Nov 2023.
- Yannai A. Gonczarowski & Clayton Thomas, 2022. "Structural Complexities of Matching Mechanisms," Papers 2212.08709, arXiv.org, revised Mar 2024.
- Han, Xiang, 2024. "A theory of fair random allocation under priorities," Theoretical Economics, Econometric Society, vol. 19(3), July.
- Lauermann, Stephan & Nöldeke, Georg, 2014.
"Stable marriages and search frictions,"
Journal of Economic Theory, Elsevier, vol. 151(C), pages 163-195.
- Lauermann, Stephan & Nöldeke, George, 2012. "Stable Marriages and Search Frictions," Working papers 2012/10, Faculty of Business and Economics - University of Basel.
- Jay Sethuraman & Chung-Piaw Teo & Liwen Qian, 2006. "Many-to-One Stable Matching: Geometry and Fairness," Mathematics of Operations Research, INFORMS, vol. 31(3), pages 581-596, August.
- Jens Gudmundsson, 2019.
"Compromises and Rewards: stable and non-manipulable probabilistic matching,"
International Journal of Game Theory, Springer;Game Theory Society, vol. 48(2), pages 365-392, June.
- Gudmundsson, Jens, 2015. "Compromises and Rewards: Stable and Non-manipulable Probabilistic Matching," Working Papers 2015:32, Lund University, Department of Economics, revised 19 Oct 2017.
- Aaron L. Bodoh-Creed, 2020. "Optimizing for Distributional Goals in School Choice Problems," Management Science, INFORMS, vol. 66(8), pages 3657-3676, August.
- Juárez, Noelia & Neme, Pablo & Oviedo, Jorge, 2022.
"Lattice structure of the random stable set in many-to-many matching markets,"
Games and Economic Behavior, Elsevier, vol. 132(C), pages 255-273.
- Noelia Juárez & Pablo Neme & Jorge Oviedo, 2020. "Lattice structure of the random stable set in many-to-many matching markets," Working Papers 18, Red Nacional de Investigadores en Economía (RedNIE).
- Noelia Juarez & Pablo A. Neme & Jorge Oviedo, 2020. "Lattice structure of the random stable set in many-to-many matching market," Papers 2002.08156, arXiv.org, revised Jun 2020.
More about this item
Keywords
Matching markets; Marriage model; Stable fractional matchings; Strongly stable fractional matchings; Linear programming;All these keywords.
Statistics
Access and download statisticsCorrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:topjnl:v:28:y:2020:i:1:d:10.1007_s11750-019-00528-y. See general information about how to correct material in RePEc.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .
Please note that corrections may take a couple of weeks to filter through the various RePEc services.