Skip to main content
SpringerLink
Log in

The PoA of Scheduling Game with Machine Activation Costs

  • Conference paper
Frontiers in Algorithmics (FAW 2014)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 8497))

Included in the following conference series:

Abstract

In this paper, we study the scheduling game with machine activation costs. A set of jobs is to be processed on identical parallel machines. The number of machines available is unlimited, and an activation cost is needed whenever a machine is activated in order to process jobs. Each job chooses a machine on which it wants to be processed. The cost of a job is the sum of the load of the machine it chooses and its shared activated cost. The social cost is the total cost of all jobs. Representing PoA as a function of the number of jobs, we get the tight bound of PoA. Representing PoA as a function of the smallest processing time of jobs, improved lower and upper bound are also given.

Supported by the National Natural Science Foundation of China (10971191, 11271324), Zhejiang Provincial Natural Science Foundation of China (LR12A01001) and Fundamental Research Funds for the Central Universities.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Berenbrink, P., Goldberg, L., Goldberg, P., Martin, R.: Utilitarian resource assignment. Journal of Discrete Algorithm 4, 567–587 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  2. Chen, B., Gürel, S.: Resource allocation games of utilitarian social objectives. Journal of Scheduling 15, 157–164 (2012)

    Article  MATH  MathSciNet  Google Scholar 

  3. Czumaj, A., Vöcking, B.: Tight bounds for worst-case equilibria. ACM Transactions on Algorithms 3(4) (2007)

    Google Scholar 

  4. Epstein, L.: Equilibria for two parallel links: the strong price of anarchy versus the price of anarchy. Acta Informatica 47, 375–389 (2010)

    Article  MATH  MathSciNet  Google Scholar 

  5. Epstein, L., van Stee, R.: The price of anarchy on uniformly related machines revisited. Information and Computation 212, 37–54 (2012)

    Article  MATH  MathSciNet  Google Scholar 

  6. Feldmann, R., Gairing, M., Lücking, T., Monien, B., Rode, M.: Nashification and the coordination ratio for a selfish routing game. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol. 2719, pp. 514–526. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  7. Feldman, M., Tamir, T.: Conflicting congestion effects in resource allocation games. Operations Research 60, 529–540 (2012)

    Article  MATH  MathSciNet  Google Scholar 

  8. Fotakis, D., Kontogiannis, S., Koutsoupias, E., Mavronicolas, M., Spirakis, P.: The structure and complexity of Nash equilibria for a selfish routing game. Theoretical Computer Science 410, 3305–3326 (2009)

    Article  MATH  MathSciNet  Google Scholar 

  9. Koutsoupias, E., Papadimitriou, C.H.: Worst-case equilibria. Computer Science Review 3, 65–69 (2009)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, Zhejiang University, Hangzhou, 310027, P.R. China

    Ling Lin, Yujie Yan, Xing He & Zhiyi Tan

  2. School of Computer & Computing Science, Zhejiang University City College, Hangzhou, 310015, P.R. China

    Ling Lin

  3. Department of Fundamental Education, Ningbo Institute of Technology, Zhejiang University, Ningbo, 315100, P.R. China

    Ling Lin

Authors
  1. Ling Lin
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yujie Yan
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Xing He
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Zhiyi Tan
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science and Engineering, Texas A&M University, USA

    Jianer Chen

  2. Cornell University, USA

    John E. Hopcroft

  3. School of Information Science and Engineering, Central South University, 410083, Changsha, China

    Jianxin Wang

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Lin, L., Yan, Y., He, X., Tan, Z. (2014). The PoA of Scheduling Game with Machine Activation Costs. In: Chen, J., Hopcroft, J.E., Wang, J. (eds) Frontiers in Algorithmics. FAW 2014. Lecture Notes in Computer Science, vol 8497. Springer, Cham. https://doi.org/10.1007/978-3-319-08016-1_17

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-08016-1_17

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-08015-4

  • Online ISBN: 978-3-319-08016-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation