Oblivious Online Contention Resolution Schemes
237
Microsoft Research335 тыс
Следующее
12.12.22 – 74030:03Популярные
08.11.23 – 1 3781:52
04.08.23 – 2 4291:04:54Опубликовано 12 декабря 2022, 20:34
2022 Data-driven Optimization Workshop: Oblivious Online Contention Resolution Schemes
Speaker: Hu Fu, Shanghai University of Finance and Economics
Contention resolution schemes (CRSs) are powerful tools for obtaining “ex post feasible” solutions from candidates that are drawn from “ex ante feasible” distributions. Online contention resolution schemes (OCRSs), the online version, have found myriad applications in Bayesian and stochastic problems, such as prophet inequalities and stochastic probing. When the ex ante distribution is unknown, it was unknown whether good CRSs/OCRSs exist with no sample (in which case the scheme is oblivious) or few samples from the distribution.
In this work, we give a simple 1/e-selectable oblivious single item OCRS by mixing two simple schemes evenly, and show, via a Ramsey theory argument, that it is optimal. On the negative side, we show that no CRS or OCRS with O(1) samples can be Ω(1)-balanced/selectable (i.e., preserve every active candidate with a constant probability) for graphic or transversal matroids.
Speaker: Hu Fu, Shanghai University of Finance and Economics
Contention resolution schemes (CRSs) are powerful tools for obtaining “ex post feasible” solutions from candidates that are drawn from “ex ante feasible” distributions. Online contention resolution schemes (OCRSs), the online version, have found myriad applications in Bayesian and stochastic problems, such as prophet inequalities and stochastic probing. When the ex ante distribution is unknown, it was unknown whether good CRSs/OCRSs exist with no sample (in which case the scheme is oblivious) or few samples from the distribution.
In this work, we give a simple 1/e-selectable oblivious single item OCRS by mixing two simple schemes evenly, and show, via a Ramsey theory argument, that it is optimal. On the negative side, we show that no CRS or OCRS with O(1) samples can be Ω(1)-balanced/selectable (i.e., preserve every active candidate with a constant probability) for graphic or transversal matroids.
Свежие видео
5 дней – 1 073 2401:00
8 дней – 1 2570:35
12 дней – 1061:53
12 дней – 26 0902:39Случайные видео
166 дней – 2 0230:33
192 дня – 3 37031:23
296 дней – 106 2639:40
06.12.23 – 25 02941:46
21.03.22 – 7140:43
03.01.07 – 66 6540:33
2 дня – 9570:08
4 дня – 684:07
4 дня – 233:13
12 дней – 15 06535:30
12 дней – 41 1303:44
4 дня – 1 1331:41