| COOKIES: By using this website you agree that we can place Google Analytics Cookies on your device for performance monitoring. | ![]() |
Games on treesAdd to your list(s) Download to your calendar using vCal
If you have a question about this talk, please contact Perla Sousi. On a regular tree, assign each vertex a random independent value. Two players alternate choosing a child of the current vertex. When reaching level n, player 1 pays player 2 the cumulative sum of the values along the chosen path. We show that in certain cases the value of this game converges as n\to\infty, and discuss the challenges in extending our results. Joint with Gourab Ray and Yinon Spinka. This talk is part of the Probability series. This talk is included in these lists:
Note that ex-directory lists are not shown. |
Other listsMy Interesting Talks Art Cell Gallery Blue World Citi is approved by RDAOther talksGates Cambridge presents Ben Weissenbach, Author of 'North to the Future' Introduction to Day 2 Constructing Radio Foreground Maps with REACH Good COP, Bad COP: first reflections on COP30 Setting the Scene Detecting Policy Signals in National Deforestation Trajectories across the Tropics |