Coping with Selfishness in Congestion Games

Lieferzeit: Lieferbar innerhalb 14 Tagen

181,89 €

inkl. 7 % MwSt. zzgl. Versandkosten

Analysis and Design via LP Duality, Monographs in Theoretical Computer Science. An EATCS Series

ISBN: 3031302605
ISBN 13: 9783031302602
Autor: Bilò, Vittorio/Vinci, Cosimo
Verlag: Springer Verlag GmbH
Umfang: xv, 186 S., 1 s/w Illustr., 186 p. 1 illus.
Erscheinungsdatum: 11.05.2023
Auflage: 1/2023
Produktform: Gebunden/Hardback
Einband: GEB

Congestion games constitute perhaps the most significant class of non-cooperative games because of their effectiveness in modeling several real scenarios. Since the advent of algorithmic game theory, characterizing the inefficiency of selfish behavior in these games, as well as defining good strategies to reduce it (in the same spirit of approximation and online algorithms‘ design), have stood as fundamental challenges. This unique volume shows how these challenges can be addressed productively via linear programming and duality theory. In particular, the volume: Measures the efficiency of selfish behavior in several classes of congestion games Demonstrates how this efficiency changes when considering different solution concepts, different types of latency functions (from linear and polynomial, to very general ones) and different combinatorial properties of the players‘ strategies (e.g., singleton strategies) Covers the analysis and design of efficient online algorithms for machine scheduling and load balancing problems Utilises taxation mechanisms and Stackelberg strategies to improve the efficiency of selfish behavior, revealing that the performance of the proposed mechanisms is best possible within the considered category Formulates results based on the application of the primaldual methoda powerful tool suited to prove good bounds on the performance guarantee of selfemerging solutions in congestion games This book is suitable for PhD (or master’s degree) students and researchers working in algorithmic game theory. In particular, it may serve as reference guide for those interested in deepening their knowledge on the fascinating field of the price of anarchy in congestion games and related topics. Vittorio Bilò is Associate Professor at the Department of Mathematics and Physics „Ennio De Giorgi“ in University of Salento (Lecce, Italy). Cosimo Vinci is Assistant Professor at the Department of Information Engineering, Electrical Engineering and Applied Mathematics in University of Salerno (Fisciano, Italy).

Artikelnummer: 8826556 Kategorie:

Beschreibung

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.

Autorenporträt

Vittorio Bilò is an Associate 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 the University of L'Aquila in 2005, upon defence of a thesis that was named the best Italian PhD thesis of the year by the Italian Chapter of the European Association for Theoretical Computer Science. His research interests focus on algorithm design and analysis, with a particular predilection for problems arising at the interface between Theoretical Computer Science and Game Theory (Algorithmic Game Theory). During his career, he has authored and co-authored more than one hundred publications in top-class conferences and journals. 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.

Das könnte Ihnen auch gefallen …