000			03067nam a2200313Ia 4500
000			03678nam a22003495i 4500
001			978-3-031-30261-9
003			DE-He213
005			20240319120806.0
007			cr nn 008mamaa
008			230510s2023 sz | s |||| 0|eng d
020			_a9783031302619 _9978-3-031-30261-9
082			_a4.0151
100			_aBilò, Vittorio. _928838
245			_aCoping with Selfishness in Congestion Games _cby Vittorio Bilò, Cosimo Vinci. _h[electronic resource] :
250			_a1st ed. 2023.
260			_aCham _bSpringer International Publishing _c2023
300			_aXV, 186 p. 1 illus. _bonline resource.
520			_aCongestion 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 primal-dual method-a powerful tool suited to prove good bounds on the performance guarantee of self-emerging 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).
650			_aComputer programming. _928839
650			_aComputer science. _928840
650			_aGame theory. _928841
650			_aGame Theory. _928842
650			_aProgramming Techniques. _928843
650			_aTheory of Computation. _928844
700			_aVinci, Cosimo. _928845
856			_uhttps://doi.org/10.1007/978-3-031-30261-9
942			_cEBK _2ddc
999			_c14995 _d14995