IDEAS home Printed from https://ideas.repec.org/a/kap/netnom/v12y2011i1p61-75.html
   My bibliography  Save this article

Pricing multi-class network services using the Shapley Value

Author

Listed:
  • Fan Zhang
  • Pramode Verma

Abstract

No abstract is available for this item.

Suggested Citation

  • Fan Zhang & Pramode Verma, 2011. "Pricing multi-class network services using the Shapley Value," Netnomics, Springer, vol. 12(1), pages 61-75, April.
    • Handle: RePEc:kap:netnom:v:12:y:2011:i:1:p:61-75
    DOI: 10.1007/s11066-011-9058-5
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s11066-011-9058-5
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s11066-011-9058-5?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. Maniquet, Francois, 2003. "A characterization of the Shapley value in queueing problems," Journal of Economic Theory, Elsevier, vol. 109(1), pages 90-103, March.
    2. Debasis Mishra & Bharath Rangarajan, 2007. "Cost sharing in a job scheduling problem," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 29(3), pages 369-382, October.
    3. Roth, Ae & Verrecchia, Re, 1979. "Shapley Value As Applied To Cost Allocation - Reinterpretation," Journal of Accounting Research, Wiley Blackwell, vol. 17(1), pages 295-303.
    4. Moulin, Herve, 2004. "On Scheduling Fees to Prevent Merging, Splitting and Transferring of Jobs," Working Papers 2004-04, Rice University, Department of Economics.
    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. Isabel Amigo & Pablo Belzarena & Sandrine Vaton, 2013. "A pricing scheme for QoS in overlay networks based on first-price auctions and reimbursement," Netnomics, Springer, vol. 14(1), pages 69-93, November.

    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. Debasis Mishra & Bharath Rangarajan, 2007. "Cost sharing in a job scheduling problem," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 29(3), pages 369-382, October.
    2. Cheng‐Kuang Wu & Yi‐Ming Chen & Dachrahn Wu & Ching‐Lin Chi, 2020. "A Game Theory Approach for Assessment of Risk and Deployment of Police Patrols in Response to Criminal Activity in San Francisco," Risk Analysis, John Wiley & Sons, vol. 40(3), pages 534-549, March.
    3. René Brink & Youngsub Chun, 2012. "Balanced consistency and balanced cost reduction for sequencing problems," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 38(3), pages 519-529, March.
    4. Ju, Yuan & Chun, Youngsub & van den Brink, René, 2014. "Auctioning and selling positions: A non-cooperative approach to queueing conflicts," Journal of Economic Theory, Elsevier, vol. 153(C), pages 33-45.
    5. Moulin, Herve, 2005. "Split-Proof Probabilistic Scheduling," Working Papers 2004-06, Rice University, Department of Economics.
    6. Alex Gershkov & Paul Schweinzer, 2010. "When queueing is better than push and shove," International Journal of Game Theory, Springer;Game Theory Society, vol. 39(3), pages 409-430, July.
    7. Banerjee, Sreoshi, 2024. "On identifying efficient, fair and stable allocations in "generalized" sequencing games," MPRA Paper 120188, University Library of Munich, Germany.
    8. Andreas S. Schulz & Nelson A. Uhan, 2010. "Sharing Supermodular Costs," Operations Research, INFORMS, vol. 58(4-part-2), pages 1051-1056, August.
    9. Demetrescu, Camil & Lupia, Francesco & Mendicelli, Angelo & Ribichini, Andrea & Scarcello, Francesco & Schaerf, Marco, 2019. "On the Shapley value and its application to the Italian VQR research assessment exercise," Journal of Informetrics, Elsevier, vol. 13(1), pages 87-104.
    10. Banerjee, Sreoshi, 2023. "Stability and fairness in sequencing games: optimistic approach and pessimistic scenarios," MPRA Paper 118680, University Library of Munich, Germany.
    11. Kazuhiko Hashimoto & Hiroki Saitoh, 2008. "Strategy-Proof and Anonymous Rule in Queueing Problems: A Relationship between Equity and Efficiency," Discussion Papers in Economics and Business 08-17, Osaka University, Graduate School of Economics.
    12. Kazuhiko Hashimoto & Hiroki Saitoh, 2012. "Strategy-proof and anonymous rule in queueing problems: a relationship between equity and efficiency," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 38(3), pages 473-480, March.
    13. Sylvain Béal & Marc Deschamps & Catherine Refait-Alexandre & Guillaume Sekli, 2022. "Early contributors, cooperation and fair rewards in crowdfunding," Working Papers hal-04222321, HAL.
    14. Nan Zhang & Heng Xu, 2024. "Fairness of Ratemaking for Catastrophe Insurance: Lessons from Machine Learning," Information Systems Research, INFORMS, vol. 35(2), pages 469-488, June.
    15. Sylvain Béal & Stéphane Gonzalez & Philippe Solal & Peter Sudhölter, 2023. "Axiomatic characterizations of the core without consistency," International Journal of Game Theory, Springer;Game Theory Society, vol. 52(3), pages 687-701, September.
    16. Chun, Youngsub & Yengin, Duygu, 2017. "Welfare lower bounds and strategy-proofness in the queueing problem," Games and Economic Behavior, Elsevier, vol. 102(C), pages 462-476.
    17. Youngsub Chun & Manipushpak Mitra & Suresh Mutuswami, 2017. "Reordering an existing queue," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 49(1), pages 65-87, June.
    18. Sylvain Béal & Sylvain Ferrières & Philippe Solal, 2022. "The priority value for cooperative games with a priority structure," International Journal of Game Theory, Springer;Game Theory Society, vol. 51(2), pages 431-450, June.
    19. Béal, Sylvain & Rémila, Eric & Solal, Philippe, 2010. "On the number of blocks required to access the core," MPRA Paper 26578, University Library of Munich, Germany.
    20. René Brink & Ilya Katsev & Gerard Laan, 2011. "Axiomatizations of two types of Shapley values for games on union closed systems," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 47(1), pages 175-188, May.

    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:kap:netnom:v:12:y:2011:i:1:p:61-75. 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.