{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:19:49Z","timestamp":1750306789451,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":14,"publisher":"ACM","license":[{"start":{"date-parts":[[2014,1,12]],"date-time":"2014-01-12T00:00:00Z","timestamp":1389484800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2014,1,12]]},"DOI":"10.1145\/2554797.2554817","type":"proceedings-article","created":{"date-parts":[[2014,1,14]],"date-time":"2014-01-14T13:40:06Z","timestamp":1389706806000},"page":"195-206","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["Sequential decision making with vector outcomes"],"prefix":"10.1145","author":[{"given":"Yossi","family":"Azar","sequence":"first","affiliation":[{"name":"Tel Aviv University, Tel Aviv, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Uriel","family":"Felge","sequence":"additional","affiliation":[{"name":"Weizmann Institute, Rechovot, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michal","family":"Feldman","sequence":"additional","affiliation":[{"name":"Tel Aviv University, Tel Aviv, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Moshe","family":"Tennenholtz","sequence":"additional","affiliation":[{"name":"Microsoft Research, Herzliya, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2014,1,12]]},"reference":[{"key":"e_1_3_2_1_1_1","first-page":"773","volume-title":"In Proceedings of the 22nd Annual Conference on Learning Theory","author":"Audibert J. Y.","year":"2004","unstructured":"J. Y. Audibert , U. P. Est , and S. Bubeck . Minimax policies for adversarial and stochastic bandits , in. In Proceedings of the 22nd Annual Conference on Learning Theory , Omnipress , pages 773 -- 818 , 2004 . J. Y. Audibert, U. P. Est, and S. Bubeck. Minimax policies for adversarial and stochastic bandits, in. In Proceedings of the 22nd Annual Conference on Learning Theory, Omnipress, pages 773--818, 2004."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539701398375"},{"key":"e_1_3_2_1_3_1","first-page":"897","volume-title":"Proceedings of the 11th International Conference on Autonomous Agents and Multiagent Systems -","volume":"2","author":"Azar Y.","year":"2012","unstructured":"Y. Azar , U. Feige , M. Tennenholtz , and M. Feldman . Mastering multi-player games . In Proceedings of the 11th International Conference on Autonomous Agents and Multiagent Systems - Volume 2 , AAMAS '12, pages 897 -- 904 , Richland, SC , 2012 . International Foundation for Autonomous Agents and Multiagent Systems. Y. Azar, U. Feige, M. Tennenholtz, and M. Feldman. Mastering multi-player games. In Proceedings of the 11th International Conference on Autonomous Agents and Multiagent Systems - Volume 2, AAMAS '12, pages 897--904, Richland, SC, 2012. International Foundation for Autonomous Agents and Multiagent Systems."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/2229012.2229023"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.1100.0867"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.2140\/pjm.1956.6.1"},{"key":"e_1_3_2_1_7_1","first-page":"202","volume-title":"SODA","author":"Blum A.","year":"2003","unstructured":"A. Blum , V. Kumar , A. Rudra , and F. Wu . Online learning in online auctions . In SODA , pages 202 -- 204 , 2003 . A. Blum, V. Kumar, A. Rudra, and F. Wu. Online learning in online auctions. In SODA, pages 202--204, 2003."},{"key":"e_1_3_2_1_8_1","volume-title":"How to beat the adaptive multi-armed bandit. CoRR, abs\/cs\/0602053","author":"Dani V.","year":"2006","unstructured":"V. Dani and T. P. Hayes . How to beat the adaptive multi-armed bandit. CoRR, abs\/cs\/0602053 , 2006 . V. Dani and T. P. Hayes. How to beat the adaptive multi-armed bandit. CoRR, abs\/cs\/0602053, 2006."},{"key":"e_1_3_2_1_9_1","volume-title":"22nd Annual Conference on Learning Theory, COLT","author":"Even-Dar E.","year":"2009","unstructured":"E. Even-Dar , R. Kleinberg , S. Mannor , and Y. Mansour . Online learning with global cost functions . In 22nd Annual Conference on Learning Theory, COLT , 2009 . E. Even-Dar, R. Kleinberg, S. Mannor, and Y. Mansour. Online learning with global cost functions. In 22nd Annual Conference on Learning Theory, COLT, 2009."},{"key":"e_1_3_2_1_10_1","first-page":"106","volume-title":"ICS","author":"Feldman M.","year":"2010","unstructured":"M. Feldman , A. Kalai , and M. Tennenholtz . Playing games without observing payoffs . In ICS , pages 106 -- 110 , 2010 . M. Feldman, A. Kalai, and M. Tennenholtz. Playing games without observing payoffs. In ICS, pages 106--110, 2010."},{"key":"e_1_3_2_1_11_1","first-page":"26","volume-title":"COLT","author":"Kalai A.","year":"2003","unstructured":"A. Kalai and S. Vempala . Efficient algorithms for online decision problems . In COLT , pages 26 -- 40 , 2003 . A. Kalai and S. Vempala. Efficient algorithms for online decision problems. In COLT, pages 26--40, 2003."},{"key":"e_1_3_2_1_12_1","first-page":"594","volume-title":"Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science, FOCS '03","author":"Kleinberg R.","unstructured":"R. Kleinberg and T. Leighton . The value of knowing a demand curve: Bounds on regret for online posted-price auctions . In Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science, FOCS '03 , pages 594 --, Washington, DC, USA, 2003. IEEE Computer Society. R. Kleinberg and T. Leighton. The value of knowing a demand curve: Bounds on regret for online posted-price auctions. In Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science, FOCS '03, pages 594--, Washington, DC, USA, 2003. IEEE Computer Society."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1994.1009"},{"key":"e_1_3_2_1_14_1","first-page":"928","volume-title":"ICML","author":"Zinkevich M.","year":"2003","unstructured":"M. Zinkevich . Online convex programming and generalized infinitesimal gradient ascent . In ICML , pages 928 -- 936 , 2003 . M. Zinkevich. Online convex programming and generalized infinitesimal gradient ascent. In ICML, pages 928--936, 2003."}],"event":{"name":"ITCS'14: Innovations in Theoretical Computer Science","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"Princeton New Jersey USA","acronym":"ITCS'14"},"container-title":["Proceedings of the 5th conference on Innovations in theoretical computer science"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2554797.2554817","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2554797.2554817","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T07:34:21Z","timestamp":1750232061000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2554797.2554817"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,1,12]]},"references-count":14,"alternative-id":["10.1145\/2554797.2554817","10.1145\/2554797"],"URL":"https:\/\/doi.org\/10.1145\/2554797.2554817","relation":{},"subject":[],"published":{"date-parts":[[2014,1,12]]},"assertion":[{"value":"2014-01-12","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}