{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T23:05:15Z","timestamp":1725750315185},"publisher-location":"Berlin, Heidelberg","reference-count":25,"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_6","type":"book-chapter","created":{"date-parts":[[2013,9,27]],"date-time":"2013-09-27T01:14:50Z","timestamp":1380244490000},"page":"68-82","source":"Crossref","is-referenced-by-count":4,"title":["Combinatorial Online Prediction via Metarounding"],"prefix":"10.1007","author":[{"given":"Takahiro","family":"Fujita","sequence":"first","affiliation":[]},{"given":"Kohei","family":"Hatano","sequence":"additional","affiliation":[]},{"given":"Eiji","family":"Takimoto","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"2","key":"6_CR1","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1007\/s00453-008-9211-1","volume":"57","author":"N. Ailon","year":"2008","unstructured":"Ailon, N.: Aggregation of Partial Rankings, p-Ratings and Top-m Lists. Algorithmica\u00a057(2), 284\u2013300 (2008)","journal-title":"Algorithmica"},{"key":"6_CR2","doi-asserted-by":"crossref","unstructured":"Ailon, N., Charikar, M., Newman, A.: Aggregating inconsistent information: Ranking and clustering. Journal of the ACM\u00a055(5) (2008)","DOI":"10.1145\/1411509.1411513"},{"key":"6_CR3","unstructured":"Audibert, J.-Y., Bubeck, S., Lugosi, G.: Minimax Policies for Combinatorial Prediction Games. In: Proceedings of the 24th Annual Conference on Learning Theory (COLT 2011), pp. 107\u2013132 (2011)"},{"issue":"1","key":"6_CR4","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1002\/rsa.10033","volume":"20","author":"D.R. Carr","year":"2002","unstructured":"Carr, D.R., Vempala, S.: Randomized metarounding. Random Structure and Algorithms\u00a020(1), 343\u2013352 (2002)","journal-title":"Random Structure and Algorithms"},{"key":"6_CR5","doi-asserted-by":"crossref","unstructured":"Cesa-Bianchi, N., Lugosi, G.: Prediction, Learning, and Games. Cambridge University Press (2006)","DOI":"10.1017\/CBO9780511546921"},{"key":"6_CR6","unstructured":"Cesa-Bianchi, N., Lugosi, G.: Combinatorial Bandits. In: Proceedings of the 22nd Conference on Learning Theory (2009)"},{"key":"6_CR7","doi-asserted-by":"crossref","unstructured":"Cover, T., Thomas, J.: Elements of Information Theory. Wiley (1991)","DOI":"10.1002\/0471200611"},{"issue":"1","key":"6_CR8","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1006\/jcss.1997.1504","volume":"55","author":"Y. Freund","year":"1997","unstructured":"Freund, Y., Schapire, R.E.: A Decision-Theoretic Generalization of On-Line Learning and an Application to Boosting. Journal of Computer and System Sciences\u00a055(1), 119\u2013139 (1997)","journal-title":"Journal of Computer and System Sciences"},{"key":"6_CR9","doi-asserted-by":"publisher","first-page":"656","DOI":"10.1137\/S0895480192243516","volume":"7","author":"M. Goemans","year":"1994","unstructured":"Goemans, M., Williamson, D.: New 3\/4-approximation algorithms for the maximum satisfiability problem. SIAM Journal on Discrete Mathematics\u00a07, 656\u2013666 (1994)","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"6_CR10","doi-asserted-by":"crossref","unstructured":"Hazan, E.: The convex optimization approach to regret minimization. In: Sra, S., Nowozin, S., Wright, S.J. (eds.) Optimization for Machine Learning, ch.\u00a010, pp. 287\u2013304. MIT Press (2011)","DOI":"10.7551\/mitpress\/8996.003.0012"},{"key":"6_CR11","first-page":"1705","volume":"10","author":"D.P. Helmbold","year":"2009","unstructured":"Helmbold, D.P., Warmuth, M.K.: Learning Permutations with Exponential Weights. Journal of Machine Learning Research\u00a010, 1705\u20131736 (2009)","journal-title":"Journal of Machine Learning Research"},{"key":"6_CR12","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1137\/0211045","volume":"11","author":"D.S. Hochbaum","year":"1982","unstructured":"Hochbaum, D.S.: Approximation algorithms for the set covering and vertex cover problems. SIAM Journal on Computing\u00a011, 555\u2013556 (1982)","journal-title":"SIAM Journal on Computing"},{"issue":"3","key":"6_CR13","doi-asserted-by":"publisher","first-page":"1018","DOI":"10.1137\/070701704","volume":"39","author":"S. Kakade","year":"2009","unstructured":"Kakade, S., Kalai, A.T., Ligett, L.: Playing games with approximation algorithms. SIAM Journal on Computing\u00a039(3), 1018\u20131106 (2009)","journal-title":"SIAM Journal on Computing"},{"issue":"3","key":"6_CR14","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1016\/j.jcss.2004.10.016","volume":"71","author":"A. Kalai","year":"2005","unstructured":"Kalai, A., Vempala, S.: Efficient algorithms for online decision problems. Journal of Computer and System Sciences\u00a071(3), 291\u2013307 (2005)","journal-title":"Journal of Computer and System Sciences"},{"key":"6_CR15","unstructured":"Koolen, W.M., Warmuth, M.K., Kivinen, J.: Hedging Structured Concepts. In: Proceedings of the 23rd Conference on Learning Theory, pp. 93\u2013105 (2010)"},{"key":"6_CR16","doi-asserted-by":"crossref","unstructured":"Schapire, R.E., Freund, Y.: Boosting: Foundation and Algorithms. MIT Press (2012)","DOI":"10.7551\/mitpress\/8291.001.0001"},{"key":"6_CR17","unstructured":"Schrijver, A.: Theory of linear and integer programming. Wiley (1998)"},{"key":"6_CR18","doi-asserted-by":"crossref","unstructured":"Srinivasan, A.: Improved approximations of packing and covering problems. In: 27th ACM Symposium on the Theory of Computing, pp. 268\u2013276 (1995)","DOI":"10.1145\/225058.225138"},{"key":"6_CR19","series-title":"LNAI","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1007\/978-3-642-34106-9_22","volume-title":"Algorithmic Learning Theory","author":"D. Suehiro","year":"2012","unstructured":"Suehiro, D., Hatano, K., Kijima, S., Takimoto, E., Nagano, K.: Online Prediction under Submodular Constraints. In: Bshouty, N.H., Stoltz, G., Vayatis, N., Zeugmann, T. (eds.) ALT 2012. LNCS (LNAI), vol.\u00a07568, pp. 260\u2013274. Springer, Heidelberg (2012)"},{"key":"6_CR20","unstructured":"Warmuth, M., Glocer, K., R\u00e4tsch, G.: Boosting Algorithms for Maximizing the Soft Margin. In: Advances in Neural Information Processing Systems 20 (NIPS 2007), pp. 1585\u20131592 (2007)"},{"key":"6_CR21","first-page":"2287","volume":"9","author":"M.K. Warmuth","year":"2008","unstructured":"Warmuth, M.K., Kuzmin, D.: Randomized Online PCA Algorithms with Regret Bounds that are Logarithmic in the Dimension. Journal of Machine Learning Research\u00a09, 2287\u20132320 (2008)","journal-title":"Journal of Machine Learning Research"},{"key":"6_CR22","doi-asserted-by":"crossref","unstructured":"Williamson, D.P., Shmoys, D.B.: The Design of Approximation ALgorithms. Cambridge University Press (2011)","DOI":"10.1017\/CBO9780511921735"},{"key":"6_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"534","DOI":"10.1007\/978-3-642-25591-5_55","volume-title":"Algorithms and Computation","author":"S. Yasutake","year":"2011","unstructured":"Yasutake, S., Hatano, K., Kijima, S., Takimoto, E., Takeda, M.: Online linear optimization over permutations. In: Asano, T., Nakano, S.-i., Okamoto, Y., Watanabe, O. (eds.) ISAAC 2011. LNCS, vol.\u00a07074, pp. 534\u2013543. Springer, Heidelberg (2011)"},{"key":"6_CR24","unstructured":"Yasutake, S., Hatano, K., Takimoto, E., Takeda, M.: Online Rank Aggregation. In: Proceedings of 4th Asian Conference on Machine Learning (ACML 2012), pp. 539\u2013553 (2012)"},{"key":"6_CR25","unstructured":"Zinkevich, M.: Online convex programming and generalized infinitesimal gradient ascent. In: Proceedings of the Twentieth International Conference on Machine Learning (ICML 2003), pp. 928\u2013936 (2003)"}],"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_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,4]],"date-time":"2023-07-04T17:23:17Z","timestamp":1688491397000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-40935-6_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642409349","9783642409356"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40935-6_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}