BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//University of Liverpool Computer Science Seminar System//v2//EN
BEGIN:VEVENT
DTSTAMP:20260922T052421Z
UID:Seminar-EcCo-587@lxserverM.csc.liv.ac.uk
ORGANIZER:CN=Nicos 	Protopapas:MAILTO:N.Protopapas@liverpool.ac.uk
DTSTART:20181121T130000
DTEND:20181121T140000
SUMMARY:Economics and Computation Series
DESCRIPTION:Rasmus Ibsen-Jensen: Generic Event Prediction and the Big Match\n\nI will define the Generic Event Prediction problem (essentially: Predict when an event is going to occour before it does so, as well as possible, without any prior knowledge about the event). All known good strategies for the Big Match can be viewed as solutions to the Generic Event Prediction problem. I will therefore talk a bit about that game and previous and my results about good strategies for it. Last time, I came with a lot of unsubstantiated claims about how to solve the generic event prediction problem I presented. This time I will prove some of them.\n\nThese results are joint works with (subsets of) Kristoffer Arnsfelt Hansen, Michal Koucky and Abraham Neyman.\nThe works appeared in EC'18 and SAGT'16 (Some of my results that have not appeared yet will be mentioned.).\n\nhttps://www.csc.liv.ac.uk/research/seminars/abstract.php?id=587
LOCATION:
END:VEVENT
END:VCALENDAR