Coping with selfishness in congestion games [electronic resource] : analysis and design via LP duality / Vittorio Bil,̣ Cosimo Vinci.
2023
QA272.5
Linked e-resources
Linked Resource
Concurrent users
Unlimited
Authorized users
Authorized users
Document Delivery Supplied
Can lend chapters, not whole ebooks
Details
Title
Coping with selfishness in congestion games [electronic resource] : analysis and design via LP duality / Vittorio Bil,̣ Cosimo Vinci.
Author
ISBN
9783031302619 (electronic bk.)
3031302613 (electronic bk.)
3031302605
9783031302602
3031302613 (electronic bk.)
3031302605
9783031302602
Published
Cham, Switzerland : Springer, 2023.
Language
English
Description
1 online resource.
Item Number
10.1007/978-3-031-30261-9 doi
Call Number
QA272.5
Dewey Decimal Classification
519.3
Summary
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 primal-dual methoda 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 masters 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).
Bibliography, etc. Note
Includes bibliographical references.
Access Note
Access limited to authorized users.
Source of Description
Description based on print version record.
Added Author
Series
Monographs in theoretical computer science.
Available in Other Form
Print version: 9783031302602
Linked Resources
Record Appears in
Table of Contents
Part I, Coping with Selfishness in Congestion Games: Introduction
Part II, Analysis of the Performance of Congestion Games
Part III, How to Improve the Performance of Congestion Games via Taxes
Part IV, Other Strategies to Improve the Performance of Congestion Games.
Part II, Analysis of the Performance of Congestion Games
Part III, How to Improve the Performance of Congestion Games via Taxes
Part IV, Other Strategies to Improve the Performance of Congestion Games.