IDEAS home Printed from https://ideas.repec.org/a/spr/grdene/v29y2020i6d10.1007_s10726-020-09693-z.html
   My bibliography  Save this article

Incentive Compatible Cost Sharing of a Coalition Initiative with Probabilistic Inspection and Penalties for Misrepresentation

Author

Listed:
  • William N. Caballero

    (Air Force Institute of Technology)

  • Brian J. Lunday

    (Air Force Institute of Technology)

  • Darryl K. Ahner

    (Air Force Institute of Technology)

Abstract

This research proposes cost sharing mechanisms such that payments for a coalition initiative are allocated among players based on their honest valuations of the initiative, probabilistic inspection efforts, and deception penalties. Specifically, we develop a set of multiobjective, nonlinear optimization problem formulations that alternatively impose Bayesian incentive compatible, strategyproof, or group strategyproof mechanisms with generalized cost sharing and penalty functions that can be tailored to specific applications. Any feasible solution to these problems corresponds to a Bayesian game with stochastic payoffs wherein a collectively honest declaration is a Bayes–Nash equilibrium, a Nash equilibrium in dominant strategies, or a collusion resistant Nash equilibrium, respectively, and wherein an optimal solution considers the central authority’s relative priorities between inspection and penalization. In addition to this general framework, we introduce special cases having specific cost sharing and penalty functions such that the set of mechanisms are budget-balanced-in-equilibrium and proportional by design. The convexity of the resulting mathematical programs are examined, and formulation size reductions due to constraint redundancy analyses are presented. The Pareto fronts associated with each multiobjective optimization problem are assessed, as are computer memory limitations. Finally, an experiment considers the clustering of available valuations and the player probability distributions over them to examine their effects.

Suggested Citation

  • William N. Caballero & Brian J. Lunday & Darryl K. Ahner, 2020. "Incentive Compatible Cost Sharing of a Coalition Initiative with Probabilistic Inspection and Penalties for Misrepresentation," Group Decision and Negotiation, Springer, vol. 29(6), pages 1021-1055, December.
  • Handle: RePEc:spr:grdene:v:29:y:2020:i:6:d:10.1007_s10726-020-09693-z
    DOI: 10.1007/s10726-020-09693-z
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10726-020-09693-z
    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/s10726-020-09693-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. Hervé Moulin & Scott Shenker, 2001. "Strategyproof sharing of submodular costs:budget balance versus efficiency," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 18(3), pages 511-533.
    2. Elchanan Ben-Porath & Eddie Dekel & Barton L. Lipman, 2014. "Optimal Allocation with Costly Verification," American Economic Review, American Economic Association, vol. 104(12), pages 3779-3813, December.
    3. Xiang-Yang Li & Zheng Sun & Weizhao Wang & Wei Lou, 2010. "Cost sharing and strategyproof mechanisms for set cover games," Journal of Combinatorial Optimization, Springer, vol. 20(3), pages 259-284, October.
    4. Ian Ball & Deniz Kattwinkel, 2019. "Probabilistic Verification in Mechanism Design," Papers 1908.05556, arXiv.org, revised Jul 2024.
    5. Ian Ball & Deniz Kattwinkel, 2019. "Probabilistic Verification in Mechanism Design," CRC TR 224 Discussion Paper Series crctr224_2019_124, University of Bonn and University of Mannheim, Germany.
    6. Markos Epitropou & Rakesh Vohra, 2019. "Dynamic Mechanisms with Verification," PIER Working Paper Archive 19-002, Penn Institute for Economic Research, Department of Economics, University of Pennsylvania.
    7. Edna Tusak Loehman & Richard Kiser & Stephen J. Rassenti, 2014. "Cost Share Adjustment Processes for Cooperative Group Decisions About Shared Goods: A Design Approach," Group Decision and Negotiation, Springer, vol. 23(5), pages 1085-1126, September.
    8. Mehta, Aranyak & Roughgarden, Tim & Sundararajan, Mukund, 2009. "Beyond Moulin mechanisms," Games and Economic Behavior, Elsevier, vol. 67(1), pages 125-155, September.
    9. Vasilis Gkatzelis & Konstantinos Kollias & Tim Roughgarden, 2016. "Optimal Cost-Sharing in General Resource Selection Games," Operations Research, INFORMS, vol. 64(6), pages 1230-1238, December.
    10. Bag, Parimal Kanti, 1997. "Public Goods Provision: Applying Jackson-Moulin Mechanism for Restricted Agent Characteristics," Journal of Economic Theory, Elsevier, vol. 73(2), pages 460-472, April.
    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. Juarez, Ruben, 2013. "Group strategyproof cost sharing: The role of indifferences," Games and Economic Behavior, Elsevier, vol. 82(C), pages 218-239.
    2. Balireddi, Sindhura & Uhan, Nelson A., 2012. "Cost-sharing mechanisms for scheduling under general demand settings," European Journal of Operational Research, Elsevier, vol. 217(2), pages 270-277.
    3. Helmut Bester & Matthias Lang & Jianpei Li, 2021. "Signaling versus Auditing," RAND Journal of Economics, RAND Corporation, vol. 52(4), pages 859-883, December.
    4. Hagen, Martin, 2023. "Collusion-proof mechanisms for multi-unit procurement," Games and Economic Behavior, Elsevier, vol. 138(C), pages 281-298.
    5. Matthias Lang, 2020. "Mechanism Design with Narratives," CESifo Working Paper Series 8502, CESifo.
    6. Dobzinski, Shahar & Mehta, Aranyak & Roughgarden, Tim & Sundararajan, Mukund, 2018. "Is Shapley cost sharing optimal?," Games and Economic Behavior, Elsevier, vol. 108(C), pages 130-138.
    7. Hashimoto, Kazuhiko & Saitoh, Hiroki, 2015. "Strategy-proof cost sharing under increasing returns: Improvement of the supremal welfare loss," Games and Economic Behavior, Elsevier, vol. 89(C), pages 101-121.
    8. Minghui Lai & Weili Xue & Qian Hu, 2019. "An Ascending Auction for Freight Forwarder Collaboration in Capacity Sharing," Transportation Science, INFORMS, vol. 53(4), pages 1175-1195, July.
    9. Jesse A. Schwartz & Quan Wen, 2018. "Robust trading mechanisms with budget surplus and partial trade," Economic Theory Bulletin, Springer;Society for the Advancement of Economic Theory (SAET), vol. 6(2), pages 201-208, October.
    10. Georgiou, Konstantinos & Swamy, Chaitanya, 2019. "Black-box reductions for cost-sharing mechanism design," Games and Economic Behavior, Elsevier, vol. 113(C), pages 17-37.
    11. Zhang, Wentao & Uhan, Nelson A. & Dessouky, Maged & Toriello, Alejandro, 2018. "Moulin mechanism design for freight consolidation," Transportation Research Part B: Methodological, Elsevier, vol. 116(C), pages 141-162.
    12. Schwartz, Jesse A. & Wen, Quan, 2018. "A subsidized Vickrey auction for cost sharing," Journal of Mathematical Economics, Elsevier, vol. 77(C), pages 32-38.
    13. Yi, Jianxin & Li, Yong, 2016. "A general impossibility theorem and its application to individual rights," Mathematical Social Sciences, Elsevier, vol. 81(C), pages 79-86.
    14. 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.
    15. Tobias Harks & Martin Hoefer & Anja Schedel & Manuel Surek, 2021. "Efficient Black-Box Reductions for Separable Cost Sharing," Mathematics of Operations Research, INFORMS, vol. 46(1), pages 134-158, February.
    16. Haris Aziz & Sujit Gujar & Manisha Padala & Mashbat Suzuki & Jeremy Vollen, 2022. "Coordinating Monetary Contributions in Participatory Budgeting," Papers 2206.05966, arXiv.org, revised Feb 2023.
    17. Tami Tamir, 2023. "Cost-sharing games in real-time scheduling systems," International Journal of Game Theory, Springer;Game Theory Society, vol. 52(1), pages 273-301, March.
    18. Dütting, Paul & Talgam-Cohen, Inbal & Roughgarden, Tim, 2017. "Modularity and greed in double auctions," LSE Research Online Documents on Economics 83199, London School of Economics and Political Science, LSE Library.
    19. Alfredo Valencia-Toledo & Juan Vidal-Puga, 2020. "Reassignment-proof rules for land rental problems," International Journal of Game Theory, Springer;Game Theory Society, vol. 49(1), pages 173-193, March.
    20. Hervé Moulin & Yves Sprumont, 2007. "Fair allocation of production externalities : recent results," Revue d'économie politique, Dalloz, vol. 117(1), pages 7-36.

    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:grdene:v:29:y:2020:i:6:d:10.1007_s10726-020-09693-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.