کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
1131758 | 1488965 | 2015 | 21 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
A piecewise-constant congestion taxing policy for repeated routing games
ترجمه فارسی عنوان
یک سیاست مالیات بر درآمد ثابت و ثابت برای بازی های مسیریابی مکرر
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
نظریه بازی، کنترل، شبکه های، قیمت گذاری، ترافیک،
موضوعات مرتبط
علوم انسانی و اجتماعی
علوم تصمیم گیری
علوم مدیریت و مطالعات اجرایی
چکیده انگلیسی
In this paper, 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 (and, hence, there is a time-varying delay in setting the congestion taxes). We motivate the piecewise-constant taxing policy by that users or drivers may dislike fast-changing prices and that they also prefer prior knowledge of the prices. We prove for this model that the multiplicative update rule and the discretized replicator dynamics converge 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 adopting 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 the size of the neighbourhood being of the order of the selected step size). The results are illustrated on a nonlinear version of Pigou's famous routing game.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Transportation Research Part B: Methodological - Volume 78, August 2015, Pages 123-143
Journal: Transportation Research Part B: Methodological - Volume 78, August 2015, Pages 123-143
نویسندگان
Farhad Farokhi, Karl H. Johansson,