arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1909.03783math.OCcs.SYeess.SY
收藏

不确定费用下路由选择中CVaR-based Wardrop均衡的样本平均逼近

Sample average approximation of CVaR-based Wardrop equilibrium in routing under uncertain costs

Ashish Cherukuri

摘要:

本文主要研究一类具有不确定成本的路由博弈。假设代理人是风险厌恶和选择路径与最小条件风险价值(CVaR)与他们相关,我们定义的概念CVaR为基础的Wardrop均衡(CWE)。我们专注于计算这个平衡的条件下,不确定性的分布是未知的,一组独立和同分布的样本是可用的。为此,我们定义的样本平均近似计划,其中CWE估计与解决方案的变分不等式问题,涉及样本平均近似的CVaR。我们建立了这个方案的两个性质。首先,在成本连续性和不确定性有界的条件下,证明了渐近一致性,建立了随着样本量的增加,近似平衡点几乎必然收敛到CWE。其次,在Lipschitz代价的附加假设下,证明了该算法的指数收敛性,其中近似解与CWE之间的距离小于小于任意常数的概率以指数方式快速逼近1.仿真实例验证了我们的理论研究结果。

英文摘要:

This paper focuses on the class of routing games that have uncertain costs. Assuming that agents are risk-averse and select paths with minimum conditional value-at-risk (CVaR) associated to them, we define the notion of CVaR-based Wardrop equilibrium (CWE). We focus on computing this equilibrium under the condition that the distribution of the uncertainty is unknown and a set of independent and identically distributed samples is available. To this end, we define the sample average approximation scheme where CWE is estimated with solutions of a variational inequality problem involving sample average approximations of the CVaR. We establish two properties for this scheme. First, under continuity of costs and boundedness of uncertainty, we prove asymptotic consistency, establishing almost sure convergence of approximate equilibria to CWE as the sample size grows. Second, under the additional assumption of Lipschitz cost, we prove exponential convergence where the probability of the distance between an approximate solution and the CWE being smaller than any constant approaches unity exponentially fast. Simulation example validates our theoretical findings.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑