IDEAS home Printed from https://ideas.repec.org/a/eee/matsoc/v94y2018icp13-18.html
   My bibliography  Save this article

Efficiency analysis with respect to the unit cost objectives in scheduling games

Author

Listed:
  • Li, Song-Song

Abstract

We study two models of scheduling games: load-balancing games with and without activation costs, respectively. The inefficiency of equilibria is measured with two new and more reasonable social objectives: the maximum and the average of all players’ unit costs, respectively. For each game problem and each social objective, we provide parametric bounds on the PoA and the PoS and conclude that the loss of efficiency of equilibria with the new unit cost objectives is even more severe than that with the traditional objectives which focus on the costs of the players.

Suggested Citation

  • Li, Song-Song, 2018. "Efficiency analysis with respect to the unit cost objectives in scheduling games," Mathematical Social Sciences, Elsevier, vol. 94(C), pages 13-18.
    • Handle: RePEc:eee:matsoc:v:94:y:2018:i:c:p:13-18
    DOI: 10.1016/j.mathsocsci.2018.04.003
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0165489618300337
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.mathsocsci.2018.04.003?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. Michal Feldman & Tami Tamir, 2012. "Conflicting Congestion Effects in Resource Allocation Games," Operations Research, INFORMS, vol. 60(3), pages 529-540, June.
    2. José R. Correa & Andreas S. Schulz & Nicolás E. Stier-Moses, 2004. "Selfish Routing in Capacitated Networks," Mathematics of Operations Research, INFORMS, vol. 29(4), pages 961-976, November.
    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. Hoang, Nam H. & Vu, Hai L. & Lo, Hong K., 2018. "An informed user equilibrium dynamic traffic assignment problem in a multiple origin-destination stochastic network," Transportation Research Part B: Methodological, Elsevier, vol. 115(C), pages 207-230.
    2. Simai He & Jay Sethuraman & Xuan Wang & Jiawei Zhang, 2017. "A NonCooperative Approach to Cost Allocation in Joint Replenishment," Operations Research, INFORMS, vol. 65(6), pages 1562-1573, December.
    3. Daron Acemoglu & Asuman Ozdaglar, 2005. "Competition and Efficiency in Congested Markets," NBER Working Papers 11201, National Bureau of Economic Research, Inc.
    4. 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.
    5. E. Nikolova & N. E. Stier-Moses, 2014. "A Mean-Risk Model for the Traffic Assignment Problem with Stochastic Travel Times," Operations Research, INFORMS, vol. 62(2), pages 366-382, April.
    6. Raimondo, Roberto, 2020. "Pathwise smooth splittable congestion games and inefficiency," Journal of Mathematical Economics, Elsevier, vol. 86(C), pages 15-23.
    7. Gur, Yonatan & Iancu, Dan & Warnes, Xavier, 2020. "Value Loss in Allocation Systems with Provider Guarantees," Research Papers 3813, Stanford University, Graduate School of Business.
    8. Morales, Dolores Romero & Vermeulen, Dries, 2009. "Existence of equilibria in a decentralized two-level supply chain," European Journal of Operational Research, Elsevier, vol. 197(2), pages 642-658, September.
    9. Parilina, Elena & Sedakov, Artem & Zaccour, Georges, 2017. "Price of anarchy in a linear-state stochastic dynamic game," European Journal of Operational Research, Elsevier, vol. 258(2), pages 790-800.
    10. Vincenzo Bonifaci & Tobias Harks & Guido Schäfer, 2010. "Stackelberg Routing in Arbitrary Networks," Mathematics of Operations Research, INFORMS, vol. 35(2), pages 330-346, May.
    11. Deepanshu Vasal & Randall Berry, 2022. "Master Equation for Discrete-Time Stackelberg Mean Field Games with single leader," Papers 2201.05959, arXiv.org.
    12. Alessandro Arlotto & Andrew E. Frazelle & Yehua Wei, 2019. "Strategic Open Routing in Service Networks," Management Science, INFORMS, vol. 65(2), pages 735-750, February.
    13. José R. Correa & Nicolás Figueroa & Nicolás E. Stier-Moses, 2008. "Pricing with markups in industries with increasing marginal costs," Documentos de Trabajo 256, Centro de Economía Aplicada, Universidad de Chile.
    14. Chen, Qianqian & Lin, Ling & Tan, Zhiyi & Yan, Yujie, 2017. "Coordination mechanisms for scheduling games with proportional deterioration," European Journal of Operational Research, Elsevier, vol. 263(2), pages 380-389.
    15. Gaëtan Fournier & Marco Scarsini, 2014. "Hotelling Games on Networks: Efficiency of Equilibria," Documents de travail du Centre d'Economie de la Sorbonne 14033, Université Panthéon-Sorbonne (Paris 1), Centre d'Economie de la Sorbonne.
    16. Correa, José R. & Schulz, Andreas S. & Stier-Moses, Nicolás E., 2008. "A geometric approach to the price of anarchy in nonatomic congestion games," Games and Economic Behavior, Elsevier, vol. 64(2), pages 457-469, November.
    17. Pieter Kleer, 2023. "Price of anarchy for parallel link networks with generalized mean objective," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 45(1), pages 27-55, March.
    18. Andrea Manno & Laura Palagi & Simone Sagratella, 2018. "Parallel decomposition methods for linearly constrained problems subject to simple bound with application to the SVMs training," Computational Optimization and Applications, Springer, vol. 71(1), pages 115-145, September.
    19. Roberto Cominetti & José R. Correa & Nicolás E. Stier-Moses, 2009. "The Impact of Oligopolistic Competition in Networks," Operations Research, INFORMS, vol. 57(6), pages 1421-1437, December.
    20. Marco Scarsini & Tristan Tomala, 2012. "Repeated congestion games with bounded rationality," International Journal of Game Theory, Springer;Game Theory Society, vol. 41(3), pages 651-669, August.

    More about this item

    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:eee:matsoc:v:94:y:2018:i:c:p:13-18. 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/inca/505565 .

    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.