國立高雄大學圖資館 |

Language: English

Back

Coping with selfishness in congestion gamesanalysis and design via LP duality /

Record Type:	Electronic resources : Monograph/item
Title/Author:	Coping with selfishness in congestion gamesby Vittorio Bilò, Cosimo Vinci.
Reminder of title:	analysis and design via LP duality /
Author:	Bilò, Vittorio.
other author:	Vinci, Cosimo.
Published:	Cham :Springer International Publishing :2023.
Description:	1 online resource (xv, 186 p.) :ill., digital ;24 cm.
Contained By:	Springer Nature eBook
Subject:	Noncooperative games (Mathematics)
Online resource:	https://doi.org/10.1007/978-3-031-30261-9
ISBN:	9783031302619$q(electronic bk.)

Coping with selfishness in congestion gamesanalysis and design via LP duality /
Bilò, Vittorio.

Coping with selfishness in congestion gamesanalysis and design via LP duality /[electronic resource] :by Vittorio Bilò, Cosimo Vinci. - Cham :Springer International Publishing :2023. - 1 online resource (xv, 186 p.) :ill., digital ;24 cm. - Monographs in theoretical computer science. - Monographs in theoretical computer science..

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.

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 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 Bilò 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)

ISBN: 9783031302619$q(electronic bk.)

Standard No.: 10.1007/978-3-031-30261-9doiSubjects--Topical Terms:

185921
Noncooperative games (Mathematics)

LC Class. No.: QA272.5

Dewey Class. No.: 519.3

Coping with selfishness in congestion gamesanalysis and design via LP duality /
LDR:03403nmm a2200337 a 4500 001 637584
003 DE-He213
005 20230511072454.0
006 m d
007 cr nn 008maaau
008 230921s2023 sz s 0 eng d
020 $a 9783031302619$q(electronic bk.)
020 $a 9783031302602$q(paper)
024 7 $a 10.1007/978-3-031-30261-9 $2 doi
035 $a 978-3-031-30261-9
040 $a GP $c GP
041 0 $a eng
050 4 $a QA272.5
072 7 $a UYA $2 bicssc
072 7 $a COM014000 $2 bisacsh
072 7 $a UYA $2 thema
082 0 4 $a 519.3 $2 23
090 $a QA272.5 $b .B599 2023
100 1 $a Bilò, Vittorio. $3 944080
245 1 0 $a Coping with selfishness in congestion games $h [electronic resource] : $b analysis and design via LP duality / $c by Vittorio Bilò, Cosimo Vinci.
260 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2023.
300 $a 1 online resource (xv, 186 p.) : $b ill., digital ; $c 24 cm.
490 1 $a Monographs in theoretical computer science
505 0 $a 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.
520 $a 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 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 Bilò 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 0 $a Noncooperative games (Mathematics) $3 185921
650 1 4 $a Theory of Computation. $3 274475
650 2 4 $a Game Theory. $3 737094
650 2 4 $a Programming Techniques. $3 274470
700 1 $a Vinci, Cosimo. $3 944081
710 2 $a SpringerLink (Online service) $3 273601
773 0 $t Springer Nature eBook
830 0 $a Monographs in theoretical computer science. $3 559651
856 4 0 $u https://doi.org/10.1007/978-3-031-30261-9
950 $a Computer Science (SpringerNature-11645)