Overview
- Addresses congestion games through linear programming and duality theory
- Measures the efficiency of selfish behavior in several classes of congestion games
- Provides a helpful guide for students and researchers working in algorithmic game theory
Part of the book series: Monographs in Theoretical Computer Science. An EATCS Series (EATCS)
Access this book
Tax calculation will be finalised at checkout
Other ways to access
Table of contents (11 chapters)
-
Introduction
-
Analysis of Selfish and Greedy Outcomes in Congestion Games
-
Taxes and Other Strategies to Cope with Selfish Behavior
Keywords
About this book
Congestion games are a fundamental class of games widely considered and studied in non-cooperative game theory, introduced to model several realistic scenarios in which people share a limited quantity of goods or services. In congestion games there are several selfish players competing for a set of resources, and each resource incurs a certain latency, expressed by a congestion-dependent function, to the players using it. Each player has a certain weight and an available set of strategies, where each strategy is a non-empty subset of resources, and aims at choosing a strategy minimizing her personal cost, which is defined as the sum of the latencies experienced on all the selected resources. The impact of selfish behavior in congestion games generally deteriorates the social welfare, thus reducing their performance. This deterioration is generally estimated by the price of anarchy, a metric that compares the worst Nash equilibrium configuration with the optimal social welfare, so that the larger the price of anarchy for a game, the higher the impact of selfish behavior.
The book derives from the first author's thesis, which won the Best Italian PhD Thesis in Theoretical Computer Science in 2019, awarded by the Italian chapter of the EATCS. The book will be revised for broader audience, and the thesis supervisor is joining as coauthor following the suggestion of the series. The authors will introduce examples for initial definitions with detailed explanations, and expand the scope to the broader results in the area rather than their specific work.
Authors and Affiliations
About the authors
Cosimo Vinci is an Assistant Professor in the Department of Mathematics and Physics "Ennio De Giorgi" at the University of Salento, Italy. He received a PhD in Computer Science from Gran Sasso Science Institute in 2018, discussing a thesis that was awarded as the best Italian PhD thesis of the year by the Italian Chapter of the European Association for Theoretical Computer Science. His research activity covers several areas from Theoretical Computer Science and Applied Mathematics, and is particularly focused on Algorithmic Game Theory, Stochastic Optimization, Approximation and Online Algorithms. He is author of several publications appeared in prestigious conferences and journals.
Bibliographic Information
Book Title: Coping with Selfishness in Congestion Games
Book Subtitle: Analysis and Design via LP Duality
Authors: Vittorio Bilò, Cosimo Vinci
Series Title: Monographs in Theoretical Computer Science. An EATCS Series
DOI: https://doi.org/10.1007/978-3-031-30261-9
Publisher: Springer Cham
eBook Packages: Computer Science, Computer Science (R0)
Copyright Information: The Editor(s) (if applicable) and The Author(s), under exclusive license to Springer Nature Switzerland AG 2023
Hardcover ISBN: 978-3-031-30260-2Published: 11 May 2023
Softcover ISBN: 978-3-031-30263-3Due: 26 June 2023
eBook ISBN: 978-3-031-30261-9Published: 10 May 2023
Series ISSN: 1431-2654
Series E-ISSN: 2193-2069
Edition Number: 1
Number of Pages: XV, 186
Number of Illustrations: 1 b/w illustrations
Topics: Theory of Computation, Game Theory, Economics, Social and Behav. Sciences, Programming Techniques