IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v217y2012i2p270-277.html
   My bibliography  Save this article

Cost-sharing mechanisms for scheduling under general demand settings

Author

Listed:
  • Balireddi, Sindhura
  • Uhan, Nelson A.

Abstract

We investigate cost-sharing mechanisms for scheduling cost-sharing games. We assume that the demand is general—that is, each player can be allocated one of several levels of service. We show how to design mechanisms for these games that are weakly group strategyproof, approximately budget-balanced, and approximately efficient, using approximation algorithms for the underlying scheduling problems. We consider scheduling cost-sharing games in single machine, parallel machine, and concurrent open shop environments.

Suggested Citation

  • 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.
    • Handle: RePEc:eee:ejores:v:217:y:2012:i:2:p:270-277
    DOI: 10.1016/j.ejor.2011.09.030
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221711008587
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ejor.2011.09.030?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. W. L. Eastman & S. Even & I. M. Isaacs, 1964. "Bounds for the Optimal Scheduling of n Jobs on m Processors," Management Science, INFORMS, vol. 11(2), pages 268-279, November.
    2. Green, Jerry & Kohlberg, Elon & Laffont, Jean-Jacques, 1976. "Partial equilibrium approach to the free-rider problem," Journal of Public Economics, Elsevier, vol. 6(4), pages 375-394, November.
    3. 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.
    4. Archer, Aaron & Feigenbaum, Joan & Krishnamurthy, Arvind & Sami, Rahul & Shenker, Scott, 2004. "Approximation and collusion in multicast cost sharing," Games and Economic Behavior, Elsevier, vol. 47(1), pages 36-71, April.
    5. HervÊ Moulin, 1999. "Incremental cost sharing: Characterization by coalition strategy-proofness," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 16(2), pages 279-320.
    6. Mehta, Aranyak & Roughgarden, Tim & Sundararajan, Mukund, 2009. "Beyond Moulin mechanisms," Games and Economic Behavior, Elsevier, vol. 67(1), pages 125-155, September.
    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. Lin Jiang & Yong Wang & Dongmei Liu, 2016. "Logistics cost sharing in supply chains involving a third-party logistics provider," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 24(1), pages 207-230, March.

    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. 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.
    2. Georgiou, Konstantinos & Swamy, Chaitanya, 2019. "Black-box reductions for cost-sharing mechanism design," Games and Economic Behavior, Elsevier, vol. 113(C), pages 17-37.
    3. Juarez, Ruben, 2013. "Group strategyproof cost sharing: The role of indifferences," Games and Economic Behavior, Elsevier, vol. 82(C), pages 218-239.
    4. Hagen, Martin, 2023. "Collusion-proof mechanisms for multi-unit procurement," Games and Economic Behavior, Elsevier, vol. 138(C), pages 281-298.
    5. Michel Le Breton & Juan Moreno-Ternero & Alexei Savvateev & Shlomo Weber, 2013. "Stability and fairness in models with a multiple membership," International Journal of Game Theory, Springer;Game Theory Society, vol. 42(3), pages 673-694, August.
    6. 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.
    7. 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.
    8. 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.
    9. 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.
    10. Shipra Agrawal & Yichuan Ding & Amin Saberi & Yinyu Ye, 2012. "Price of Correlations in Stochastic Optimization," Operations Research, INFORMS, vol. 60(1), pages 150-162, February.
    11. Hervé Moulin & Yves Sprumont, 2007. "Fair allocation of production externalities : recent results," Revue d'économie politique, Dalloz, vol. 117(1), pages 7-36.
    12. 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.
    13. Hu, Shichun & Dessouky, Maged M. & Uhan, Nelson A. & Vayanos, Phebe, 2021. "Cost-sharing mechanism design for ride-sharing," Transportation Research Part B: Methodological, Elsevier, vol. 150(C), pages 410-434.
    14. Jarman, Felix & Meisner, Vincent, 2017. "Ex-post optimal knapsack procurement," Journal of Economic Theory, Elsevier, vol. 171(C), pages 35-63.
    15. Schwartz, Jesse A. & Wen, Quan, 2018. "A subsidized Vickrey auction for cost sharing," Journal of Mathematical Economics, Elsevier, vol. 77(C), pages 32-38.
    16. Ruben Juarez & Rajnish Kumar, 2013. "Implementing efficient graphs in connection networks," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 54(2), pages 359-403, October.
    17. Harks, Tobias & von Falkenhausen, Philipp, 2014. "Optimal cost sharing for capacitated facility location games," European Journal of Operational Research, Elsevier, vol. 239(1), pages 187-198.
    18. Archer, Aaron & Feigenbaum, Joan & Krishnamurthy, Arvind & Sami, Rahul & Shenker, Scott, 2004. "Approximation and collusion in multicast cost sharing," Games and Economic Behavior, Elsevier, vol. 47(1), pages 36-71, April.
    19. Kazuhiko Hashimoto & Hiroki Saitoh, 2016. "Strategy-proof rules for an excludable public good," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 46(4), pages 749-766, April.
    20. Philipp von Falkenhausen & Tobias Harks, 2013. "Optimal Cost Sharing for Resource Selection Games," Mathematics of Operations Research, INFORMS, vol. 38(1), pages 184-208, February.

    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:eee:ejores:v:217:y:2012:i:2:p:270-277. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    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.