In transportation networks, users typically choose routes in a decentralized and self-interested manner to minimize their individual travel costs, which, in practice, often results in inefficient overall outcomes for society. As a result, there has been a growing interest in designing road tolling schemes to cope with these efficiency losses and steer users toward a system-efficient traffic pattern. However, the efficacy of road tolling schemes often relies on having access to complete information on users' trip attributes, such as their origin-destination (O-D) travel information and their values of time, which may not be available in practice.
Motivated by this practical consideration, we propose an online learning approach to set tolls in a traffic network to drive heterogeneous users with different values of time toward a system-efficient traffic pattern. In particular, we develop a simple yet effective algorithm that adjusts tolls at each time period solely based on the observed aggregate flows on the roads of the network without relying on any additional trip attributes of users, thereby preserving user privacy. In the setting where the O-D pairs and values of time of users are drawn i.i.d. at each period, we show that our approach obtains an expected regret and road capacity violation of $O(\sqrt{T})$, where $T$ is the number of periods over which tolls are updated. Our regret guarantee is relative to an offline oracle that has complete information on users' trip attributes. We further establish a $Ω(\sqrt{T})$ lower bound on the regret of any algorithm, which establishes that our algorithm is optimal up to constants. Finally, we demonstrate the superior performance of our approach relative to several benchmarks on a real-world transportation network, thereby highlighting its practical applicability.
RouteJudge: An Open Platform for Reproducible and Preference-Aware LLM Routing
School of Artificial Intelligence, Nanjing University(南京大学人工智能学院);National Key Laboratory for Novel Software Technology, Nanjing University(南京大学计算机软件新技术国家重点实验室);SinapisAI
Semi-Gradient SARSA Routing with Theoretical Guarantee on Traffic Stability and Weight Convergence
UM Joint Institute(UM联合研究所);Shanghai Jiao Tong University(上海交通大学);School of Computer Science, Wuhan University(武汉大学计算机学院);School of Electronics, Peking University(北京大学电子学院)
Direct Preference Optimization-Enhanced Multi-Guided Diffusion Model for Traffic Scenario Generation
Pohang University of Science and Technology(浦项科技大学);School of Electrical Engineering, Pohang University of Science and Technology(浦项科技大学电气工程学院);NAVER LABS(NAVER实验室)
Meta-Router: Bridging Gold-standard and Preference-based Evaluations in Large Language Model Routing
Department of Statistics, Indiana University Bloomington(印第安纳大学布卢明顿分校统计系);Department of Statistics, North Carolina State University(北卡罗来纳州立大学统计系);Department of Biostatistics, The University of Texas MD Anderson Cancer Center(德克萨斯大学MD安德森癌症中心生物统计学系)