找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Coping with Selfishness in Congestion Games; Analysis and Design Vittorio Bilò,Cosimo Vinci Book 2023 The Editor(s) (if applicable) and Th

[复制链接]
查看: 22068|回复: 50
发表于 2025-3-21 18:54:53 | 显示全部楼层 |阅读模式
书目名称Coping with Selfishness in Congestion Games
副标题Analysis and Design
编辑Vittorio Bilò,Cosimo Vinci
视频video
概述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 re
丛书名称Monographs in Theoretical Computer Science. An EATCS Series
图书封面Titlebook: Coping with Selfishness in Congestion Games; Analysis and Design  Vittorio Bilò,Cosimo Vinci Book 2023 The Editor(s) (if applicable) and Th
描述.​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 Compute
出版日期Book 2023
关键词Game Theory; Congestion Games; Nash Equilibria; Algorithms; Load Balancing
版次1
doihttps://doi.org/10.1007/978-3-031-30261-9
isbn_softcover978-3-031-30263-3
isbn_ebook978-3-031-30261-9Series ISSN 1431-2654 Series E-ISSN 2193-2069
issn_series 1431-2654
copyrightThe Editor(s) (if applicable) and The Author(s), under exclusive license to Springer Nature Switzerl
The information of publication is updating

书目名称Coping with Selfishness in Congestion Games影响因子(影响力)




书目名称Coping with Selfishness in Congestion Games影响因子(影响力)学科排名




书目名称Coping with Selfishness in Congestion Games网络公开度




书目名称Coping with Selfishness in Congestion Games网络公开度学科排名




书目名称Coping with Selfishness in Congestion Games被引频次




书目名称Coping with Selfishness in Congestion Games被引频次学科排名




书目名称Coping with Selfishness in Congestion Games年度引用




书目名称Coping with Selfishness in Congestion Games年度引用学科排名




书目名称Coping with Selfishness in Congestion Games读者反馈




书目名称Coping with Selfishness in Congestion Games读者反馈学科排名




单选投票, 共有 0 人参与投票
 

0票 0%

Perfect with Aesthetics

 

0票 0%

Better Implies Difficulty

 

0票 0%

Good and Satisfactory

 

0票 0%

Adverse Performance

 

0票 0%

Disdainful Garbage

您所在的用户组没有投票权限
发表于 2025-3-21 22:01:46 | 显示全部楼层
发表于 2025-3-22 03:06:28 | 显示全部楼层
Romantic Women Poets: Inscribing the Self a primal-dual pair of linear programs, where the dual is used to provide tight (or almost tight) upper bounds on the performance guarantee of a certain efficiency metric, and the primal is used to construct tight (or almost tight) lower bounds.
发表于 2025-3-22 06:45:40 | 显示全部楼层
发表于 2025-3-22 11:10:44 | 显示全部楼层
发表于 2025-3-22 15:27:30 | 显示全部楼层
Introduction: The Road from 1945,eralizing part of Chapter 9 (in which we have focused on the specific case of polynomial latency functions), and we give an almost complete characterization of the efficiency of taxation in unweighted congestion games, as done by Pigou [150] and Beckmann et al. [17] for non-atomic congestion games.
发表于 2025-3-22 17:37:03 | 显示全部楼层
发表于 2025-3-23 00:00:44 | 显示全部楼层
Romantic Women Poets: Inscribing the Self a primal-dual pair of linear programs, where the dual is used to provide tight (or almost tight) upper bounds on the performance guarantee of a certain efficiency metric, and the primal is used to construct tight (or almost tight) lower bounds.
发表于 2025-3-23 02:10:53 | 显示全部楼层
发表于 2025-3-23 06:40:52 | 显示全部楼层
Introduction: The Road from 1945,eralizing part of Chapter 9 (in which we have focused on the specific case of polynomial latency functions), and we give an almost complete characterization of the efficiency of taxation in unweighted congestion games, as done by Pigou [150] and Beckmann et al. [17] for non-atomic congestion games.
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-6-22 15:05
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表