IDEAS home Printed from https://ideas.repec.org/p/mtl/montec/17-2004.html

Nearly Serial Sharing Methods

Author

Listed:
  • SPRUMONT, Yves

Abstract

A group of agents participate in a cooperative enterprise producing a single good. Each participant contributes a particular type of input; output is nondecreasing in these contributions. How should it be shared? We analyze the implications of the axiom of Group Monotonicity: if a group of agents simultaneously decrease their input contributions, not all of them should receive a higher share of output. We show that in combination with other more familiar axioms, this condition pins down a very small class of methods, which we dub nearly serial.

Suggested Citation

  • SPRUMONT, Yves, 2004. "Nearly Serial Sharing Methods," Cahiers de recherche 17-2004, Centre interuniversitaire de recherche en économie quantitative, CIREQ.
    • Handle: RePEc:mtl:montec:17-2004
    as

    Download full text from publisher

    File URL: http://www.cireqmontreal.com/wp-content/uploads/cahiers/17-2004-cah.pdf
    Download Restriction: no
    ---><---

    Other versions of this item:

    Citations

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


    Cited by:

    1. Eric Bahel & Christian Trudeau, 2013. "Independence of dummy units and Shapley-Shubik methods in cost sharing problems with technological cooperation," Working Papers 1304, University of Windsor, Department of Economics.
    2. Yves Sprumont, 2010. "An Axiomatization of the Serial Cost-Sharing Method," Econometrica, Econometric Society, vol. 78(5), pages 1711-1748, September.
    3. Cyril Briand & Sandra Ulrich Ngueveu & Přemysl Šůcha, 2017. "Finding an optimal Nash equilibrium to the multi-agent project scheduling problem," Journal of Scheduling, Springer, vol. 20(5), pages 475-491, October.
    4. Eric Bahel & Christian Trudeau, 2018. "Consistency requirements and pattern methods in cost sharing problems with technological cooperation," International Journal of Game Theory, Springer;Game Theory Society, vol. 47(3), pages 737-765, September.
    5. Bahel, Eric & Haller, Hans, 2013. "Cycles with undistinguished actions and extended Rock–Paper–Scissors games," Economics Letters, Elsevier, vol. 120(3), pages 588-591.
    6. Eric Bahel, 2011. "The implications of the ranking axiom for discrete cost sharing methods," International Journal of Game Theory, Springer;Game Theory Society, vol. 40(3), pages 551-589, August.
    7. Eric Bahel & Christian Trudeau, 2014. "Shapley–Shubik methods in cost sharing problems with technological cooperation," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 43(2), pages 261-285, August.
    8. Hervé Moulin & Yves Sprumont, 2007. "Fair allocation of production externalities : recent results," Revue d'économie politique, Dalloz, vol. 117(1), pages 7-36.

    More about this item

    Keywords

    ;
    ;
    ;
    ;

    JEL classification:

    • C71 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Cooperative Games
    • D63 - Microeconomics - - Welfare Economics - - - Equity, Justice, Inequality, and Other Normative Criteria and Measurement

    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:mtl:montec:17-2004. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: Sharon BREWER (email available below). General contact details of provider: https://edirc.repec.org/data/cdmtlca.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.