Talks.cam will close on 1 July 2026, further information is available on the UIS Help Site
 

University of Cambridge > Talks.cam > Probability > Games on trees

Games on trees

Add to your list(s) Download to your calendar using vCal

  • UserOmer Angel (UBC) World_link
  • ClockTuesday 04 November 2025, 14:00-15:00
  • HouseMR12.

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.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

 

© 2006-2025 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity