IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v149y2007i1p27-3610.1007-s10479-006-0090-z.html
   My bibliography  Save this article

Equitable representation and recruitment

Author

Listed:
  • Michel Balinski

Abstract

No abstract is available for this item.

Suggested Citation

  • Michel Balinski, 2007. "Equitable representation and recruitment," Annals of Operations Research, Springer, vol. 149(1), pages 27-36, February.
    • Handle: RePEc:spr:annopr:v:149:y:2007:i:1:p:27-36:10.1007/s10479-006-0090-z
    DOI: 10.1007/s10479-006-0090-z
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s10479-006-0090-z
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s10479-006-0090-z?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Michel L. Balinski & Gabrielle Demange, 1989. "Algorithm for Proportional Matrices in Reals and Integers," Post-Print halshs-00585327, HAL.
    2. M. L. Balinski & G. Demange, 1989. "An Axiomatic Approach to Proportionality Between Matrices," Mathematics of Operations Research, INFORMS, vol. 14(4), pages 700-719, November.
    3. Balinski, Michel & Sonmez, Tayfun, 1999. "A Tale of Two Mechanisms: Student Placement," Journal of Economic Theory, Elsevier, vol. 84(1), pages 73-94, January.
    4. 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.
    5. Mourad Baïou & Michel Balinski, 2002. "Erratum: The Stable Allocation (or Ordinal Transportation) Problem," Mathematics of Operations Research, INFORMS, vol. 27(4), pages 662-680, November.
    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. Afacan, Mustafa Oǧuz, 2018. "The object allocation problem with random priorities," Games and Economic Behavior, Elsevier, vol. 110(C), pages 71-89.
    2. Michael Greinecker & Christopher Kah, 2018. "Pairwise stable matching in large economies," Graz Economics Papers 2018-01, University of Graz, Department of Economics.
    3. Gabrielle Demange, 2021. "On the resolution of cross-liabilities," PSE Working Papers halshs-03151128, HAL.
    4. Danilov, V., 2021. "Stable systems of schedule contracts," Journal of the New Economic Association, New Economic Association, vol. 51(3), pages 12-29.
    5. Demange, Gabrielle, 2012. "On party-proportional representation under district distortions," Mathematical Social Sciences, Elsevier, vol. 63(2), pages 181-191.
    6. Leduc, Matt V. & Thurner, Stefan, 2017. "Incentivizing resilience in financial networks," Journal of Economic Dynamics and Control, Elsevier, vol. 82(C), pages 44-66.
    7. Michael Greinecker & Christopher Kah, 2018. "Pairwise stable matching in large economies," Working Papers 2018-02, Faculty of Economics and Statistics, Universität Innsbruck.
    8. Manjunath, Vikram, 2016. "Fractional matching markets," Games and Economic Behavior, Elsevier, vol. 100(C), pages 321-336.
    9. Michael Greinecker & Christopher Kah, 2021. "Pairwise Stable Matching in Large Economies," Econometrica, Econometric Society, vol. 89(6), pages 2929-2974, November.
    10. Ágnes Cseh & Brian C. Dean, 2016. "Improved algorithmic results for unsplittable stable allocation problems," Journal of Combinatorial Optimization, Springer, vol. 32(3), pages 657-671, October.
    11. Chao Huang, 2023. "Concave many-to-one matching," Papers 2309.04181, arXiv.org.
    12. Oelbermann, Kai-Friederike, 2016. "Alternate Scaling algorithm for biproportional divisor methods," Mathematical Social Sciences, Elsevier, vol. 80(C), pages 25-32.
    13. Ning Chen & Nick Gravin & Pinyan Lu, 2014. "Truthful Generalized Assignments via Stable Matching," Mathematics of Operations Research, INFORMS, vol. 39(3), pages 722-736, August.
    14. 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.
    15. Mih'aly P'eter Hanics, 2022. "Graph theoretical models and algorithms of portfolio compression," Papers 2212.09473, arXiv.org.
    16. Agnes Cseh & Martin Skutella, 2018. "Paths to stable allocations," CERS-IE WORKING PAPERS 1820, Institute of Economics, Centre for Economic and Regional Studies.
    17. Satoru Iwata & Yu Yokoi, 2020. "Finding a Stable Allocation in Polymatroid Intersection," Mathematics of Operations Research, INFORMS, vol. 45(1), pages 63-85, February.
    18. Ricca, Federica & Scozzari, Andrea & Simeone, Bruno, 2011. "The give-up problem for blocked regional lists with multi-winners," Mathematical Social Sciences, Elsevier, vol. 62(1), pages 14-24, July.
    19. Gabrielle Demange, 2020. "Resolution rules in a system of financially linked firms," Working Papers hal-02502413, HAL.
    20. Gaffke, Norbert & Pukelsheim, Friedrich, 2008. "Divisor methods for proportional representation systems: An optimization approach to vector and matrix apportionment problems," Mathematical Social Sciences, Elsevier, vol. 56(2), pages 166-184, September.

    More about this item

    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:spr:annopr:v:149:y:2007:i:1:p:27-36:10.1007/s10479-006-0090-z. 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.

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