Min-max trees
Probability Seminar
17th October 2025, 3:30 pm – 4:30 pm
Fry Building, Fry 2.04
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.
Organisers: Edward Crane, Luke Turvey
Comments are closed.