IDEAS home Printed from https://ideas.repec.org/
MyIDEAS: Log in (now much improved!)

Citations for "Three remarks on the many-to-many stable matching problem"

by Sotomayor, Marilda

For a complete description of this item, click here. For a RSS feed for citations of this item, click here.
as
in new window


  1. Konishi, Hideo & Unver, M. Utku, 2006. "Credible group stability in many-to-many matching problems," Journal of Economic Theory, Elsevier, vol. 129(1), pages 57-80, July.
  2. Paula Jaramillo & Çaǧatay Kayı & Flip Klijn, 2014. "On the exhaustiveness of truncation and dropping strategies in many-to-many matching markets," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 42(4), pages 793-811, April.
  3. Fırat, M. & Briskorn, D. & Laugier, A., 2016. "A Branch-and-Price algorithm for stable workforce assignments with hierarchical skills," European Journal of Operational Research, Elsevier, vol. 251(2), pages 676-685.
  4. Martinez, Ruth & Masso, Jordi & Neme, Alejandro & Oviedo, Jorge, 2004. "An algorithm to compute the full set of many-to-many stable matchings," Mathematical Social Sciences, Elsevier, vol. 47(2), pages 187-210, March.
  5. Ana Mauleon & Nils Roehl & Vincent Vannetelbosch, 2014. "Constitutions and Social Networks," Working Papers Dissertations 02, Paderborn University, Faculty of Business Administration and Economics.
  6. Echenique, Federico & Oviedo, Jorge, 2006. "A theory of stability in many-to-many matching markets," Theoretical Economics, Econometric Society, vol. 1(2), pages 233-273, June.
  7. Camina, Ester, 2006. "A generalized assignment game," Mathematical Social Sciences, Elsevier, vol. 52(2), pages 152-161, September.
  8. Hideo Konishi & M. Utku Ünver, 2003. "Credible Group Stability in Multi-Partner Matching Problems," Working Papers 2003.115, Fondazione Eni Enrico Mattei.
  9. Sotomayor, Marilda, 2007. "Connecting the cooperative and competitive structures of the multiple-partners assignment game," Journal of Economic Theory, Elsevier, vol. 134(1), pages 155-174, May.
  10. Khare, Shashwat & Roy, Souvik, 2017. "Stability in Matching with Couples having Non-Responsive Preferences," Research Memorandum 007, Maastricht University, Graduate School of Business and Economics (GSBE).
  11. Echenique, Federico & Oviedo, Jorge, 2004. "Core many-to-one matchings by fixed-point methods," Journal of Economic Theory, Elsevier, vol. 115(2), pages 358-376, April.
  12. Marilda Sotomayor, 2008. "The stability of the equilibrium outcomes in the admission games induced by stable matching rules," International Journal of Game Theory, Springer;Game Theory Society, vol. 36(3), pages 621-640, March.
  13. Massó, Jordi & Neme, Alejandro, 2014. "On cooperative solutions of a generalized assignment game: Limit theorems to the set of competitive equilibria," Journal of Economic Theory, Elsevier, vol. 154(C), pages 187-215.
  14. Klaus, Bettina & Walzl, Markus, 2009. "Stable many-to-many matchings with contracts," Journal of Mathematical Economics, Elsevier, vol. 45(7-8), pages 422-434, July.
  15. Marilda Sotomayor, 2011. "The pareto-stability concept is a natural solution concept for discrete matching markets with indifferences," International Journal of Game Theory, Springer;Game Theory Society, vol. 40(3), pages 631-644, August.
  16. Alkan, Ahmet & Gale, David, 2003. "Stable schedule matching under revealed preference," Journal of Economic Theory, Elsevier, vol. 112(2), pages 289-306, October.
  17. Mikhail Freer & Mariia Titova, 2015. "Matching with Quotas," Working Papers 1051, George Mason University, Interdisciplinary Center for Economic Science, revised Jul 2016.
  18. Klijn, Flip & Yazıcı, Ayşe, 2014. "A many-to-many ‘rural hospital theorem’," Journal of Mathematical Economics, Elsevier, vol. 54(C), pages 63-73.
  19. Segal, Ilya, 2007. "The communication requirements of social choice rules and supporting budget sets," Journal of Economic Theory, Elsevier, vol. 136(1), pages 341-378, September.
  20. Aziz, Haris & Brill, Markus & Harrenstein, Paul, 2013. "Testing substitutability of weak preferences," Mathematical Social Sciences, Elsevier, vol. 66(1), pages 91-94.
  21. Bettina Klaus & David F. Manlove & Francesca Rossi, 2014. "Matching under Preferences," Cahiers de Recherches Economiques du Département d'Econométrie et d'Economie politique (DEEP) 14.07, Université de Lausanne, Faculté des HEC, DEEP.
  22. Jiao, Zhenhua & Tian, Guoqiang, 2017. "The Blocking Lemma and strategy-proofness in many-to-many matchings," Games and Economic Behavior, Elsevier, vol. 102(C), pages 44-55.
  23. Sotomayor, Marilda, 2004. "Implementation in the many-to-many matching market," Games and Economic Behavior, Elsevier, vol. 46(1), pages 199-212, January.
  24. Tam\'as Fleiner & Zsuzsanna Jank\'o & Akihisa Tamura & Alexander Teytelboym, 2015. "Trading Networks with Bilateral Contracts," Papers 1510.01210, arXiv.org, revised Feb 2016.
  25. Marilda Sotomayor, 2016. "Modeling cooperative decision situations: the deviation function form and the equilibrium concept," International Journal of Game Theory, Springer;Game Theory Society, vol. 45(3), pages 743-768, August.
  26. Hatfield, John William & Kominers, Scott Duke, 2017. "Contract design and stability in many-to-many matching," Games and Economic Behavior, Elsevier, vol. 101(C), pages 78-97.
  27. Jiao, Zhenhua & Tian, Guoqiang, 2015. "The stability of many-to-many matching with max–min preferences," Economics Letters, Elsevier, vol. 129(C), pages 52-56.
This information is provided to you by IDEAS at the Research Division of the Federal Reserve Bank of St. Louis using RePEc data.