12 citations · 55 across the 25 of their papers we have counts for
Showing 2017Show all
2 papers · 1 filter
cs.DS2017
The Price of Information in Combinatorial Optimization
Sahil Singla
Consider a network design application where we wish to lay down a minimum-cost spanning tree in a given graph; however, we only have stochastic information about the edge costs. To…
cs.DS2017
Prophet Secretary for Combinatorial Auctions and Matroids
Soheil Ehsani, MohammadTaghi Hajiaghayi, Thomas Kesselheim +1
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…