IDEAS home Printed from https://ideas.repec.org/
MyIDEAS: Login

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. Jordi Massó & Alejandro Neme, 2010. "On Cooperative Solutions of a Generalized Assignment Game: Limit Theorems to the Set of Competitive Equilibria," UFAE and IAE Working Papers 810.10, Unitat de Fonaments de l'Anàlisi Econòmica (UAB) and Institut d'Anàlisi Econòmica (CSIC).
  2. 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.
  3. Echenique, Federico & Oviedo, Jorge, 2003. "A Theory of Stability in Many-to-Many Matching Markets," Working Papers 1185, California Institute of Technology, Division of the Humanities and Social Sciences.
  4. Ana Mauleon & Nils Roehl & Vincent Vannetelbosch, 2014. "Constitutions and Social Networks," Working Papers Dissertations 02, University of Paderborn, Faculty of Business Administration and Economics.
  5. Marilda Sotomayor, 2011. "The pareto-stability concept is a natural solution concept for discrete matching markets with indifferences," International Journal of Game Theory, Springer, vol. 40(3), pages 631-644, August.
  6. Sotomayor, Marilda, 2004. "Implementation in the many-to-many matching market," Games and Economic Behavior, Elsevier, vol. 46(1), pages 199-212, January.
  7. Bando, Keisuke, 2012. "Many-to-one matching markets with externalities among firms," Journal of Mathematical Economics, Elsevier, vol. 48(1), pages 14-20.
  8. Paula Jaramillo & Cagatay Kay & Flip Klijn, 2012. "On the Exhaustiveness of Truncation and Dropping Strategies in Many-to-Many Matching Markets," DOCUMENTOS CEDE 010316, UNIVERSIDAD DE LOS ANDES-CEDE.
  9. 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.
  10. Flip Klijn & Ayse Yazici, 2014. "A Many-to-Many "Rural Hospital Theorem"," Working Papers 567, Barcelona Graduate School of Economics.
  11. Alkan, Ahmet & Gale, David, 2003. "Stable schedule matching under revealed preference," Journal of Economic Theory, Elsevier, vol. 112(2), pages 289-306, October.
  12. Hideo Konishi & M. Utku Ünver, 2003. "Credible Group Stability in Multi-Partner Matching Problems," Working Papers 2003.115, Fondazione Eni Enrico Mattei.
  13. 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.
  14. Ester Cami?, 2002. "A Generalized Assignment Game," UFAE and IAE Working Papers 514.02, Unitat de Fonaments de l'Anàlisi Econòmica (UAB) and Institut d'Anàlisi Econòmica (CSIC).
  15. Hideo Konishi & M. Utku Unver, 2003. "Credible Group-Stability in Many-to-Many Matching Problems," Boston College Working Papers in Economics 570, Boston College Department of Economics, revised 19 Jan 2005.
  16. 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.
  17. Aziz, Haris & Brill, Markus & Harrenstein, Paul, 2013. "Testing substitutability of weak preferences," Mathematical Social Sciences, Elsevier, vol. 66(1), pages 91-94.
  18. 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.
This information is provided to you by IDEAS at the Research Division of the Federal Reserve Bank of St. Louis using RePEc data.