BEGIN:VCALENDAR
VERSION:2.0
METHOD:PUBLISH
PRODID:-//209.200.118.155//NONSGML iCalcreator 2.2.8//
BEGIN:VEVENT
DTSTAMP:20140725T050420
LAST-MODIFIED:20130320T152700
CREATED:20121128T120000
SEQUENCE:1
CATEGORIES:DRO
DTSTART:20130328T170000Z
DTEND:20130328T180000Z
UID:94de1cac-4603-11e2-9cca-00259064d38a11282012@gsb.columbia.edu
SUMMARY;ENCODING=QUOTED-PRINTABLE:DRO Seminar: Dimitris Bertsimas (MIT)
LOCATION:Uris 3rd Floor - 333, 3022 Broadway, New York, NY 10027
URL:http://groups.gsb.columbia.edu/rsvp.aspx?id=137108
DESCRIPTION:\nTitle: A Computationally Tractable Theory of Performance Analysis in Stochastic Systems. . Abstract: Modern probability theory, whose foundation is based on the axioms set forth by Kolmogorov, is currently the major tool for performance analysis in stochastic systems. While it offers insights in understanding such systems, probability theory is really not a computationally tractable theory. Correspondingly, some of its major areas of application remain unsolved when the underlying systems become multidimensional: Queueing networks, network information theory, pricing multi-dimensional financial contracts, auction design in multi-item, multi-bidder auctions among others. . . . . We propose a new approach to analyze stochastic systems based on robust optimization. The key idea is to replace the Kolmogorov axioms as primitives of probability theory, with some of the asymptotic implications of probability theory: the central limit theorem and law of large numbers and to define appropriate robust optimization problems to perform performance analysis. In this way, the performance analysis questions become highly structured optimization problems (linear, conic, mixed integer) for which there exist efficient, practical algorithms that are capable of solving truly large scale systems. . . . . We demonstrate that the proposed approach achieves computationally tractable methods for (a) analyzing queueing systems in the transient domain and queueing networks in the steady-state domain, (b) characterizing the capacity region of network information theory and associated coding and decoding methods generalizing the work of Shannon, (c) pricing multi-dimensional financial contracts generalizing the work of Black, Scholes and Merton, (d) designing multi-item, multi-bidder auctions generalizing the work of Myerson. . . . . This is joint work with my doctoral students at MIT Chaithanya Bandi and Nataly Youssef. . . . . . . \nEvent Organizer: Clara Magram (cm2126@columbia.edu)\n---\nRSVP: http://groups.gsb.columbia.edu/rsvp.aspx?id=137108\n---\n[EVENT_TYPE:Research]\n[GROUP_TYPE:Academic Offices]\n
BEGIN:VALARM
TRIGGER:-PT15M
ACTION:DISPLAY
DESCRIPTION:Reminder
END:VALARM
END:VEVENT
END:VCALENDAR