Ερευνητική Ομιλία Paul Duetting, Πέμπτη 29/3, 1μμ

Την Πέμπτη 29 Μαρτίου 2018, ώρα 1:00, στην αίθουσα συνεδριάσεων (ΑΣ) του Τμήματος Μηχανικών Η/Υ & Πληροφορικής (ισόγειο, Κτίριο Β), θα δοθεί ομιλία με τίτλο “Prophet inequalities made easy: stochastic optimization by pricing non-stochastic inputs” από τον Paul Duetting, Επίκουρο Καθηγητή στο London School of Economics. Ακολουθεί περίληψη της ομιλίας.

===================

Abstract: We present a general framework for stochastic online maximization problems with combinatorial feasibility constraints. The framework establishes prophet inequalities by constructing price-based online approximation algorithms, a natural extension of threshold algorithms for settings beyond binary selection. Our analysis takes the form of an extension theorem: we derive sufficient conditions on prices when all weights are known in advance, then prove that the resulting approximation guarantees extend directly to stochastic settings. Our framework unifies and simplifies much of the existing literature on prophet inequalities and posted price mechanisms, and is used to derive new and improved results for combinatorial markets (with and without complements), multi-dimensional matroids, and sparse packing problems. Finally, we highlight a surprising connection between the smoothness framework for bounding the price of anarchy of mechanisms and our  framework,  and show that many smooth mechanisms can be recast as posted price mechanisms with comparable performance guarantees.

Joint work with Michal Feldman, Thomas Kesselheim, and Brendan Lucier

Πληροφορίες για τον ομιλητή: http://paulduetting.com/
 

Μετάβαση στο περιεχόμενο