BEGIN:VCALENDAR
VERSION:2.0
PRODID:icalendar-ruby
CALSCALE:GREGORIAN
METHOD:PUBLISH
BEGIN:VTIMEZONE
TZID:Europe/Vienna
BEGIN:DAYLIGHT
DTSTART:20220327T030000
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
RRULE:FREQ=YEARLY;BYDAY=-1SU;BYMONTH=3
TZNAME:CEST
END:DAYLIGHT
BEGIN:STANDARD
DTSTART:20221030T020000
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
RRULE:FREQ=YEARLY;BYDAY=-1SU;BYMONTH=10
TZNAME:CET
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTAMP:20260404T041456Z
UID:1651069800@ist.ac.at
DTSTART:20220427T163000
DTEND:20220427T172000
DESCRIPTION:Speaker: Gabor Pete\nhosted by M. Beiglböck\, N. Berestycki\, 
 L. Erdös\, J. Maas\, F. Toninelli\nAbstract: Imagine a version of chess\,
  where each player has 100 Forints\, and\, instead of alternating moves\, 
 before each turn they stake some portion of their fortunes\, then flip a c
 oin that is biased according to the stakes\, and the winner of the coin to
 ss makes the next move.This would of course be too difficult to analyze ma
 thematically. Instead\, consider random tug-of-war on graphs\, which is a 
 probabilistic game that was introduced by Peres-Schramm-Sheffield-Wilson (
 JAMS 2009) to aid the analysis of the infinity-Laplace equation\, a singul
 ar elliptic PDE. We introduce the stake-governed version of this game\, an
 d solve it on finite rooted trees\, by finding the Nash equilibria for the
  stakes and moves. Joint work with Alan Hammond.
LOCATION:Heinzel Seminar Room (I21.EG.101)\, Office Building West\, ISTA
ORGANIZER:birgit.oosthuizen-noczil@ist.ac.at
SUMMARY:Gabor Pete: Stake-governed random tug-of-war
URL:https://talks-calendar.ista.ac.at/events/3720
END:VEVENT
END:VCALENDAR