OxTalks will soon be transitioning to Oxford Events (full details are available on the Staff Gateway). A two-week publishing freeze is expected in early Hilary to allow all events to be migrated to the new platform. During this period, you will not be able to submit or edit events on OxTalks. The exact freeze dates will be confirmed as soon as possible.
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.
