A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
Ignorance is Almost Bliss

2015
*
Proceedings of the Sixteenth ACM Conference on Economics and Computation - EC '15
*

The stochastic matching problem deals with finding a maximum matching in a graph whose edges are unknown but can be accessed via queries. This is a special case of stochastic k-set packing, where the problem is to find a maximum packing of sets, each of which exists with some probability. In this paper, we provide edge and set query algorithms for these two problems, respectively, that provably achieve some fraction of the omniscient optimal solution. Our main theoretical result for the

doi:10.1145/2764468.2764479
dblp:conf/sigecom/BlumDHPSS15
fatcat:loefmact5rgbveyafmesg6zf64