BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Eurandom - ECPv5.9.1//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-WR-CALNAME:Eurandom
X-ORIGINAL-URL:https://www.eurandom.tue.nl
X-WR-CALDESC:Events for Eurandom
BEGIN:VTIMEZONE
TZID:UTC
BEGIN:STANDARD
TZOFFSETFROM:+0000
TZOFFSETTO:+0000
TZNAME:UTC
DTSTART:20210101T000000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=UTC:20210309T154500
DTEND;TZID=UTC:20210309T164500
DTSTAMP:20210920T222238
CREATED:20210301T102100Z
LAST-MODIFIED:20210408T101713Z
UID:3970-1615304700-1615308300@www.eurandom.tue.nl
SUMMARY:Eindhoven SPOR Seminar
DESCRIPTION:Tim Oosterwijk (UM) \nThe secretary problem with independent sampling \nSequential decision making under uncertainty is a basic problem that bridges several areas. Examples include online algorithms in computer science\, and optimal stopping problems with stochastic input in the field of operations research and applied probability. \nIn this talk\, I will discuss the secretary problem\, where we are faced with an online sequence of elements with values. Upon seeing an element we have to make an irrevocable take-it-or-leave-it decision. The goal is to maximize the probability of picking the element of maximum value. \nWe aim to quantify the relation between having more a priori information at our disposal regarding the online values and the success probability we can obtain. We do this by sampling each element independently with a fixed probability p before starting the online sequence. For both the adversarial order case and the random order case\, we obtain best possible algorithms for every value of p. \nVIDEOSTREAM
URL:https://www.eurandom.tue.nl/event/eindhoven-stochastics-seminar-66/
LOCATION:MS Teams
CATEGORIES:STO Seminar
END:VEVENT
END:VCALENDAR