Optimization with Uniform Size Queries.

Consider the problem of selecting k items that maximize the value of a monotone submodular set function f, where f can be accessed using value queries. It is well known that polynomially many queries suffice in order to obtain an approximation ratio of $$1 - \frac{1}{e}$$ . We consider a variation on this problem in which the value queries are required to be of uniform size: each queried set, like the desired solution itself, must contain k items. We show that polynomially many uniform size queries suffice in order to obtain an approximation ratio of $$\frac{1}{2}$$ , and that an approximation ratio of $$\frac{1 + \epsilon }{2}$$ requires a number of queries that is exponential in $$\epsilon k$$ . For the interesting special case of coverage functions, we show that an approximation ratio strictly better than $$\frac{1}{2}$$ is attainable with polynomially many uniform size queries. The 'uniform size' requirement is motivated by situations in which a firm may offer a menu of exactly k items to its clients, where k is a parameter determined by external considerations. Performing a query corresponds to physically changing the identities of the items offered, and the reply to the query is deduced by observing the behavior of clients in response to the change. Queries that involve a number of items that differs from k may not be desirable due to these external considerations. In such situations it is natural to ask whether the same approximation ratios that can be guaranteed by general value queries can also be obtained by uniform size queries. [ABSTRACT FROM AUTHOR]