During Michaelmas Term, OxTalks will be moving to a new platform (full details are available on the Staff Gateway).
For now, continue using the current page and event submission process (freeze period dates to be advised).
If you have any questions, please contact halo@digital.ox.ac.uk
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 receives from player 2 the cumulative sum of the values along the chosen path. We show that in some cases the value of this game converges as n\to\infty. Joint with Gourab Ray and Yinon Spinka.
