IDEAS home Printed from https://ideas.repec.org/a/udc/esteco/v31y2004i1p39-66.html
   My bibliography  Save this article

Modelo de planificación balanceado y modelo de asignación

Author

Listed:
  • Jorge Oviedo
  • Ana Rubio Duca

Abstract

Baïou y Balinski (2002) generalizaron el modelo de asignación empresas-trabajadores a uno donde se planifica la asignación determinando además de la asignación de los trabajadores a las empresas cuánto tiempo los trabajadores le dedicarán a la empresa. Una planificación es estable si ningún par empresa-trabajador puede incrementar sus horas de trabajo juntos, perjudicando a algún agente menos deseable. Este artículo estudia la relación que existe entre este problema y un problema de matching y se muestra que cada planificación estable es equivalente a cierto matching estable.

Suggested Citation

  • Jorge Oviedo & Ana Rubio Duca, 2004. "Modelo de planificación balanceado y modelo de asignación," Estudios de Economia, University of Chile, Department of Economics, vol. 31(1 Year 20), pages 39-66, June.
    • Handle: RePEc:udc:esteco:v:31:y:2004:i:1:p:39-66
    as

    Download full text from publisher

    File URL: http://www.econ.uchile.cl/uploads/publicacion/013c652a-a643-4f10-a36c-e6af51284f7f.pdf
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Alkan, Ahmet & Gale, David, 2003. "Stable schedule matching under revealed preference," Journal of Economic Theory, Elsevier, vol. 112(2), pages 289-306, October.
    2. Mourad Baïou & Michel Balinski, 2002. "The Stable Allocation (or Ordinal Transportation) Problem," Mathematics of Operations Research, INFORMS, vol. 27(3), pages 485-503, August.
    Full references (including those not matched with items on IDEAS)

    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.
    1. Yu Yokoi, 2017. "A Generalized Polymatroid Approach to Stable Matchings with Lower Quotas," Mathematics of Operations Research, INFORMS, vol. 42(1), pages 238-255, January.
    2. Danilov, V., 2021. "Stable systems of schedule contracts," Journal of the New Economic Association, New Economic Association, vol. 51(3), pages 12-29.
    3. Satoru Iwata & Yu Yokoi, 2020. "Finding a Stable Allocation in Polymatroid Intersection," Mathematics of Operations Research, INFORMS, vol. 45(1), pages 63-85, February.
    4. Leduc, Matt V. & Thurner, Stefan, 2017. "Incentivizing resilience in financial networks," Journal of Economic Dynamics and Control, Elsevier, vol. 82(C), pages 44-66.
    5. Manjunath, Vikram, 2016. "Fractional matching markets," Games and Economic Behavior, Elsevier, vol. 100(C), pages 321-336.
    6. Peter Biro & Tamas Fleiner, 2012. "Fractional solutions for capacitated NTU-games, with applications to stable matchings," CERS-IE WORKING PAPERS 1234, Institute of Economics, Centre for Economic and Regional Studies.
    7. Afacan, Mustafa Oǧuz, 2018. "The object allocation problem with random priorities," Games and Economic Behavior, Elsevier, vol. 110(C), pages 71-89.
    8. Kazuo Murota & Yu Yokoi, 2015. "On the Lattice Structure of Stable Allocations in a Two-Sided Discrete-Concave Market," Mathematics of Operations Research, INFORMS, vol. 40(2), pages 460-473, February.
    9. Ehlers, Lars & Hafalir, Isa E. & Yenmez, M. Bumin & Yildirim, Muhammed A., 2014. "School choice with controlled choice constraints: Hard bounds versus soft bounds," Journal of Economic Theory, Elsevier, vol. 153(C), pages 648-683.
    10. Chen, Peter & Egesdal, Michael & Pycia, Marek & Yenmez, M. Bumin, 2016. "Median stable matchings in two-sided markets," Games and Economic Behavior, Elsevier, vol. 97(C), pages 64-69.
    11. Danilov, Vladimir I. & Karzanov, Alexander V., 2023. "Stable and meta-stable contract networks," Journal of Mathematical Economics, Elsevier, vol. 108(C).
    12. Michael Greinecker & Christopher Kah, 2018. "Pairwise stable matching in large economies," Graz Economics Papers 2018-01, University of Graz, Department of Economics.
    13. Lars Ehlers & Thayer Morrill, 2020. "(Il)legal Assignments in School Choice," The Review of Economic Studies, Review of Economic Studies Ltd, vol. 87(4), pages 1837-1875.
    14. Hatfield, John William & Kojima, Fuhito, 2010. "Substitutes and stability for matching with contracts," Journal of Economic Theory, Elsevier, vol. 145(5), pages 1704-1723, September.
    15. Sean Horan & Vikram Manjunath, 2022. "Lexicographic Composition of Choice Functions," Papers 2209.09293, arXiv.org.
    16. Battal Dou{g}an & Kenzo Imamura & M. Bumin Yenmez, 2022. "Market Design with Deferred Acceptance: A Recipe for Policymaking," Papers 2209.06777, arXiv.org.
    17. Michel Balinski, 2007. "Equitable representation and recruitment," Annals of Operations Research, Springer, vol. 149(1), pages 27-36, February.
    18. Kesten, Onur & Unver, Utku, 2015. "A theory of school choice lotteries," Theoretical Economics, Econometric Society, vol. 10(2), May.
    19. 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.
    20. 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.

    More about this item

    Keywords

    Modelo de Planificación; Planificación Estable; Modelo de Matching; Matching Estable.;
    All these keywords.

    JEL classification:

    • C60 - Mathematical and Quantitative Methods - - Mathematical Methods; Programming Models; Mathematical and Simulation Modeling - - - General
    • C78 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Bargaining Theory; Matching Theory

    Statistics

    Access and download statistics

    Corrections

    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:udc:esteco:v:31:y:2004:i:1:p:39-66. 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: Verónica Kunze (email available below). General contact details of provider: https://edirc.repec.org/data/deuclcl.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.