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

  Browse A-Z

Log in

University Account External (via Google)

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹī¸ Information

Games on trees

Download to your calendar using vCal

  • UserOmer Angel (UBC) Speaker website
  • 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.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

Rooms SG1 & SG2, Alison Richard Building, 7 West Road, Cambridge, CB3 9DT SW 01, Computer Laboratory, William Gates Builiding Cambridge Carbon Nanotechnology Society

Other talks

Cambridge RNA Club - IN PERSON Formal Dinner at Selwyn College How Far Can Good Go Without God? The Limits of a Naturalistic Ethic TBC Title and abstract tba Title to be confirmed
 

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