IDEAS home Printed from https://ideas.repec.org/r/eee/matsoc/v38y1999i1p55-70.html
   My bibliography  Save this item

Three remarks on the many-to-many stable matching problem

Citations

Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
as


Cited by:

  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. Noelia Juarez & Paola B. Manasero & Oviedo Jorge, 2023. "Nash Implementation in a many-to-one Matching Market," Working Papers 255, Red Nacional de Investigadores en Economía (RedNIE).
  3. David Pérez-Castrillo & Marilda Sotomayor, 2023. "Constrained-optimal tradewise-stable outcomes in the one-sided assignment game: a solution concept weaker than the core," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 76(3), pages 963-994, October.
  4. 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.
  5. Enrico Maria Fenoaltea & Izat B. Baybusinov & Jianyang Zhao & Lei Zhou & Yi-Cheng Zhang, 2021. "The Stable Marriage Problem: an Interdisciplinary Review from the Physicist's Perspective," Papers 2103.11458, arXiv.org.
  6. Bando, Keisuke & Hirai, Toshiyuki, 2021. "Stability and venture structures in multilateral matching," Journal of Economic Theory, Elsevier, vol. 196(C).
  7. Parag A. Pathak & Alvin E. Roth, 2013. "Matching with Couples: Stability and Incentives in Large Markets," The Quarterly Journal of Economics, President and Fellows of Harvard College, vol. 128(4), pages 1585-1632.
  8. 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.
  9. 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.
  10. Egbert, Henrik & Neumann, Thomas & Rasmus, Anke, 2014. "Matchingtools und Matchingprozesse im Kontext von Junior und Senior Entrepreneuren [Matching Tools and Processes in the Context of Junior and Senior Entrepreneurship]," MPRA Paper 54829, University Library of Munich, Germany.
  11. Pérez-Castrillo, David & Sotomayor, Marilda, 2019. "Comparative statics in the multiple-partners assignment game," Games and Economic Behavior, Elsevier, vol. 114(C), pages 177-192.
  12. MAULEON, Ana & ROEHL, Nils & VANNETELBOSCH, Vincent, 2014. "Constitutions and social networks," LIDAM Discussion Papers CORE 2014003, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
  13. , & ,, 2006. "A theory of stability in many-to-many matching markets," Theoretical Economics, Econometric Society, vol. 1(2), pages 233-273, June.
  14. Chao Huang, 2023. "Multilateral matching with scale economies," Papers 2310.19479, arXiv.org.
  15. Camina, Ester, 2006. "A generalized assignment game," Mathematical Social Sciences, Elsevier, vol. 52(2), pages 152-161, September.
  16. Somouaoga Bonkoungou, 2021. "Decentralized college admissions under single application," Review of Economic Design, Springer;Society for Economic Design, vol. 25(1), pages 65-91, June.
  17. Antonio Romero-Medina & Matteo Triossi, 2021. "Two-sided strategy-proofness in many-to-many matching markets," International Journal of Game Theory, Springer;Game Theory Society, vol. 50(1), pages 105-118, March.
  18. Marilda Sotomayor, 2022. "Some remarks on the modeling of discrete matching markets," International Journal of Game Theory, Springer;Game Theory Society, vol. 51(1), pages 155-167, March.
  19. John William Hatfield & Scott Duke Kominers, 2012. "Matching in Networks with Bilateral Contracts," American Economic Journal: Microeconomics, American Economic Association, vol. 4(1), pages 176-208, February.
  20. Hideo Konishi & M. Utku Ünver, 2003. "Credible Group Stability in Multi-Partner Matching Problems," Working Papers 2003.115, Fondazione Eni Enrico Mattei.
  21. 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.
  22. Morimitsu Kurino, 2020. "Credibility, efficiency, and stability: a theory of dynamic matching markets," The Japanese Economic Review, Springer, vol. 71(1), pages 135-165, January.
  23. Agustin G. Bonifacio & Nadia Guiñazú & Noelia Juarez & Pablo Neme & Jorge Oviedo, 2024. "The lattice of envy-free many-to-many matchings with contracts," Theory and Decision, Springer, vol. 96(1), pages 113-134, February.
  24. 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).
  25. Eliana Pepa Risma, 2022. "Matching with contracts: calculation of the complete set of stable allocations," Theory and Decision, Springer, vol. 93(3), pages 449-461, October.
  26. 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.
  27. Kong, Qianqian & Peters, Hans, 2023. "Power indices for networks, with applications to matching markets," European Journal of Operational Research, Elsevier, vol. 306(1), pages 448-456.
  28. 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.
  29. Pauline Morault, 2017. "Arranged Marriages under Transferable Utilities," Working Papers halshs-01537971, HAL.
  30. 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.
  31. 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.
  32. Christian Ackermann & Felix Hahne & Julia Rieck, 2022. "Matching and Scheduling of Student-Company-Talks for a University IT-Speed Dating Event," SN Operations Research Forum, Springer, vol. 3(3), pages 1-29, September.
  33. 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.
  34. Alkan, Ahmet & Gale, David, 2003. "Stable schedule matching under revealed preference," Journal of Economic Theory, Elsevier, vol. 112(2), pages 289-306, October.
  35. Mikhail Freer & Mariia Titova, 2015. "Matching with Quotas," Working Papers 1051, George Mason University, Interdisciplinary Center for Economic Science, revised Jul 2016.
  36. Satoru Fujishige & Akihisa Tamura, 2007. "A Two-Sided Discrete-Concave Market with Possibly Bounded Side Payments: An Approach by Discrete Convex Analysis," Mathematics of Operations Research, INFORMS, vol. 32(1), pages 136-155, February.
  37. Mofidi, Seyed Shahab & Pazour, Jennifer A., 2019. "When is it beneficial to provide freelance suppliers with choice? A hierarchical approach for peer-to-peer logistics platforms," Transportation Research Part B: Methodological, Elsevier, vol. 126(C), pages 1-23.
  38. 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.
  39. Kazuo Murota, 2016. "Discrete convex analysis: A tool for economics and game theory," The Journal of Mechanism and Institution Design, Society for the Promotion of Mechanism and Institution Design, University of York, vol. 1(1), pages 151-273, December.
  40. Herings, P. Jean-Jacques, 2020. "Expectational Equilibria in Many-to-one Matching Models with Contracts - A Reformulation of Competitive Equilibrium," Research Memorandum 018, Maastricht University, Graduate School of Business and Economics (GSBE).
  41. Gutin, Gregory Z. & Neary, Philip R. & Yeo, Anders, 2023. "Unique stable matchings," Games and Economic Behavior, Elsevier, vol. 141(C), pages 529-547.
  42. Ayşe Yazıcı, 2017. "Probabilistic stable rules and Nash equilibrium in two-sided matching problems," International Journal of Game Theory, Springer;Game Theory Society, vol. 46(1), pages 103-124, March.
  43. Tam'as Fleiner & Zsuzsanna Jank'o & Ildik'o Schlotter & Alexander Teytelboym, 2018. "Complexity of Stability in Trading Networks," Papers 1805.08758, arXiv.org, revised Feb 2019.
  44. Pauline Morault, 2017. "Arranged Marriages under Transferable Utilities," SciencePo Working papers Main halshs-01537971, HAL.
  45. 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.
  46. Mauleon, Ana & Roehl, Nils & Vannetelbosch, Vincent, 2018. "Constitutions and groups," Games and Economic Behavior, Elsevier, vol. 107(C), pages 135-152.
  47. Aziz, Haris & Brill, Markus & Harrenstein, Paul, 2013. "Testing substitutability of weak preferences," Mathematical Social Sciences, Elsevier, vol. 66(1), pages 91-94.
  48. Bettina Klaus & David F. Manlove & Francesca Rossi, 2014. "Matching under Preferences," Cahiers de Recherches Economiques du Département d'économie 14.07, Université de Lausanne, Faculté des HEC, Département d’économie.
  49. 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.
  50. Pavlos Eirinakis & Dimitrios Magos & Ioannis Mourtos & Panayiotis Miliotis, 2012. "Finding All Stable Pairs and Solutions to the Many-to-Many Stable Matching Problem," INFORMS Journal on Computing, INFORMS, vol. 24(2), pages 245-259, May.
  51. Sotomayor, Marilda, 2004. "Implementation in the many-to-many matching market," Games and Economic Behavior, Elsevier, vol. 46(1), pages 199-212, January.
  52. Papai, Szilvia, 2004. "Unique stability in simple coalition formation games," Games and Economic Behavior, Elsevier, vol. 48(2), pages 337-354, August.
  53. Chao Huang, 2021. "Unidirectional substitutes and complements," Papers 2108.12572, arXiv.org.
  54. Tam'as Fleiner & Zsuzsanna Jank'o & Akihisa Tamura & Alexander Teytelboym, 2015. "Trading Networks with Bilateral Contracts," Papers 1510.01210, arXiv.org, revised May 2018.
  55. 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.
  56. Erdil, Aytek & Kumano, Taro, 2019. "Efficiency and stability under substitutable priorities with ties," Journal of Economic Theory, Elsevier, vol. 184(C).
  57. Danilov, V., 2021. "Stable systems of schedule contracts," Journal of the New Economic Association, New Economic Association, vol. 51(3), pages 12-29.
  58. Wu, Qingyun & Roth, Alvin E., 2018. "The lattice of envy-free matchings," Games and Economic Behavior, Elsevier, vol. 109(C), pages 201-211.
  59. Tamás Fleiner & Zsuzsanna Jankó & Ildikó Schlotter & Alexander Teytelboym, 2023. "Complexity of stability in trading networks," International Journal of Game Theory, Springer;Game Theory Society, vol. 52(3), pages 629-648, September.
  60. P'eter Bir'o & Gergely Cs'aji, 2022. "Strong core and Pareto-optimal solutions for the multiple partners matching problem under lexicographic preferences," Papers 2202.05484, arXiv.org.
  61. 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.
IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.