Abstract
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.
Similar content being viewed by others
References
Bailly, G., Oulasvirta, A., Brumby, D.P., Howes, A.: Model of visual search and selection time in linear menus. In: CHI’14, pp. 3865–3874 (2014)
Bar-Noy, A., Lampis, M.: Online maximum directed cut. J. Comb. Optim. 24(1), 52–64 (2012)
Blumrosen, L., Nisan, N.: On the computational power of demand queries. SIAM J. Comput. 39(4), 1372–1391 (2009)
Chen, J., Friesen, D.K., Zheng, H.: Tight bound on johnson’s algorithm for maximum satisfiability. J. Comput. Syst. Sci. 58(3), 622–640 (1999)
David, R., Dinur, I., Goldenberg, E., Kindler, G., Shinkar, I.: Direct sum testing. In: ITCS-2015, pp. 327–336 (2015)
Erdos, P., Selfridge, J.: Online maximum directed cut. J. Comb. Theory Ser. A 14(3), 298–301 (1973)
Feige, U.: Threshold of \(\ln n\) for approximating set cover. J. ACM 45(4), 634–652 (1998)
Feige, U., Mirrokni, V.S., Vondrak, J.: Maximizing non-monotone submodular functions. SIAM J. Comput. 40(4), 1133–1153 (2011)
Feige, U., Raghavan, P., Peleg, D., Upfal, E.: Computing with noisy information. SIAM J. Comput. 23(5), 1001–1018 (1994)
Grotschel, M., Lovasz, L., Schrijver, A.: The ellipsoid method and its consequences in combinatorial optimization. Combinatorica 1(2), 169–197 (1981)
Guyon, I., Elisseeff, A.: An introduction to variable and feature selection. J. Mach. Learn. Res. 3, 169–197 (2003)
Laffont, J.-J., Tirole, J.: Using cost observation to regulate firms. J. Polit. Econ. 94, 169–197 (1986)
Lehmann, B., Lehmann, L.J., Nisan, N.: Combinatorial auctions with decreasing marginal utilities. Games Econ. Behav. 55(2), 270–296 (2006)
Nemhauser, G., Wolsey, L., Fisher, M.: An analysis of approximations for maximizing submodular set functions—I. Math. Program. 14, 265–294 (1978)
Radlinski, F., Kleinberg, R., Joachims, T.: Learning diverse rankings with multi-armed bandits. In: ICML-2008, pp. 784–791 (2008)
Raghavan, P.: Probabilistic construction of deterministic algorithms. J. Comput. Syst. Sci. 37(2), 130–143 (1988)
Rogerson, W.P.: Simple menus of contracts in cost-based procurement and regulation. Am. Econ. Rev. 93(3), 919–926 (2003)
Streeter, M.J., Golovin, D., Krause, A.: Online learning of assignments. In: NIPS-2009, pp. 1794–1802 (2009)
Williamson, D.P., Shmoys, D.B.: The Design of Approximation Algorithms. Cambridge University Press, Cambridge (2011)
Acknowledgments
This work was partly done in Microsoft Research, Herzeliya, Israel. The work of the first author was supported in part by the Israel Science Foundation (Grant No. 621/12) and by the I-CORE Program of the Planning and Budgeting Committee and the Israel Science Foundation (Grant No. 4/11).
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Feige, U., Tennenholtz, M. Optimization with Uniform Size Queries. Algorithmica 78, 255–273 (2017). https://doi.org/10.1007/s00453-016-0162-7
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00453-016-0162-7