Skip to main content
SpringerLink
Log in

Equilibria in load balancing games

  • Published:
Acta Mathematicae Applicatae Sinica, English Series Aims and scope Submit manuscript

Abstract

A Nash equilibrium (NE) in a multi-agent game is a strategy profile that is resilient to unilateral deviations. A strong Nash equilibrium (SE) is one that is stable against coordinated deviations of any coalition. We show that, in the load balancing games, NEs approximate SEs in the sense that the benefit of each member of any coalition from coordinated deviations is well limited. Furthermore, we show that an easily recognizable special subset of NEs exhibit even better approximation of SEs.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Andelman, N., Feldman, M., Mansour, Y. Strong price of anarchy. In: Proceeding of 18th Annual ACM-SIAM Symposium on Discrete Algorithms, 2007, 189–198

  2. Aumann, R. Acceptable Points in General Cooperative n-Person Games. In: Contributions to the Theory of Games IV, Annals of Mathematics 40, ed. by R.D. Luce, A.W. Tucker, 1959, 287–324

  3. Feldman, M., Tamir, T. Approximate Strong Equilibrium in Job Scheduling Games. To appear in: Journal of Artificial Intelligence Research

  4. Fotakis, D., Kontogiannis, S., Mavronicolas, M., Spiraklis, P. The structure and complexity of Nash equilibria for a selfish routing game. In: Proceedings of the 29th International Colloquium on Automata, Languages and Programming, 2002, 510–519

  5. Graham, R. Bounds on multiprocessing timing anomalies. SIAM J. Applied Mathematics, 17: 263–269 (1969)

    Google Scholar 

  6. Korte, B., Vygen, J. Combinatorial Optimization: Theory and Algorithms, 4th ed. Springer, 2008

  7. Monien, B., Schroeder, U.-P., editors. Proceedings of the 1st International Symposium on Algorithmic Game Theory, Vol 4997 of Lecture Notes in Computer Science. Springer, 2008

  8. Wolfram Research. Mathematica: Technical and Scientific Software. http://www.wolfram.com/

Download references

Author information

Authors and Affiliations

  1. Qufu Normal University, Shandong, 273165, China

    Bo Chen

  2. Warwick Business School, University of Warwick, Warwick, CV47AL, UK

    Bo Chen

Authors
  1. Bo Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Bo Chen.

Additional information

Supported by “Taishan Scholar” Project in Applied Mathematics, Qufu Normal University.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Chen, B. Equilibria in load balancing games. Acta Math. Appl. Sin. Engl. Ser. 25, 723–736 (2009). https://doi.org/10.1007/s10255-009-8832-8

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10255-009-8832-8

Keywords

2000 MR Subject Classification

Search

Navigation