Public Signals in Network Congestion Games

Svenja M. Griesbach, M. Hoefer, Max Klimm, Tim Koglin
{"title":"Public Signals in Network Congestion Games","authors":"Svenja M. Griesbach, M. Hoefer, Max Klimm, Tim Koglin","doi":"10.1145/3490486.3538349","DOIUrl":null,"url":null,"abstract":"It is a well-known fact that selfish behavior degrades the performance of traffic networks. Various measures have been proposed in the literature as a remedy for the inefficiency of traffic equilibria (such as road tolls or network design techniques). However, it often seems impractical and/or politically undesirable that these measures get implemented to a substantial extent. We consider a largely untapped potential of network improvement rooted in the inherent uncertainty of travel times. Travel times are subject to stochastic uncertainty resulting from various parameters such as weather condition, occurrences of road works, or traffic accidents. Large mobility services have an informational advantage over single network users as they are able to learn traffic conditions from data. A benevolent mobility service may use this informational advantage in order to steer the traffic equilibrium into a favorable direction. The resulting optimization problem is a task commonly referred to as signaling or Bayesian persuasion. Previous work has shown that the underlying signaling problem can be NP-hard to approximate within any non-trivial bounds[1], even for affine cost functions with stochastic offsets. In contrast, we show that in this case, the signaling problem is easy for many networks. We tightly characterize the class of single-commodity networks, in which full information revelation is always an optimal signaling strategy. Moreover, we construct a reduction from optimal signaling to computing an optimal collection of support vectors for the Wardrop equilibrium. For two states, this insight can be used to compute an optimal signaling scheme. The algorithm runs in polynomial time whenever the number of different supports resulting from any signal distribution is bounded to a polynomial in the input size. Using a cell decomposition technique, we extend the approach to a polynomial-time algorithm for multi-commodity parallel link networks with a constant number of commodities, even when we have a constant number of different states of nature.","PeriodicalId":209859,"journal":{"name":"Proceedings of the 23rd ACM Conference on Economics and Computation","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2022-05-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 23rd ACM Conference on Economics and Computation","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3490486.3538349","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 7

Abstract

It is a well-known fact that selfish behavior degrades the performance of traffic networks. Various measures have been proposed in the literature as a remedy for the inefficiency of traffic equilibria (such as road tolls or network design techniques). However, it often seems impractical and/or politically undesirable that these measures get implemented to a substantial extent. We consider a largely untapped potential of network improvement rooted in the inherent uncertainty of travel times. Travel times are subject to stochastic uncertainty resulting from various parameters such as weather condition, occurrences of road works, or traffic accidents. Large mobility services have an informational advantage over single network users as they are able to learn traffic conditions from data. A benevolent mobility service may use this informational advantage in order to steer the traffic equilibrium into a favorable direction. The resulting optimization problem is a task commonly referred to as signaling or Bayesian persuasion. Previous work has shown that the underlying signaling problem can be NP-hard to approximate within any non-trivial bounds[1], even for affine cost functions with stochastic offsets. In contrast, we show that in this case, the signaling problem is easy for many networks. We tightly characterize the class of single-commodity networks, in which full information revelation is always an optimal signaling strategy. Moreover, we construct a reduction from optimal signaling to computing an optimal collection of support vectors for the Wardrop equilibrium. For two states, this insight can be used to compute an optimal signaling scheme. The algorithm runs in polynomial time whenever the number of different supports resulting from any signal distribution is bounded to a polynomial in the input size. Using a cell decomposition technique, we extend the approach to a polynomial-time algorithm for multi-commodity parallel link networks with a constant number of commodities, even when we have a constant number of different states of nature.
网络拥塞博弈中的公共信号
众所周知,自私行为会降低交通网络的性能。文献中提出了各种措施,作为交通平衡效率低下的补救措施(如道路收费或网络设计技术)。然而,这些措施在很大程度上得到实施往往显得不切实际和/或在政治上不受欢迎。我们认为,由于出行时间固有的不确定性,网络改进的潜力还有待开发。旅行时间受到各种参数的随机不确定性的影响,如天气状况、道路工程的发生或交通事故。与单个网络用户相比,大型移动服务具有信息优势,因为它们能够从数据中了解交通状况。善意的移动性服务可以利用这种信息优势,以便将交通平衡引导到有利的方向。由此产生的优化问题是一个通常被称为信号或贝叶斯说服的任务。先前的研究表明,潜在的信号问题可以在任何非平凡的范围内近似np困难,即使对于具有随机偏移的仿射代价函数也是如此。相反,我们表明,在这种情况下,信令问题对许多网络来说都很容易。我们严格地描述了一类单商品网络,其中完全信息披露始终是最优的信号策略。此外,我们构造了一个从最优信号到计算Wardrop均衡的最优支持向量集合的约简。对于两种状态,这种洞察力可用于计算最优信令方案。当任何信号分布产生的不同支持数被限定为输入大小的一个多项式时,该算法在多项式时间内运行。使用单元分解技术,我们将该方法扩展为具有恒定数量商品的多商品并行链接网络的多项式时间算法,即使我们具有恒定数量的不同自然状态。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信