skip to main content
10.1145/1378533.1378571acmconferencesArticle/Chapter ViewAbstractPublication PagesspaaConference Proceedingsconference-collections
research-article

Graphical congestion games with linear latencies

Published: 14 June 2008 Publication History

Abstract

We introduce a new general framework for the analysis of non cooperative games with limited social knowledge. Such an incomplete knowledge is modeled by means of a social graph G in which nodes represent players and there is an edge from i to j if i knows j, with the assumption that the payoff of each player is affected only by the strategies of the adjacent ones. In particular, we consider congestion games with linear latency functions in which each player is aware only of a subset of all the other ones. We first give a complete characterization of the games possessing pure Nash equilibria, and then investigate the impact of the limited knowledge of the players on the performance of the game, in terms of price of anarchy and price of stability.

References

[1]
R. Beier, A. Czumaj, P. Krysta, and B. Vocking. Computing Equilibria for Congestion Games with (Im)perfect Information. In Proc. of the 15th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), ACM Press, pp. 746--755, 2004.
[2]
G. Christodoulou and E. Koutsoupias. The Price of Anarchy of Finite Congestion Games. In Proc. of the 37th Annual ACM Symposium on Theory of Computing (STOC), ACM Press, pp. 67--73, 2005.
[3]
G. Christodoulou and E. Koutsoupias. On the Price of Anarchy and Stability of Correlated Equilibria of Linear Congestion Games. In Proc. of the 13th Annual European Symposium on Algorithms (ESA), LNCS 3669, Springer, pp. 59--70, 2005.
[4]
A. Fabrikant, C. H. Papadimitriou, and K. Talwar. The Complexity of Pure Nash Equilibria. In Proc. of the 36th Annual ACM Symposium on Theory of Computing (STOC), ACM Press, pp. 604--612, 2004.
[5]
M. Gairing, B. Monien, and K. Tiemann. Selfish Routing with Incomplete Information. In Proc. of the 17th Annual ACM Symposium on Parallel Algorithms (SPAA), ACM Press, pp. 203--212, 2005.
[6]
J. C. Harsanyi. Games with Incomplete Information Played by Bayesian Players, I, II, III. Management Science, 14:159--182, 320--332, 468--502, 1967.
[7]
Elias Koutsoupias, Panagiota N. Panagopoulou and Paul G. Spirakis. Selfish Load Balancing Under Partial Knowledge In Proc. of 32nd International Symposium on Mathematical Foundations of Computer Science (MFCS), LNCS 4708, 609--620, 2007.
[8]
M. J. Kearns, M. L. Littman, and S. P. Singh. Graphical Models for Game Theory. In Proc. of the 17th Conference in Uncertainty in Artificial Intelligence (UAI), pp. 253--260, 2001.
[9]
Kleinberg, J. M. The small-world phenomenon: an algorithm perspective. In Proc. of the 32nd ACM Symposium on Theory of Computing (STOC) (2000), pp. 163--170.
[10]
R. W. Rosenthal. A Class of Games Possessing Pure-Strategy Nash Equilibria. International Journal of Game Theory, 2:65--67, 1973.

Cited By

View all

Index Terms

  1. Graphical congestion games with linear latencies

    Recommendations

    Comments

    Information & Contributors

    Information

    Published In

    cover image ACM Conferences
    SPAA '08: Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures
    June 2008
    380 pages
    ISBN:9781595939739
    DOI:10.1145/1378533
    Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

    Sponsors

    Publisher

    Association for Computing Machinery

    New York, NY, United States

    Publication History

    Published: 14 June 2008

    Permissions

    Request permissions for this article.

    Check for updates

    Author Tags

    1. algorithmic game theory
    2. congestion games
    3. nash equilibrium
    4. price of anarchy
    5. price of stability
    6. social knowledge

    Qualifiers

    • Research-article

    Conference

    SPAA08

    Acceptance Rates

    Overall Acceptance Rate 447 of 1,461 submissions, 31%

    Upcoming Conference

    SPAA '25
    37th ACM Symposium on Parallelism in Algorithms and Architectures
    July 28 - August 1, 2025
    Portland , OR , USA

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • Downloads (Last 12 months)1
    • Downloads (Last 6 weeks)0
    Reflects downloads up to 19 Feb 2025

    Other Metrics

    Citations

    Cited By

    View all
    • (2019)Spatial Spectrum Access GameHandbook of Cognitive Radio10.1007/978-981-10-1394-2_42(1123-1155)Online publication date: 22-Feb-2019
    • (2017)Spatial Spectrum Access GameHandbook of Cognitive Radio10.1007/978-981-10-1389-8_42-1(1-32)Online publication date: 16-May-2017
    • (2015)Spatial Spectrum Access GameIEEE Transactions on Mobile Computing10.1109/TMC.2014.232667314:3(646-659)Online publication date: 1-Mar-2015
    • (2012)Spatial spectrum access gameProceedings of the thirteenth ACM international symposium on Mobile Ad Hoc Networking and Computing10.1145/2248371.2248401(205-214)Online publication date: 11-Jun-2012
    • (2010)When ignorance helpsTheoretical Computer Science10.1016/j.tcs.2009.10.007411:3(660-671)Online publication date: 1-Jan-2010
    • (2009)Game-Theoretic Approaches to Optimization Problems in Communication NetworksGraphs and Algorithms in Communication Networks10.1007/978-3-642-02250-0_9(241-263)Online publication date: 9-Nov-2009
    • (2008)When Ignorance HelpsProceedings of the 33rd international symposium on Mathematical Foundations of Computer Science10.1007/978-3-540-85238-4_8(108-119)Online publication date: 25-Aug-2008

    View Options

    Login options

    View options

    PDF

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader

    Figures

    Tables

    Media

    Share

    Share

    Share this Publication link

    Share on social media