Nexus Trimester - 2016 - Distributed Computation and Communication Theme

# You can also click the upper-left icon to select videos from the playlist.

source: Institut Henri Poincaré     2016年2月25日

Amin Aminzadeh Gohari (Sharif University of Technology) 48:45
High Probability Guarantees in Repeated Games: Theory and Applications in Information Theory
Amin Aminzadeh Gohari (Sharif University of Technology)
February 05, 2016
Abstract: We introduce a “high probability” framework for repeated games with incomplete information. In our non-equilibrium setting, players aim to guarantee a certain payoff with high probability, rather than in expected value. We provide a high probability counterpart of the classical result of Mertens and Zamir for the zero-sum repeated games. Any payoff that can be guaranteed with high probability can be guaranteed in expectation, but the reverse is not true. Hence, unlike the average payoff case where the payoff guaranteed by each player is the negative of the payoff by the other player, the two guaranteed payoffs would differ in the high probability framework. One motivation for this framework comes from information transmission systems, where it is customary to formulate problems in terms of asymptotically vanishing probability of error. An application of our results to a class of compound arbitrarily varying channels is given.
Péter Gács (Boston University) 2/2 51:31
Yael Kalai (Microsoft Research) 48:20
Boaz Patt-Shamir (Tel Aviv University) 45:18
Prakash Ishwar (Boston University) 58:20
Paris Koutris (University of Wisconsin) 53:23
Leonard Schulman (Caltech) 1:01:54
Klim Efremenko (Tel-Aviv University) 2/2 49:29
Klim Efremenko (Tel-Aviv University) 1/2 52:43
Yael Kalai (Microsoft Research) 55:02
Thomas Courtade (UC-Berkeley) 53:30
Ofer Feinerman (Weizmann Institute) 52:06
Anup Rao (University of Washington) 3/3 54:02
Anup Rao (University of Washington) 2/3 56:46
Amos Korman (CNRS/LIAFA) 42:00
Ran Gelles (Princeton University) 2/2 51:37
Ran Gelles (Princeton University) 1/2 55:42
Omri Weinstein (Courant Institute (NYU)) 6/6 50:56
Omri Weinstein (Courant Institute (NYU)) 5/6 56:45
Badih Ghazi (MIT) 55:08
Alex Sprintson (Texas A&M) 43:33
Omri Weinstein (Courant Institute (NYU)) 4/6 1:12:42
Omri Weinstein (Courant Institute (NYU)) 3/6 49:36
Michael Langberg (SUNY at Buffalo) 53:42
Allison Bishop (Columbia) 46:55
Stephan Sebastian Holzer (MIT) 50:40
János Körner (Sapienza University of Rome) 55:23
Chandra Nair (Chinese University of Hong Kong) 2/2 51:22
Anup Rao (University of Washington) 1/3 55:16
Omri Weinstein (Courant Institute (NYU)) 2/6 55:41
Dan Suciu (University of Washington) 51:26
Chandra Nair (Chinese University of Hong Kong) 1/2 46:30
Cédric Villani (Université de Lyon / Institut Henri Poincaré) 1:06:49
Péter Gács (Boston University) 50:40
Marius Zimand (Towson University) 1:01:54
Yoram Moses (Technion) 2/2 56:17
Yoram Moses (Technion) 1/2 58:10
Andrei Romashchenko (LIRMM) 56:14
George Giakkoupis (INRIA) 58:00
Alexander Shen (LIRMM, Montpellier) 2/2 51:36
Alexander Shen (LIRMM, Montpellier) 1/2 1:02:20
Arkadev Chattopadhyay (TIFR) 57:06