Using piecewise-constant congestion taxing policy in repeated routing games
2015 (English)In: SIAM Conference on Control and Its Applications 2015, 2015, 274-281 p.Conference paper (Refereed)Text
We consider repeated routing games with piecewise-constant congestion taxing in which a central planner sets and announces the congestion taxes for fixed windows of time in advance. Specifically, congestion taxes are calculated using marginal congestion pricing based on the flow of the vehicles on each road prior to the beginning of the taxing window. The piecewise-constant taxing policy in motivated by that users or drivers may dislike fast-changing prices and that they also prefer prior knowledge of the prices. We prove that the multiplicative update rule converges to a socially optimal flow when using vanishing step sizes. Considering that the algorithm cannot adapt itself to a changing environment when using vanishing step sizes, we propose using constant step sizes in this case. Then, however, we can only prove the convergence of the dynamics to a neighborhood of the socially optimal flow (with its size being of the order of the selected step size).
Place, publisher, year, edition, pages
2015. 274-281 p.
Costs, Changing environment, Congestion pricing, Constant step sizes, Multiplicative updates, Optimal flows, Piece-wise constants, Prior knowledge, Step size, Traffic congestion
IdentifiersURN: urn:nbn:se:kth:diva-187522ScopusID: 2-s2.0-84961933697ISBN: 9781510811539OAI: oai:DiVA.org:kth-187522DiVA: diva2:937021
SIAM Conference on Control and Its Applications 2015, 8 July 2015 through 10 July 2015
QC 201606142016-06-142016-05-252016-06-14Bibliographically approved