Name
Abstract | ||
|---|---|---|
We consider the toll design problem for non-atomic routing games with stochastic demands. Different from standard toll design problems where the demand for each origin-destination pair is a fixed number, the stochastic demand for each origin-destination pair is a random variable following a specified and known distribution. Our goal is to obtain a toll design for the traffic network to minimize a global cost function, that can, e.g., be the price of anarchy. We formulate the problem into a mathematical program with equilibrium constraints. We then develop a two-loop stochastic algorithm to solve this optimization. Our algorithm is guaranteed to converge to a solution under some assumptions. A numerical example is presented to illustrate the efficacy of our method. |
Year | DOI | Venue |
|---|---|---|
2022 | 10.1109/LCSYS.2022.3186241 | IEEE CONTROL SYSTEMS LETTERS |
Keywords | DocType | Volume |
Games, Routing, Costs, Optimized production technology, Behavioral sciences, Uncertainty, Standards, Toll design, routing games, variational inequality | Journal | 6 |
ISSN | Citations | PageRank |
2475-1456 | 0 | 0.34 |
References | Authors | |
0 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yongxin Chen | 1 | 99 | 31.89 |
| V. K. Gupta | 2 | 91 | 12.72 |