Document Open Access Logo

Semilinear Representations for Series-Parallel Atomic Congestion Games

Authors Nathalie Bertrand , Nicolas Markey , Suman Sadhukhan, Ocan Sankur

PDF

File

Thumbnail PDF
PDF
LIPIcs.FSTTCS.2022.32.pdf
  • Filesize: 0.79 MB
  • 20 pages

Document Identifiers

Subject Classification

ACM Subject Classification
  • Theory of computation → Algorithmic game theory
  • Theory of computation → Solution concepts in game theory
Keywords
  • congestion games
  • Nash equilibria
  • Presburger arithmetic
  • semilinear sets
  • price of anarchy

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

Abstract

We consider atomic congestion games on series-parallel networks, and study the structure of the sets of Nash equilibria and social local optima on a given network when the number of players varies. We establish that these sets are definable in Presburger arithmetic and that they admit semilinear representations whose all period vectors have a common direction. As an application, we prove that the prices of anarchy and stability converge to 1 as the number of players goes to infinity, and show how to exploit these semilinear representations to compute these ratios precisely for a given network and number of players.

Cite As Get BibTex

Nathalie Bertrand, Nicolas Markey, Suman Sadhukhan, and Ocan Sankur. Semilinear Representations for Series-Parallel Atomic Congestion Games. In 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 250, pp. 32:1-32:20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022) https://doi.org/10.4230/LIPIcs.FSTTCS.2022.32

Author Details

Nathalie Bertrand
  • Univ Rennes, Inria, CNRS, IRISA, France
Nicolas Markey
  • Univ Rennes, Inria, CNRS, IRISA, France
Suman Sadhukhan
  • Univ Rennes, Inria, CNRS, IRISA, France
  • University of Haifa, Israel
Ocan Sankur
  • Univ Rennes, Inria, CNRS, IRISA, France

Funding

This research was partially supported by ISF grant no. 1679/21.

References

  1. Eitan Altman, Anurag Kumar, and Yezekael Hayel. A potential game approach for uplink resource allocation in a multichannel wireless access network. In Proceedings of the Fourth International ICST Conference on Performance Evaluation Methodologies and Tools, pages 1-9, 2009. Google Scholar
  2. E. Anshelevich, A. Dasgupta, J. Kleinberg, E. Tardos, T. Wexler, and T. Roughgarden. The price of stability for network design with fair cost allocation. In 45th Annual IEEE Symposium on Foundations of Computer Science, pages 295-304, 2004. URL: https://doi.org/10.1109/FOCS.2004.68.
  3. Baruch Awerbuch, Yossi Azar, and Amir Epstein. The price of routing unsplittable flow. In Proceedings of the Thirty-Seventh Annual ACM Symposium on Theory of Computing, STOC'05, pages 57-66, New York, NY, USA, 2005. Association for Computing Machinery. URL: https://doi.org/10.1145/1060590.1060599.
  4. Martin J. Beckmann, C. B. McGuire, and C. B. Winsten. Studies in the Economics of Transportation. RAND Corporation, Santa Monica, CA, 1955. Google Scholar
  5. Nathalie Bertrand, Nicolas Markey, Suman Sadhukhan, and Ocan Sankur. Dynamic network congestion games. In 40th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2020), Goa, India, December 2020. URL: https://hal.archives-ouvertes.fr/hal-02980833.
  6. I. Borosh and L. B. Treybig. Bounds on positive integral solutions of linear diophantine equations. Proceedings of the American Mathematical Society, 55(2):299-304, 1976. URL: http://www.jstor.org/stable/2041711.
  7. Ioannis Caragiannis, Michele Flammini, Christos Kaklamanis, Panagiotis Kanellopoulos, and Luca Moscardelli. Tight bounds for selfish and greedy load balancing. Algorithmica, 61(3):606-637, November 2011. URL: https://doi.org/10.1007/s00453-010-9427-8.
  8. George Christodoulou and Elias Koutsoupias. On the price of anarchy and stability of correlated equilibria of linear congestion games,,. In Proceedings of the 13th Annual European Conference on Algorithms, ESA'05, pages 59-70, Berlin, Heidelberg, 2005. Springer-Verlag. URL: https://doi.org/10.1007/11561071_8.
  9. George Christodoulou and Elias Koutsoupias. The price of anarchy of finite congestion games. In Proceedings of the Thirty-Seventh Annual ACM Symposium on Theory of Computing, STOC'05, pages 67-73, New York, NY, USA, 2005. Association for Computing Machinery. URL: https://doi.org/10.1145/1060590.1060600.
  10. Riccardo Colini-Baldeschi, Roberto Cominetti, Panayotis Mertikopoulos, and Marco Scarsini. When is selfish routing bad? the price of anarchy in light and heavy traffic. Oper. Res., 68(2):411-434, 2020. URL: https://doi.org/10.1287/opre.2019.1894.
  11. Riccardo Colini-Baldeschi, Roberto Cominetti, and Marco Scarsini. Price of anarchy for highly congested routing games in parallel networks. Theory Comput. Syst., 63(1):90-113, 2019. URL: https://doi.org/10.1007/s00224-017-9834-1.
  12. Roberto Cominetti, Valerio Dose, and Marco Scarsini. The price of anarchy in routing games as a function of the demand. Mathematical Programming, 2021. To appear. URL: https://doi.org/10.1007/s10107-021-01701-7.
  13. Roberto Cominetti, Marco Scarsini, Marc Schröder, and NE Stier-Moses. Convergence of large atomic congestion games. arXiv preprint, 2020. URL: http://arxiv.org/abs/2001.02797.
  14. Jasper de Jong, Walter Kern, Berend Steenhuisen, and Marc Uetz. The asymptotic price of anarchy for k-uniform congestion games. In International Workshop on Approximation and Online Algorithms, pages 317-328. Springer, 2017. Google Scholar
  15. Alberto Del Pia, Michael Ferris, and Carla Michini. Totally unimodular congestion games. In Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, pages 577-588. SIAM, 2017. Google Scholar
  16. Samuel Eilenberg and Marcel Paul Schützenberger. Rational sets in commutative monoids. Journal of Algebra, 13:173-191, 1969. Google Scholar
  17. Alex Fabrikant, Christos Papadimitriou, and Kunal Talwar. The complexity of pure nash equilibria. In Proceedings of the Thirty-Sixth Annual ACM Symposium on Theory of Computing, STOC '04, pages 604-612, New York, NY, USA, 2004. Association for Computing Machinery. URL: https://doi.org/10.1145/1007352.1007445.
  18. Michal Feldman, Nicole Immorlica, Brendan Lucier, Tim Roughgarden, and Vasilis Syrgkanis. The price of anarchy in large games. In 48th ACM Symposium on Theory of Computing (STOC) 2016, June 2016. URL: https://www.microsoft.com/en-us/research/publication/price-anarchy-large-games/.
  19. Dimitris Fotakis. Congestion games with linearly independent paths: Convergence time and price of anarchy. In Proceedings of the 1st International Symposium on Algorithmic Game Theory, SAGT '08, pages 33-45, Berlin, Heidelberg, 2008. Springer-Verlag. URL: https://doi.org/10.1007/978-3-540-79309-0_5.
  20. Dimitris Fotakis, Spyros Kontogiannis, Elias Koutsoupias, Marios Mavronicolas, and Paul Spirakis. The structure and complexity of nash equilibria for a selfish routing game. Theoretical Computer Science, 410(36):3305-3326, 2009. Graphs, Games and Computation: Dedicated to Professor Burkhard Monien on the Occasion of his 65th Birthday. URL: https://doi.org/10.1016/j.tcs.2008.01.004.
  21. Elisabeth Gassner, Johannes Hatzl, Sven O. Krumke, Heike Sperber, and Gerhard J. Woeginger. How hard is it to find extreme nash equilibria in network congestion games? Theoretical Computer Science, 410(47):4989-4999, 2009. URL: https://doi.org/10.1016/j.tcs.2009.07.046.
  22. Seymour Ginsburg and Edwin H. Spanier. Bounded algol-like languages. Transactions of the American Mathematical Society, 113(2):333-368, 1964. URL: http://www.jstor.org/stable/1994067.
  23. Christoph Haase. A survival guide to presburger arithmetic. ACM SIGLOG News, 5(3):67-82, July 2018. URL: https://doi.org/10.1145/3242953.3242964.
  24. Bainian Halo and Carla Michini. The price of anarchy in series-parallel network congestion games. Technical report, University of Wisconsin-Madison, 2021. Google Scholar
  25. Ryuichi Ito. Every semilinear set is a finite union of disjoint linear sets. J. Comput. Syst. Sci., 3(2):221-231, May 1969. URL: https://doi.org/10.1016/S0022-0000(69)80014-0.
  26. David S. Johnson, Christos H. Papadimitriou, and Mihalis Yannakakis. How easy is local search? Journal of Computer and System Sciences, 37(1):79-100, 1988. URL: https://doi.org/10.1016/0022-0000(88)90046-3.
  27. Elias Koutsoupias and Christos Papadimitriou. Worst-case equilibria. Computer Science Review, 3(2):65-69, 2009. URL: https://doi.org/10.1016/j.cosrev.2009.04.003.
  28. Noam Nisan, Tim Roughgarden, Éva Tardos, and Vijay V. Vazirani. Algorithmic Game Theory. Cambridge University Press, New York, NY, USA, 2007. Google Scholar
  29. Christos H. Papadimitriou and Mihalis Yannakakis. Optimization, approximation, and complexity classes. Journal of Computer and System Sciences, 43(3):425-440, 1991. URL: https://doi.org/10.1016/0022-0000(91)90023-X.
  30. A. C. Pigou. Economics of welfare. McMillan, 1920. Google Scholar
  31. Robert W. Rosenthal. The network equilibrium problem in integers. Networks, 3:53-59, 1973. Google Scholar
  32. Tim Roughgarden and Éva Tardos. How bad is selfish routing? Journal of the ACM (JACM), 49(2):236-259, 2002. Google Scholar
  33. Heike Sperber. How to find nash equilibria with extreme total latency in network congestion games? In 2009 International Conference on Game Theory for Networks, pages 158-163, 2009. URL: https://doi.org/10.1109/GAMENETS.2009.5137397.
  34. Jacobo Valdes, Robert E. Tarjan, and Eugene L. Lawler. The recognition of series parallel digraphs. In Proceedings of the Eleventh Annual ACM Symposium on Theory of Computing, STOC '79, pages 1-12, New York, NY, USA, 1979. Association for Computing Machinery. URL: https://doi.org/10.1145/800135.804393.
  35. Joachim von zur Gathen and Malte Sieveking. A bound on solutions of linear integer equalities and inequalities. Proceedings of the American Mathematical Society, 72(1):155-158, 1978. Google Scholar
  36. John Glen Wardrop. Some theoretical aspects of road traffic research. Proceedings of the institution of civil engineers, 1(3):325-362, 1952. Google Scholar
  37. Zijun Wu, Rolf H Moehring, Chunying Ren, and Dachuan Xu. A convergence analysis of the price of anarchy in atomic congestion games. Mathematical Programming, 2022. To appear. URL: https://doi.org/10.1007/s10107-022-01853-0.
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2025 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact