Skip to main content
Conference Proceedings

A selective tour through congestion games

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2015) 9295 223-241
DOI: 10.1007/978-3-319-24024-4_14
4Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We give a sketchy and mostly informal overview of research on algorithmic properties of congestion games in the last ten years. We discuss existence of potential functions and pure Nash equilibria in games with weighted players, simple and fast algorithms that reach a pure Nash equilibrium, and efficient approaches to improving the Price of Anarchy.

Cite

CITATION STYLE

APA

Fotakis, D. (2015). A selective tour through congestion games. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9295, pp. 223–241). Springer Verlag. https://doi.org/10.1007/978-3-319-24024-4_14

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free