کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
1142096 957131 2015 5 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
Congestion games viewed from M-convexity
موضوعات مرتبط
مهندسی و علوم پایه ریاضیات ریاضیات گسسته و ترکیبات
پیش نمایش صفحه اول مقاله
Congestion games viewed from M-convexity
چکیده انگلیسی

Congestion games have extensively been studied till recently. It is shown by Fotakis (2010) that for every congestion game on an extension-parallel network, any best-response sequence reaches a pure Nash equilibrium of the game in nn steps, where nn is the number of players. We show that the fast convergence of best-response sequences results from M-convexity (of Murota (1996)) of the potential function associated with the game. We also give a characterization of M-convex functions in terms of greedy algorithms.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Operations Research Letters - Volume 43, Issue 3, May 2015, Pages 329–333
نویسندگان
, , , , ,