دانلود مقاله ISI انگلیسی شماره 51106
ترجمه فارسی عنوان مقاله

استراتژی استکلبرگ برای مسیریابی جریان در طول زمان

عنوان انگلیسی
A Stackelberg strategy for routing flow over time ☆
کد مقاله سال انتشار تعداد صفحات مقاله انگلیسی
51106 2015 16 صفحه PDF
منبع

Publisher : Elsevier - Science Direct (الزویر - ساینس دایرکت)

Journal : Games and Economic Behavior, Volume 92, July 2015, Pages 232–247

ترجمه کلمات کلیدی
بازی مسیریابی؛ جریان در طول زمان؛ تعادل؛ بهره وری
کلمات کلیدی انگلیسی
C720Routing games; Flows over time; Equilibrium; Efficiency
پیش نمایش مقاله
پیش نمایش مقاله  استراتژی استکلبرگ برای مسیریابی جریان در طول زمان

چکیده انگلیسی

Routing games are studied to understand the impact of individual users' decisions on network efficiency. Most prior work on efficiency in routing games uses a simplified model where all flows exist simultaneously, and users care about either their maximum delay or their total delay. Both these measures are surrogates for measuring how long it takes to get all of a user's traffic through the network. We attempt a more direct study of network efficiency by examining routing games in a flow over time model. Flows over time are commonly used in transportation research. We show that in this model, by reducing network capacity judiciously, the network owner can ensure that the equilibrium is no worse than a small constant times the optimal in the original network, for two natural measures of optimality. These are the first upper bounds on the price of anarchy in this model for general networks.