A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is
The secretary and the prophet inequality problems are central to the field of Stopping Theory. Recently, there has been a lot of work in generalizing these models to multiple items because of their applications in mechanism design. The most important of these generalizations are to matroids and to combinatorial auctions (extends bipartite matching). Kleinberg-Weinberg [KW12] and Feldman et al. [FGL15] show that for adversarial arrival order of random variables the optimal prophet inequalitiesdoi:10.1137/1.9781611975031.46 dblp:conf/soda/EhsaniHKS18 fatcat:tgumcl4ftbhbpk575oywg5mtue