{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T23:05:14Z","timestamp":1725750314690},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642409349"},{"type":"electronic","value":"9783642409356"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-40935-6_7","type":"book-chapter","created":{"date-parts":[[2013,9,27]],"date-time":"2013-09-27T01:14:50Z","timestamp":1380244490000},"page":"83-97","source":"Crossref","is-referenced-by-count":1,"title":["On Competitive Recommendations"],"prefix":"10.1007","author":[{"given":"Jara","family":"Uitto","sequence":"first","affiliation":[]},{"given":"Roger","family":"Wattenhofer","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"7_CR1","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/S0304-3975(97)00026-1","volume":"197","author":"S. Albers","year":"1998","unstructured":"Albers, S.: A Competitive Analysis of the List Update Problem with Lookahead. Theoretical Computer Science\u00a0197, 95\u2013109 (1998)","journal-title":"Theoretical Computer Science"},{"key":"7_CR2","doi-asserted-by":"crossref","unstructured":"Alon, N., Awerbuch, B., Azar, Y., Patt-Shamir, B.: Tell Me Who I Am: An Interactive Recommendation System. In: 18th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA (2006)","DOI":"10.1145\/1148109.1148111"},{"key":"7_CR3","doi-asserted-by":"crossref","unstructured":"Awerbuch, B., Patt-Shamir, B., Peleg, D., Tuttle, M.: Collaboration of Untrusting Peers with Changing Interests. In: Proceedings of the 5th ACM Conference on Electronic Commerce (2004)","DOI":"10.1145\/988772.988789"},{"key":"7_CR4","unstructured":"Awerbuch, B., Patt-Shamir, B., Peleg, D., Tuttle, M.R.: Improved Recommendation Systems. In: 16th ACM-SIAM Symposium on Discrete Algorithms (SODA) (2005)"},{"key":"7_CR5","doi-asserted-by":"crossref","unstructured":"Azar, Y., Gamzu, I.: Ranking with Submodular Valuations. In: Proceedings of the 22nd Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1070\u20131079 (2011)","DOI":"10.1137\/1.9781611973082.81"},{"key":"7_CR6","doi-asserted-by":"crossref","unstructured":"Babu, S., Motwani, R., Munagala, K., Nishizawa, I., Widom, J.: Adaptive Ordering of Pipelined Stream Filters. In: ACM SIGMOD International Conference on Management of Data (2004)","DOI":"10.1145\/1007568.1007615"},{"issue":"2","key":"7_CR7","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1006\/inco.1997.2677","volume":"140","author":"A. Bar-Noy","year":"1998","unstructured":"Bar-Noy, A., Bellare, M., Halld\u00f3rsson, M.M., Shachnai, H., Tamir, T.: On Chromatic Sums and Distributed Resource Allocation. Information and Computation\u00a0140(2), 183\u2013202 (1998)","journal-title":"Information and Computation"},{"key":"7_CR8","doi-asserted-by":"publisher","first-page":"945","DOI":"10.1287\/moor.1080.0330","volume":"33","author":"B. Dean","year":"2008","unstructured":"Dean, B., Goemans, M., Vondr\u00e1k, J.: Approximating the Stochastic Knapsack Problem: The Benefit of Adaptivity. Mathematics of Operations Research\u00a033, 945\u2013964 (2008)","journal-title":"Mathematics of Operations Research"},{"key":"7_CR9","doi-asserted-by":"crossref","unstructured":"Drineas, P., Kerenidis, I., Raghavan, P.: Competitive Recommendation Systems. In: 34th ACM Symposium on Theory of Computing (STOC) (2002)","DOI":"10.1145\/509907.509922"},{"key":"7_CR10","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/s00453-004-1110-5","volume":"40","author":"U. Feige","year":"2004","unstructured":"Feige, U., Lov\u00e1sz, L., Tetali, P.: Approximating Min Sum Set Cover. Algorithmica\u00a040, 219\u2013234 (2004)","journal-title":"Algorithmica"},{"key":"7_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"532","DOI":"10.1007\/11682462_50","volume-title":"LATIN 2006: Theoretical Informatics","author":"M.X. Goemans","year":"2006","unstructured":"Goemans, M.X., Vondr\u00e1k, J.: Stochastic Covering and Adaptivity. In: Correa, J.R., Hevia, A., Kiwi, M. (eds.) LATIN 2006. LNCS, vol.\u00a03887, pp. 532\u2013543. Springer, Heidelberg (2006)"},{"issue":"3","key":"7_CR12","first-page":"245","volume":"20","author":"A. Sally","year":"1993","unstructured":"Sally, A., Goldman, R.E.: Schapire, and Ronald\u00a0L. Rivest. Learning Binary Relations and Total Orders. SIAM Journal of Computing\u00a020(3), 245\u2013271 (1993)","journal-title":"SIAM Journal of Computing"},{"key":"7_CR13","first-page":"427","volume":"42","author":"D. Golovin","year":"2011","unstructured":"Golovin, D., Krause, A.: Adaptive Submodularity: Theory and Applications in Active Learning and Stochastic Optimization. Journal of Artificial Intelligence Research (JAIR)\u00a042, 427\u2013486 (2011)","journal-title":"Journal of Artificial Intelligence Research (JAIR)"},{"key":"7_CR14","unstructured":"Grove, E.: Online Bin Packing with Lookahead. In: Proceedings of the Sixth Annual ACM-SIAM Symposium on Discrete algorithms (1995)"},{"key":"7_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"690","DOI":"10.1007\/978-3-642-14165-2_58","volume-title":"Automata, Languages and Programming","author":"A. Gupta","year":"2010","unstructured":"Gupta, A., Nagarajan, V., Ravi, R.: Approximation Algorithms for Optimal Decision Trees and Adaptive TSP Problems. In: Abramsky, S., Gavoille, C., Kirchner, C., Meyer auf der Heide, F., Spirakis, P.G. (eds.) ICALP 2010. LNCS, vol.\u00a06198, pp. 690\u2013701. Springer, Heidelberg (2010)"},{"key":"7_CR16","doi-asserted-by":"crossref","unstructured":"Kaplan, H., Kushilevitz, E., Mansour, Y.: Learning with Attribute Costs. In: 37th ACM Symposium on Theory of Computing (STOC) (2005)","DOI":"10.1145\/1060590.1060644"},{"key":"7_CR17","doi-asserted-by":"crossref","unstructured":"Liu, Z., Parthasarathy, S., Ranganathan, A., Yang, H.: Near-Optimal Algorithms for Shared Filter Evaluation in Data Stream Systems. In: Proceedings of the 2008 ACM SIGMOD International Conference on Management of Data (2008)","DOI":"10.1145\/1376616.1376633"},{"key":"7_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/978-3-540-30570-5_6","volume-title":"Database Theory - ICDT 2005","author":"K. Munagala","year":"2005","unstructured":"Munagala, K., Babu, S., Motwani, R., Widom, J.: The Pipelined Set Cover Problem. In: Eiter, T., Libkin, L. (eds.) ICDT 2005. LNCS, vol.\u00a03363, pp. 83\u201398. Springer, Heidelberg (2005)"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Learning Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-40935-6_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,17]],"date-time":"2019-05-17T11:19:06Z","timestamp":1558091946000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-40935-6_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642409349","9783642409356"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40935-6_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}