BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Computational Optimisation Group - ECPv6.15.11//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-WR-CALNAME:Computational Optimisation Group
X-ORIGINAL-URL:http://optimisation.doc.ic.ac.uk
X-WR-CALDESC:Events for Computational Optimisation Group
REFRESH-INTERVAL;VALUE=DURATION:PT1H
X-Robots-Tag:noindex
X-PUBLISHED-TTL:PT1H
BEGIN:VTIMEZONE
TZID:UTC
BEGIN:STANDARD
TZOFFSETFROM:+0000
TZOFFSETTO:+0000
TZNAME:UTC
DTSTART:20110101T000000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=UTC:20120427T150000
DTEND;TZID=UTC:20120427T150000
DTSTAMP:20260507T013300
CREATED:20170124T102149Z
LAST-MODIFIED:20170124T102149Z
UID:606-1335538800-1335538800@optimisation.doc.ic.ac.uk
SUMMARY:Seminar: Robust Dynamic Risk Measures
DESCRIPTION:Title: Robust Dynamic Risk MeasuresSpeaker: Dimitra BampouAffiliation: Imperial College LondonLocation: Room 218 Huxley Building Time: 3:00pm \nAbstract. Recent progress in the theory of dynamic risk measures has found a strong echo in stochastic programming\, where the time consistency of dynamic decision making under uncertainty is currently under scrutiny. In this talk we first review the concepts of coherence and time consistency of dynamic risk measures and then discuss their ramifications for stochastic programming. Next\, we extend these concepts to stochastic programming models subject to distributional ambiguity\, which motivates us to introduce robust dynamic risk measures. We discuss conditions under which these robust risk measures inherit coherence and time consistency from their nominal counterparts. We also propose an approximation scheme based on polynomial decision rules for solving linear multistage stochastic programs involving robust dynamic risk measures. The theoretical concepts are illustrated through numerical examples in the context of inventory management. \nAbout the speaker.
URL:http://optimisation.doc.ic.ac.uk/event/seminar-robust-dynamic-risk-measures/
END:VEVENT
END:VCALENDAR