Min-max trees
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.
Date: 13 October 2025, 14:00
Venue: Mathematical Institute, Woodstock Road OX2 6GG
Speaker: Omer Angel (UBC)
Organising department: Department of Statistics
Organisers: Christina Goldschmidt (Department of Statistics, University of Oxford), James Martin (Department of Statistics, University of Oxford)
Part of: Probability seminar
Booking required?: Not required
Audience: Public
Editors: Christina Goldschmidt, James Martin