TechFest Workshop - Theory Day - Session 5
1 141
47.5
Microsoft Research334 тыс
Следующее
11.08.16 – 24727:34Популярные
02.11.23 – 3171:00:50
19.10.23 – 4 7483:36Опубликовано 11 августа 2016, 7:42
Janardhan Kulkarni - Price of Anarchy Bounds Via Duality The price of anarchy (PoA), which quantifies the degradation in the quality of outcomes in a (pure) Nash equilibrium of a game, is of fundamental importance in computational game theory. For many games, a pure NE does not exist, and hence a natural goal is to quantify the inefficiency of notions such as mixed Nash equilibrium and correlated equilibrium, which always exist for finite games. We give a new framework, based on LP and convex programming duality, for bounding the price of anarchy for (coarse) correlated equilibrium. We demonstrate applicability of this framework by giving the first PoA bounds for temporal routing and scheduling games, and alternate proofs for several classical games.
Свежие видео
5 дней – 4504:50
13 дней – 19710:14
26 дней – 69611:42
30 дней – 5780:11Случайные видео
17 дней – 3 94021:17
248 дней – 1281:06
251 день – 2131:10
07.08.22 – 79 10814:43
09.09.21 – 2 46914:05
24.12.18 – 25 4389:55
2 дня – 61953:30
10 дней – 015:08
10 дней – 015:05
11 дней – 59824:52
11 дней – 6990:30
16 дней – 6 9230:43
17 дней – 92 2710:53
1 день – 2 6091:40