Skip to main content
SpringerLink
Log in

Congestion games with mixed objectives

  • Published:
Journal of Combinatorial Optimization Aims and scope Submit manuscript

Abstract

We study a new class of games which generalizes congestion games and its bottleneck variant. We introduce congestion games with mixed objectives to model network scenarios in which players seek to optimize for latency and bandwidths alike. We characterize the (non-)existence of pure Nash equilibria (PNE), the convergence of improvement dynamics, the quality of equilibria and show the complexity of the decision problem. For games that do not possess PNE we give bounds on the approximation ratio of approximate pure Nash equilibria.

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

Fig. 1

Similar content being viewed by others

References

  • Ackermann H, Röglin H, Vöcking B (2009) Pure nash equilibria in player-specific and weighted congestion games. Theor Comput Sci 410(17):1552–1563

    Article  MathSciNet  Google Scholar 

  • Ackermann H, Röglin H, Vöcking B (2008) On the impact of combinatorial structure on congestion games. J ACM 55(6):25:1–25:22

    Article  MathSciNet  Google Scholar 

  • Ackermann H, Skopalik A (2008) Complexity of pure nash Equilibria in player-specific network congestion games. Internet Math 5(4):323–342

    Article  MathSciNet  Google Scholar 

  • Banner R, Orda A (2007) Bottleneck routing games in communication networks. IEEE J Sel Areas Commun 25(6):1173–1179

    Article  Google Scholar 

  • Caragiannis I, Fanelli A, Gravin N, Skopalik A (2011) Efficient Computation of approximate pure Nash equilibria in congestion games. In IEEE 52nd annual symposium on foundations of computer science (FOCS), pp 532–541

  • Caragiannis I, Fanelli A, Gravin N, Skopalik A (2015) Approximate pure Nash equilibria in weighted congestion games: existence, efficient computation, and structure. ACM Trans Econ Comput 3(1):1–2

    Article  MathSciNet  Google Scholar 

  • Chien S, Sinclair A (2011) Convergence to approximate nash equilibria in congestion games. Games Econ Behav 71(2):315–327

    Article  MathSciNet  Google Scholar 

  • Cole R, Dodis Y, Roughgarden T (2012) Bottleneck links, variable demand, and the tragedy of the commons. Networks 60(3):194–203

    Article  MathSciNet  Google Scholar 

  • Dunkel J, Schulz AS (2008) On the complexity of pure-strategy Nash equilibria in congestion and local-effect games. Math Oper Res 33(4):851–868

    Article  MathSciNet  Google Scholar 

  • Feldotto M, Gairing M, Skopalik A (2014) Bounding the potential function in congestion games and approximate pure Nash equilibria. In Liu T, Qi Q, Ye Y (eds) Web and internet economics - 10th international conference, WINE 2014, Beijing, China, December 14–17, 2014. Proceedings. Lecture Notes in Computer Science, vol 8877, pp 30–43. Springer

  • Fortune S, Hopcroft J, Wyllie J (1980) The directed subgraph homeomorphism problem. Theor Comput Sci 10(2):111–121

    Article  MathSciNet  Google Scholar 

  • Fotakis D, Kontogiannis S, Spirakis P (2005) Selfish unsplittable flows. Theor Comput Sci 348(2):226–239

    Article  MathSciNet  Google Scholar 

  • Garey MR, Johnson DS (1979) Computers and intractability: a guide to the theory of NP-completeness. W. H. Freeman, New York

    MATH  Google Scholar 

  • Hansknecht C, Klimm M, Skopalik A (2014) Approximate pure Nash equilibria in weighted congestion games. In Jansen K, Rolim JDP, Devanur NR, Moore C (eds) Approximation, randomization, and combinatorial optimization. Algorithms and techniques (APPROX/RANDOM 2014). Leibniz international proceedings in informatics (LIPIcs), vol 28, pp 242–257. Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany

  • Harks T, Hoefer M, Schewior K, Skopalik A (2016) Routing games with progressive filling. IEEE/ACM Trans Netw 24(4):2553–2562

    Article  Google Scholar 

  • Harks T, Hoefer M, Klimm M, Skopalik A (2013) Computing pure nash and strong equilibria in bottleneck congestion games. Math Program 141(1):193–215

    Article  MathSciNet  Google Scholar 

  • Harks T, Klimm M, Möhring RH (2009) Strong Nash equilibria in games with the lexicographical improvement property. In Leonardi S (ed) Internet and network economics, 5th international workshop, WINE 2009, Rome, Italy, December 14–18, 2009. Proceedings. Lecture notes in computer science, vol 5929, pp 463–470. Springer

  • Mavronicolas M, Milchtaich I, Monien B, Tiemann K (2007) Congestion games with player-specific constants. In Kucera L, Kucera A (eds) Mathematical foundations of computer science 2007, 32nd international symposium, MFCS 2007, Ceský Krumlov, Czech Republic, August 26–31, 2007, Proceedings. Lecture notes in computer science, vol 4708, pp 633–644. Springer

  • Milchtaich I (1996) Congestion games with player-specific payoff functions. Games Econ Behav 13(1):111–124

    Article  MathSciNet  Google Scholar 

  • Monderer D, Shapley LS (1996) Potential games. Games Econ Behav 14(1):124–143

    Article  MathSciNet  Google Scholar 

  • Rosenthal RW (1973) A class of games possessing pure-strategy nash equilibria. Int J Game Theory 2(1):65–67

    Article  MathSciNet  Google Scholar 

  • Skopalik A, Vöcking B (2008) Inapproximability of pure Nash equilibria. In Proceedings of the fortieth annual ACM symposium on theory of computing. pp 355–364. STOC ’08, ACM, New York, NY, USA

Download references

Author information

Authors and Affiliations

  1. Paderborn University, Fuerstenallee 11, 33102, Paderborn, Germany

    Matthias Feldotto, Lennart Leder & Alexander Skopalik

Authors
  1. Matthias Feldotto
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Lennart Leder
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Alexander Skopalik
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Matthias Feldotto.

Additional information

This work was partially supported by the German Research Foundation (DFG) within the Collaborative Research Centre “On-The-Fly Computing” (SFB 901).

A preliminary version of this paper has been published in the Proceedings of COCOA2016, Lecture Notes in Computer Science, 10043, 645-669, 2016 and is available at Springer via https://dx.doi.org/10.1007/978-3-319-48749-6_47.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Feldotto, M., Leder, L. & Skopalik, A. Congestion games with mixed objectives. J Comb Optim 36, 1145–1167 (2018). https://doi.org/10.1007/s10878-017-0189-y

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10878-017-0189-y

Keywords

Search

Navigation