CombOpt Reading Group | Kanstantsin Pashkovich, Nearly Tight Upper Bound for Matroid Intersection Prophet Inequality

Abstract: In this talk, I will go over the construction that shows a lower bound of d/log(d) for the prophet inequality, where the feasible set is the intersection of d matroids. This talk is based on the paper "A Nearly Tight Lower Bound for Matroid Intersection Prophet Inequalities" by Dimitris Fotakis, Charalampos Platanos, Thanos Tolias.