Wardrop Equilibria with Risk-Averse Users

F. Ordóñez, N. Stier-Moses
{"title":"Wardrop Equilibria with Risk-Averse Users","authors":"F. Ordóñez, N. Stier-Moses","doi":"10.2139/ssrn.987104","DOIUrl":null,"url":null,"abstract":"Network games can be used to model competitive situations in which agents select routes to minimize their cost. Common applications include traffic, telecommunication, and distribution networks. Although traditional network models have assumed that realized costs only depend on congestion, in most applications they also have an uncertain component. We extend the traffic assignment problem first proposed by Wardrop in 1952 by adding random deviations, which are independent of the flow, to the cost functions that model congestion in each arc. We map these uncertainties into a Wardrop equilibrium model with nonadditive path costs. The cost on a path is given by the sum of the congestion on its arcs plus a constant safety margin that represents the agents' risk aversion. First, we prove that an equilibrium for this game always exists and is essentially unique. Then, we introduce three specific equilibrium models that fall within this framework: the percentile equilibrium where agents select paths that minimize a specified percentile of the uncertain cost; the added-variability equilibrium where agents add a multiple of the variability of the cost of each arc to the expected cost; and the robust equilibrium where agents select paths by solving a robust optimization problem that imposes a limit on the number of arcs that can deviate from the mean. The percentile equilibrium is difficult to compute because minimizing a percentile among all paths is computationally hard. Instead, the added-variability and robust Wardrop equilibria can be computed efficiently in practice: The former reduces to a standard Wardrop equilibrium problem and the latter is found using a column generation approach that repeatedly solves robust shortest path problems, which are polynomially solvable. Through computational experiments of some random and some realistic instances, we explore the benefits and trade-offs of the proposed solution concepts. We show that when agents are risk averse, both the robust and added-variability equilibria better approximate percentile equilibria than the classic Wardrop equilibrium.","PeriodicalId":343564,"journal":{"name":"Economics of Networks","volume":"107 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"82","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Economics of Networks","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.2139/ssrn.987104","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 82

Abstract

Network games can be used to model competitive situations in which agents select routes to minimize their cost. Common applications include traffic, telecommunication, and distribution networks. Although traditional network models have assumed that realized costs only depend on congestion, in most applications they also have an uncertain component. We extend the traffic assignment problem first proposed by Wardrop in 1952 by adding random deviations, which are independent of the flow, to the cost functions that model congestion in each arc. We map these uncertainties into a Wardrop equilibrium model with nonadditive path costs. The cost on a path is given by the sum of the congestion on its arcs plus a constant safety margin that represents the agents' risk aversion. First, we prove that an equilibrium for this game always exists and is essentially unique. Then, we introduce three specific equilibrium models that fall within this framework: the percentile equilibrium where agents select paths that minimize a specified percentile of the uncertain cost; the added-variability equilibrium where agents add a multiple of the variability of the cost of each arc to the expected cost; and the robust equilibrium where agents select paths by solving a robust optimization problem that imposes a limit on the number of arcs that can deviate from the mean. The percentile equilibrium is difficult to compute because minimizing a percentile among all paths is computationally hard. Instead, the added-variability and robust Wardrop equilibria can be computed efficiently in practice: The former reduces to a standard Wardrop equilibrium problem and the latter is found using a column generation approach that repeatedly solves robust shortest path problems, which are polynomially solvable. Through computational experiments of some random and some realistic instances, we explore the benefits and trade-offs of the proposed solution concepts. We show that when agents are risk averse, both the robust and added-variability equilibria better approximate percentile equilibria than the classic Wardrop equilibrium.
具有风险规避用户的Wardrop均衡
网络游戏可以用来模拟竞争情况,在这种情况下,代理人选择路线以使其成本最小化。常见的应用包括交通、电信和配电网络。尽管传统的网络模型假设实现成本仅取决于拥塞,但在大多数应用中,它们也有不确定的成分。我们扩展了Wardrop在1952年首次提出的交通分配问题,将随机偏差(与流量无关)添加到每个弧线上模拟拥堵的成本函数中。我们将这些不确定性映射到具有非加性路径成本的Wardrop均衡模型中。路径上的成本由其弧线上的拥塞加上代表代理风险厌恶的恒定安全边际的总和给出。首先,我们证明了这个博弈的均衡总是存在并且本质上是唯一的。然后,我们介绍了属于该框架的三个特定均衡模型:百分位均衡,其中主体选择最小化不确定成本的指定百分位数的路径;在增加可变性平衡中,代理人将每条弧线成本的可变性增加到预期成本的倍数;在鲁棒均衡中,智能体通过解决鲁棒优化问题来选择路径该优化问题限制了偏离均值的弧线数量。百分位平衡很难计算,因为在所有路径中最小化百分位是很难计算的。相反,在实践中可以有效地计算附加变异性和鲁棒Wardrop平衡:前者简化为标准Wardrop平衡问题,后者使用列生成方法重复求解鲁棒最短路径问题,这些问题是多项式可解的。通过一些随机和一些现实实例的计算实验,我们探讨了所提出的解决方案概念的优点和权衡。我们表明,当主体是风险厌恶者时,稳健均衡和增加可变性均衡都比经典的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学术官方微信