IDEAS home Printed from https://ideas.repec.org/a/spr/jogath/v47y2018i3d10.1007_s00182-018-0636-8.html
   My bibliography  Save this article

Consistency requirements and pattern methods in cost sharing problems with technological cooperation

Author

Listed:
  • Eric Bahel

    (Virginia Polytechnic Institute and State University)

  • Christian Trudeau

    (University of Windsor)

Abstract

Using the discrete cost sharing model with technological cooperation, we investigate the implications of the requirement that demand manipulations must not affect the agents’ shares. In a context where the enforcing authority cannot prevent agents (who seek to reduce their cost shares) from splitting or merging their demands, the cost sharing methods used must make such artifices unprofitable. The paper introduces a family of rules that are immune to these demand manipulations, the pattern methods. Our main result is the characterization of these methods using the above requirement. For each one of these methods, the associated pattern indicates how to combine the technologies in order to meet the agents’ demands. Within this family, two rules stand out: the public Aumann–Shapley rule, which never rewards technological cooperation; and the private Aumann–Shapley rule, which always rewards technology providers. Fairness requirements imposing natural bounds (for the technological rent) allow to further differentiate these two rules.

Suggested Citation

  • 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.
  • Handle: RePEc:spr:jogath:v:47:y:2018:i:3:d:10.1007_s00182-018-0636-8
    DOI: 10.1007/s00182-018-0636-8
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s00182-018-0636-8
    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/s00182-018-0636-8?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. Yves Sprumont, 2005. "On the Discrete Version of the Aumann-Shapley Cost-Sharing Method," Econometrica, Econometric Society, vol. 73(5), pages 1693-1712, September.
    2. Yves Sprumont, 2008. "Nearly serial sharing methods," International Journal of Game Theory, Springer;Game Theory Society, vol. 37(2), pages 155-184, June.
    3. Sudipto Bhattacharya & Claude d’Aspremont & Sergei Guriev & Debapriya Sen & Yair Tauman, 2014. "Cooperation in R&D: Patenting, Licensing, and Contracting," International Series in Operations Research & Management Science, in: Kalyan Chatterjee & William Samuelson (ed.), Game Theory and Business Applications, edition 2, chapter 0, pages 265-286, Springer.
    4. 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.
    5. Louis J. Billera & David C. Heath & Joseph Raanan, 1978. "Internal Telephone Billing Rates—A Novel Application of Non-Atomic Game Theory," Operations Research, INFORMS, vol. 26(6), pages 956-965, December.
    6. Calvo, Emilio & Santos, Juan Carlos, 2000. "A value for multichoice games," Mathematical Social Sciences, Elsevier, vol. 40(3), pages 341-354, November.
    7. Dov Samet & Yair Tauman & Israel Zang, 1984. "An Application of the Aumann-Shapley Prices for Cost Allocation in Transportation Problems," Mathematics of Operations Research, INFORMS, vol. 9(1), pages 25-42, February.
    8. Moulin, Herve & Shenker, Scott, 1999. "Distributive and Additive Costsharing of an Homogeneous Good," Games and Economic Behavior, Elsevier, vol. 27(2), pages 299-330, May.
    9. Hervé Moulin & Yves Sprumont, 2007. "Fair allocation of production externalities : recent results," Revue d'économie politique, Dalloz, vol. 117(1), pages 7-36.
    10. Moulin, Herve, 1995. "On Additive Methods to Share Joint Costs," Mathematical Social Sciences, Elsevier, vol. 30(1), pages 98-99, August.
    11. Friedman, Eric & Moulin, Herve, 1999. "Three Methods to Share Joint Costs or Surplus," Journal of Economic Theory, Elsevier, vol. 87(2), pages 275-312, August.
    12. 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.
    13. Rosenthal, Edward C., 2013. "Shortest path games," European Journal of Operational Research, Elsevier, vol. 224(1), pages 132-140.
    14. Wang, YunTong, 1999. "The additivity and dummy axioms in the discrete cost sharing model," Economics Letters, Elsevier, vol. 64(2), pages 187-192, August.
    15. Josh Lerner & Jean Tirole, 2004. "Efficient Patent Pools," American Economic Review, American Economic Association, vol. 94(3), pages 691-711, June.
    16. Layne-Farrar, Anne & Lerner, Josh, 2011. "To join or not to join: Examining patent pool participation and rent sharing rules," International Journal of Industrial Organization, Elsevier, vol. 29(2), pages 294-303, March.
    17. 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.
    18. Petrosjan, Leon & Zaccour, Georges, 2003. "Time-consistent Shapley value allocation of pollution cost reduction," Journal of Economic Dynamics and Control, Elsevier, vol. 27(3), pages 381-398, January.
    19. Yair Tauman & Naoki Watanabe, 2007. "The Shapley Value of a Patent Licensing Game: the Asymptotic Equivalence to Non-cooperative Results," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 30(1), pages 135-149, January.
    20. Kishimoto, Shin & Watanabe, Naoki & Muto, Shigeo, 2011. "Bargaining outcomes in patent licensing: Asymptotic results in a general Cournot market," Mathematical Social Sciences, Elsevier, vol. 61(2), pages 114-123, March.
    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. Bahel, Eric & Haller, Hans, 2013. "Cycles with undistinguished actions and extended Rock–Paper–Scissors games," Economics Letters, Elsevier, vol. 120(3), pages 588-591.
    2. Hervé Moulin & Yves Sprumont, 2007. "Fair allocation of production externalities : recent results," Revue d'économie politique, Dalloz, vol. 117(1), pages 7-36.
    3. Albizuri, M.J. & Díez, H. & Sarachu, A., 2014. "Monotonicity and the Aumann–Shapley cost-sharing method in the discrete case," European Journal of Operational Research, Elsevier, vol. 238(2), pages 560-565.
    4. Moulin, Herve & Sprumont, Yves, 2006. "Responsibility and cross-subsidization in cost sharing," Games and Economic Behavior, Elsevier, vol. 55(1), pages 152-188, April.
    5. David Lowing & Kevin Techer, 2022. "Marginalism, egalitarianism and efficiency in multi-choice games," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 59(4), pages 815-861, November.
    6. 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.
    7. Trudeau, Christian, 2014. "Minimum cost spanning tree problems with indifferent agents," Games and Economic Behavior, Elsevier, vol. 84(C), pages 137-151.
    8. David Lowing & Kevin Techer, 2021. "Marginalism, Egalitarianism and E ciency in Multi-Choice Games," Working Papers halshs-03334056, HAL.
    9. Moulin, Herve & Sprumont, Yves, 2005. "On demand responsiveness in additive cost sharing," Journal of Economic Theory, Elsevier, vol. 125(1), pages 1-35, November.
    10. Moulin, Herve, 2002. "Axiomatic cost and surplus sharing," Handbook of Social Choice and Welfare, in: K. J. Arrow & A. K. Sen & K. Suzumura (ed.), Handbook of Social Choice and Welfare, edition 1, volume 1, chapter 6, pages 289-357, Elsevier.
    11. 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.
    12. 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.
    13. Yves Sprumont, 2008. "Nearly serial sharing methods," International Journal of Game Theory, Springer;Game Theory Society, vol. 37(2), pages 155-184, June.
    14. 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.
    15. Boonen, Tim J. & Tsanakas, Andreas & Wüthrich, Mario V., 2017. "Capital allocation for portfolios with non-linear risk aggregation," Insurance: Mathematics and Economics, Elsevier, vol. 72(C), pages 95-106.
    16. 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.
    17. Yves Sprumont, 2010. "An Axiomatization of the Serial Cost-Sharing Method," Econometrica, Econometric Society, vol. 78(5), pages 1711-1748, September.
    18. Sprumont, Yves, 2000. "Coherent Cost-Sharing Rules," Games and Economic Behavior, Elsevier, vol. 33(1), pages 126-144, October.
    19. Calvo, E. & Santos, J. C., 2001. "Prices in Mixed Cost Allocation Problems," Games and Economic Behavior, Elsevier, vol. 37(2), pages 243-258, November.
    20. Friedman, Eric & Moulin, Herve, 1999. "Three Methods to Share Joint Costs or Surplus," Journal of Economic Theory, Elsevier, vol. 87(2), pages 275-312, August.

    More about this item

    Keywords

    Cost sharing; Demand manipulations; Flow method; Production pattern;
    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:jogath:v:47:y:2018:i:3:d:10.1007_s00182-018-0636-8. 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.