IDEAS home Printed from https://ideas.repec.org/a/spr/reecde/v22y2018i1d10.1007_s10058-018-0209-0.html
   My bibliography  Save this article

Stable cost sharing in production allocation games

Author

Listed:
  • Eric Bahel

    (Virginia Polytechnic Institute and State University)

  • Christian Trudeau

    (University of Windsor)

Abstract

Suppose that a group of agents have demands for some good. Every agent owns a technology which allows them to produce the good, with these technologies varying in their effectiveness. If all technologies exhibit increasing returns to scale (IRS) then it is always efficient to centralize production of the good, whereas efficiency in the case of decreasing returns to scale (DRS) typically requires to spread production. We search for stable cost allocations while differentiating allocations with homogeneous prices, in which all units produced are traded at the same price, from allocations with heterogeneous prices. For the respective cases of IRS or DRS, it is shown that there always exist stable cost sharing rules with homogeneous prices. Finally, in the general framework (under which there may exist no stable allocation at all) we provide a sufficient condition for the existence of stable allocations with homogeneous prices. This condition is shown to be both necessary and sufficient in problems with unitary demands.

Suggested Citation

  • Eric Bahel & Christian Trudeau, 2018. "Stable cost sharing in production allocation games," Review of Economic Design, Springer;Society for Economic Design, vol. 22(1), pages 25-53, June.
  • Handle: RePEc:spr:reecde:v:22:y:2018:i:1:d:10.1007_s10058-018-0209-0
    DOI: 10.1007/s10058-018-0209-0
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10058-018-0209-0
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.

    File URL: https://libkey.io/10.1007/s10058-018-0209-0?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 look for a different version below or search for a different version of it.

    Other versions of this item:

    References listed on IDEAS

    as
    1. Camina, Ester, 2006. "A generalized assignment game," Mathematical Social Sciences, Elsevier, vol. 52(2), pages 152-161, September.
    2. Yves Sprumont, 2005. "On the Discrete Version of the Aumann-Shapley Cost-Sharing Method," Econometrica, Econometric Society, vol. 73(5), pages 1693-1712, September.
    3. R.J. Aumann & S. Hart (ed.), 2002. "Handbook of Game Theory with Economic Applications," Handbook of Game Theory with Economic Applications, Elsevier, edition 1, volume 3, number 3.
    4. Quant, Marieke & Borm, Peter & Reijnierse, Hans, 2006. "Congestion network problems and related games," European Journal of Operational Research, Elsevier, vol. 172(3), pages 919-930, August.
    5. Crawford, Vincent P & Knoer, Elsie Marie, 1981. "Job Matching with Heterogeneous Firms and Workers," Econometrica, Econometric Society, vol. 49(2), pages 437-450, March.
    6. Yokote, Koji, 2016. "Core and competitive equilibria: An approach from discrete convex analysis," Journal of Mathematical Economics, Elsevier, vol. 66(C), pages 1-13.
    7. Bergantinos, Gustavo & Vidal-Puga, Juan J., 2007. "A fair rule in minimum cost spanning tree problems," Journal of Economic Theory, Elsevier, vol. 137(1), pages 326-352, November.
    8. Anderson, Robert M., 1992. "The core in perfectly competitive economies," Handbook of Game Theory with Economic Applications, in: R.J. Aumann & S. Hart (ed.), Handbook of Game Theory with Economic Applications, edition 1, volume 1, chapter 14, pages 413-457, Elsevier.
    9. Sanchez-Soriano, Joaquin & Lopez, Marco A. & Garcia-Jurado, Ignacio, 2001. "On the core of transportation games," Mathematical Social Sciences, Elsevier, vol. 41(2), pages 215-225, March.
    10. Hervé Moulin & Yves Sprumont, 2007. "Fair allocation of production externalities : recent results," Revue d'économie politique, Dalloz, vol. 117(1), pages 7-36.
    11. Trudeau, Christian, 2012. "A new stable and more responsive cost sharing solution for minimum cost spanning tree problems," Games and Economic Behavior, Elsevier, vol. 75(1), pages 402-412.
    12. Trudeau, Christian, 2009. "Cost sharing with multiple technologies," Games and Economic Behavior, Elsevier, vol. 67(2), pages 695-707, November.
    13. 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.
    14. Marilda Sotomayor, 1992. "The Multiple Partners Game," Palgrave Macmillan Books, in: Mukul Majumdar (ed.), Equilibrium and Dynamics, chapter 17, pages 322-354, Palgrave Macmillan.
    15. Bahel, Eric & Trudeau, Christian, 2014. "Stable lexicographic rules for shortest path games," Economics Letters, Elsevier, vol. 125(2), pages 266-269.
    16. Hervé Moulin, 2013. "Cost Sharing In Networks: Some Open Questions," International Game Theory Review (IGTR), World Scientific Publishing Co. Pte. Ltd., vol. 15(02), pages 1-10.
    17. Eric Bahel & Christian Trudeau, 2013. "A discrete cost sharing model with technological cooperation," International Journal of Game Theory, Springer;Game Theory Society, vol. 42(2), pages 439-460, May.
    18. Rosenthal, Edward C., 2013. "Shortest path games," European Journal of Operational Research, Elsevier, vol. 224(1), pages 132-140.
    19. Trudeau, Christian, 2009. "Network flow problems and permutationally concave games," Mathematical Social Sciences, Elsevier, vol. 58(1), pages 121-131, July.
    Full references (including those not matched with items on IDEAS)

    Citations

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


    Cited by:

    1. 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.
    2. Jin Li & Sang-Chul Suh & Yuntong Wang, 2020. "Sharing pollution permits under welfare upper bounds," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 28(2), pages 489-505, July.
    3. Bahel, Eric & Trudeau, Christian, 2019. "A cost sharing example in which subsidies are necessary for stability," Economics Letters, Elsevier, vol. 185(C).
    4. Sang-Chul Suh & Yuntong Wang, 2016. "Pollution Permit Sharing Games," Working Papers 1604, University of Windsor, Department of Economics.
    5. R. Branzei & E. Gutiérrez & N. Llorca & J. Sánchez-Soriano, 2021. "Does it make sense to analyse a two-sided market as a multi-choice game?," Annals of Operations Research, Springer, vol. 301(1), pages 17-40, June.

    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. Trudeau, Christian, 2014. "Minimum cost spanning tree problems with indifferent agents," Games and Economic Behavior, Elsevier, vol. 84(C), pages 137-151.
    2. Bahel, Eric & Trudeau, Christian, 2019. "A cost sharing example in which subsidies are necessary for stability," Economics Letters, Elsevier, vol. 185(C).
    3. Streekstra, Leanne & Trudeau, Christian, 2020. "Stable source connection and assignment problems as multi-period shortest path problems," Discussion Papers on Economics 7/2020, University of Southern Denmark, Department of Economics.
    4. Trudeau, Christian & Vidal-Puga, Juan, 2017. "On the set of extreme core allocations for minimal cost spanning tree problems," Journal of Economic Theory, Elsevier, vol. 169(C), pages 425-452.
    5. 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.
    6. Bahel, Eric, 2021. "Hyperadditive games and applications to networks or matching problems," Journal of Economic Theory, Elsevier, vol. 191(C).
    7. 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.
    8. Daniel Jaume & Jordi Massó & Alejandro Neme, 2012. "The multiple-partners assignment game with heterogeneous sales and multi-unit demands: competitive equilibria," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 76(2), pages 161-187, October.
    9. Domènech, Gerard & Núñez, Marina, 2022. "Axioms for the optimal stable rules and fair-division rules in a multiple-partners job market," Games and Economic Behavior, Elsevier, vol. 136(C), pages 469-484.
    10. Eric Bahel & Christian Trudeau, 2013. "A discrete cost sharing model with technological cooperation," International Journal of Game Theory, Springer;Game Theory Society, vol. 42(2), pages 439-460, May.
    11. David Pérez-Castrillo & Marilda Sotomayor, 2017. "On the manipulability of competitive equilibrium rules in many-to-many buyer–seller markets," International Journal of Game Theory, Springer;Game Theory Society, vol. 46(4), pages 1137-1161, November.
    12. Eric Bahel & Christian Trudeau, 2016. "From spanning trees to arborescences: new and extended cost sharing solutions," Working Papers 1601, University of Windsor, Department of Economics.
    13. María Gómez-Rúa & Juan Vidal-Puga, 2017. "A monotonic and merge-proof rule in minimum cost spanning tree situations," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 63(3), pages 813-826, March.
    14. Balázs Sziklai & Tamás Fleiner & Tamás Solymosi, 2014. "On the Core of Directed Acyclic Graph Games," CERS-IE WORKING PAPERS 1418, Institute of Economics, Centre for Economic and Regional Studies.
    15. Sotomayor, Marilda, 2019. "Competition and cooperation in a two-sided matching market with replication," Journal of Economic Theory, Elsevier, vol. 183(C), pages 1030-1056.
    16. Eric Bahel & Christian Trudeau, 2017. "Minimum incoming cost rules for arborescences," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 49(2), pages 287-314, August.
    17. Juarez, Ruben & Ko, Chiu Yu & Xue, Jingyi, 2018. "Sharing sequential values in a network," Journal of Economic Theory, Elsevier, vol. 177(C), pages 734-779.
    18. Anne van den Nouweland, 2011. "Comments on: Cooperative games and cost allocation problems," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 19(1), pages 29-32, July.
    19. Norde, H.W., 2013. "The Degree and Cost Adjusted Folk Solution for Minimum Cost Spanning Tree Games," Discussion Paper 2013-039, Tilburg University, Center for Economic Research.
    20. Bergantiños, Gustavo & Moreno-Ternero, Juan D., 2020. "Allocating extra revenues from broadcasting sports leagues," Journal of Mathematical Economics, Elsevier, vol. 90(C), pages 65-73.

    More about this item

    Keywords

    Cost sharing; Stability; Production allocation; Returns to scale; Homogeneous prices;
    All these 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:spr:reecde:v:22:y:2018:i:1:d:10.1007_s10058-018-0209-0. 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.