Skip to main content
SpringerLink
Log in

Price of Anarchy for Machines Models

  • Reference work entry
  • First Online:
Book cover Encyclopedia of Algorithms

  • 94 Accesses

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 1,599.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 1,999.99
Price excludes VAT (USA)
  • Durable hardcover 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

Recommended Reading

  1. Awerbuch B, Azar Y, Richter Y, Tsur D (2006) Tradeoffs in worst-case equilibria. Theor Comput Sci 361(2–3):200–209

    Article  MathSciNet  MATH  Google Scholar 

  2. Christodoulou G, Koutsoupias E, Nanavati A (2009) Coordination mechanisms. Theor Comput Sci 410(36):3327–3336

    Article  MathSciNet  MATH  Google Scholar 

  3. Czumaj A (2004) Selfish routing on the Internet. In: Leung J (ed) Handbook of scheduling: algorithms, models, and performance analysis. CRC, Boca Raton

    Google Scholar 

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

    Google Scholar 

  5. Czumaj A, Krysta P, Vöcking B (2010) Selfish traffic allocation for server farms. SIAM J Comput 39(5):1957–1987

    Article  MathSciNet  MATH  Google Scholar 

  6. Fischer S, Vöcking B (2007) On the structure and complexity of worst-case equilibria. Theor Comput Sci 378(2):165–174

    Article  MathSciNet  MATH  Google Scholar 

  7. Fotakis D, Kontogiannis S, Koutsoupias E, Mavronicolas M, Spirakis P (2009) The structure and complexity of Nash equilibria for a selfish routing game. Theor Comput Sci 410(36):3305–3326

    Article  MathSciNet  MATH  Google Scholar 

  8. Gairing M, Lücking T, Mavronicolas M, Monien B (2006) The price of anarchy for polynomial social cost. Theor Comput Sci 369(1–3):116–135

    Article  MathSciNet  MATH  Google Scholar 

  9. Gonnet G (1981) Expected length of the longest probe sequence in hash code searching. J Assoc Comput Mach 28(2):289–304

    Article  MathSciNet  MATH  Google Scholar 

  10. Koutsoupias E, Papadimitriou CH (1999) Worst-case equilibria. In: Proceeding of the 16th annual symposium on theoretical aspects of computer science (STACS), Trier, pp 404–413

    Google Scholar 

  11. Koutsoupias E, Mavronicolas M, Spirakis P (2003) Approximate equilibria and ball fusion. Theory Comput Syst 36(6):683–693

    Article  MathSciNet  MATH  Google Scholar 

  12. Mavronicolas M, Spirakis P (2001) The price of selfish routing. In: Proceeding of the 33rd annual ACM symposium on theory of computing (STOC), Heraklion, pp 510–519

    Google Scholar 

  13. Nash JF Jr (1951) Non-cooperative games. Ann Math 54(2):286–295

    Article  MathSciNet  MATH  Google Scholar 

  14. Vöcking B (2007) Selfish load balancing. In: Nisan N, Roughgarden T, Tardos É, Vazirani V (eds) Algorithmic game theory. Cambridge University Press, Cambridge

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Centre for Discrete Mathematics and Its Applications, University of Warwick, Coventry, UK

    Artur Czumaj

  2. Department of Computer Science, RWTH Aachen University, Aachen, Germany

    Berthold Vöcking

Authors
  1. Artur Czumaj
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Berthold Vöcking
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Artur Czumaj .

Editor information

Editors and Affiliations

  1. Department of Electrical Engineering and Computer Science, Northwestern University, Evanston, IL, USA

    Ming-Yang Kao

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer Science+Business Media New York

About this entry

Cite this entry

Czumaj, A., Vöcking, B. (2016). Price of Anarchy for Machines Models. In: Kao, MY. (eds) Encyclopedia of Algorithms. Springer, New York, NY. https://doi.org/10.1007/978-1-4939-2864-4_300

Download citation

Publish with us

Policies and ethics

Search

Navigation