混合自利和顺从Agent的流量优化
Traffic Optimization For a Mixture of Self-interested and Compliant Agents
摘要:
本文重点介绍了两种常用的路径分配策略的代理穿越拥塞的网络:自利路由,系统最优路由。在自利的路由策略中,每个代理选择一条优化自身效用的路径,而系统最优路由代理则被分配以最大化系统性能为目标的路径。本文考虑了一种情况下,集中式网络管理器希望优化所有代理的效用,即,实施系统最优路由策略。然而,在许多现实生活中的情况下,系统管理器是无法影响所有代理的路由分配,由于有限的影响路由选择决策。出于这样的情况下,计算易处理的方法,计算系统管理员需要影响(兼容的代理),以实现系统的最佳性能的代理的最小数量。此外,该方法还可以确定一组给定的顺从代理是否足以实现系统最优,并计算顺从代理的最优路由分配。实验结果表明,在几个大规模的,现实的交通网络的最佳流量可以实现低至13%的代理是符合和高达54%。
英文摘要:
This paper focuses on two commonly used path assignment policies for agents traversing a congested network: self-interested routing, and system-optimum routing. In the self-interested routing policy each agent selects a path that optimizes its own utility, while the system-optimum routing agents are assigned paths with the goal of maximizing system performance. This paper considers a scenario where a centralized network manager wishes to optimize utilities over all agents, i.e., implement a system-optimum routing policy. In many real-life scenarios, however, the system manager is unable to influence the route assignment of all agents due to limited influence on route choice decisions. Motivated by such scenarios, a computationally tractable method is presented that computes the minimal amount of agents that the system manager needs to influence (compliant agents) in order to achieve system optimal performance. Moreover, this methodology can also determine whether a given set of compliant agents is sufficient to achieve system optimum and compute the optimal route assignment for the compliant agents to do so. Experimental results are presented showing that in several large-scale, realistic traffic networks optimal flow can be achieved with as low as 13% of the agent being compliant and up to 54%.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。