{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,23]],"date-time":"2026-10-23T21:22:26Z","timestamp":1792790546394,"version":"4.5.0"},"publisher-location":"New York, NY, USA","reference-count":33,"publisher":"ACM","license":[{"start":{"date-parts":[[2014,6,1]],"date-time":"2014-06-01T00:00:00Z","timestamp":1401580800000},"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,6]]},"DOI":"10.1145\/2600057.2602844","type":"proceedings-article","created":{"date-parts":[[2014,5,30]],"date-time":"2014-05-30T18:18:31Z","timestamp":1401473911000},"page":"989-1006","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":67,"title":["Bandits with concave rewards and convex knapsacks"],"prefix":"10.1145","author":[{"given":"Shipra","family":"Agrawal","sequence":"first","affiliation":[{"name":"Microsoft Research, Bangalore, India"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Nikhil R.","family":"Devanur","sequence":"additional","affiliation":[{"name":"Microsoft Research, Bangalore, India"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2014,6]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"Yasin Abbasi-yadkori D\u00e1vid P\u00e1l and Csaba Szepesv\u00e1ri. 2012. Improved algorithms for linear stochastic bandits. In NIPS. Yasin Abbasi-yadkori D\u00e1vid P\u00e1l and Csaba Szepesv\u00e1ri. 2012. Improved algorithms for linear stochastic bandits. In NIPS."},{"key":"e_1_3_2_1_2_1","unstructured":"Jacob Abernethy Peter L. Bartlett and Elad Hazan. 2011. Blackwell Approachability and Low-Regret Learning are Equivalent. In COLT. Jacob Abernethy Peter L. Bartlett and Elad Hazan. 2011. Blackwell Approachability and Low-Regret Learning are Equivalent. In COLT."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"crossref","unstructured":"Shipra Agrawal and Nikhil R. Devanur. 2014. Bandits with concave rewards and convex knapsacks. CoRR abs\/1402.5758 (2014). Shipra Agrawal and Nikhil R. Devanur. 2014. Bandits with concave rewards and convex knapsacks. CoRR abs\/1402.5758 (2014).","DOI":"10.1145\/2600057.2602844"},{"key":"e_1_3_2_1_4_1","unstructured":"Shipra Agrawal Zizhuo Wang and Yinyu Ye. 2009. A dynamic near-optimal algorithm for online linear programming. to appear in Operations Research; preprint arXiv:0911.2974 (2009). Shipra Agrawal Zizhuo Wang and Yinyu Ye. 2009. A dynamic near-optimal algorithm for online linear programming. to appear in Operations Research; preprint arXiv:0911.2974 (2009)."},{"key":"e_1_3_2_1_5_1","unstructured":"Peter Auer. 2003. Using Confidence Bounds for Exploitation-exploration Trade-offs. J. Mach. Learn. Res. 3 (March 2003) 397--422. Peter Auer. 2003. Using Confidence Bounds for Exploitation-exploration Trade-offs. J. Mach. Learn. Res. 3 (March 2003) 397--422."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1013689704352"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2554797.2554817"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/2229012.2229023"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/2229012.2229026"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2013.30"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.1080.0640"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.2140\/pjm.1956.6.1"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1561\/2200000024"},{"key":"e_1_3_2_1_14_1","unstructured":"Deepayan Chakrabarti Ravi Kumar Filip Radlinski and Eli Upfal. 2008. Mortal Multi-Armed Bandits. In NIPS. 273--280. Deepayan Chakrabarti Ravi Kumar Filip Radlinski and Eli Upfal. 2008. Mortal Multi-Armed Bandits. In NIPS. 273--280."},{"key":"e_1_3_2_1_15_1","first-page":"208","article-title":"Contextual Bandits with Linear Payoff Functions","volume":"15","author":"Chu Wei","year":"2011","journal-title":"Journal of Machine Learning Research - Proceedings Track"},{"key":"e_1_3_2_1_16_1","unstructured":"Varsha Dani Thomas P. Hayes and Sham M. Kakade. 2008. Stochastic Linear Optimization under Bandit Feedback. In COLT. Varsha Dani Thomas P. Hayes and Sham M. Kakade. 2008. Stochastic Linear Optimization under Bandit Feedback. In COLT."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993574.1993581"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.5555\/1888935.1888957"},{"key":"e_1_3_2_1_19_1","unstructured":"Abraham D. Flaxman Adam Tauman Kalai and H. Brendan McMahan. 2005. Online Convex Optimization in the Bandit Setting: Gradient Descent Without a Gradient. In SODA. Abraham D. Flaxman Adam Tauman Kalai and H. Brendan McMahan. 2005. Online Convex Optimization in the Bandit Setting: Gradient Descent Without a Gradient. In SODA."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1002\/nav.3800030109"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"crossref","unstructured":"Yoav Freund and Robert E. Schapire. 1995. A Decision-theoretic Generalization of On-line Learning and an Application to Boosting. In EuroCOLT. Yoav Freund and Robert E. Schapire. 1995. A Decision-theoretic Generalization of On-line Learning and an Application to Boosting. In EuroCOLT.","DOI":"10.1007\/3-540-59119-2_166"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"crossref","unstructured":"Martin Gr\u00f6tschel L\u00e1szl\u00f3 Lov\u00e1sz and Alexander Schrijver. 1988. Geometric Algorithms and Combinatorial Optimization. Springer-Verlag New York. Martin Gr\u00f6tschel L\u00e1szl\u00f3 Lov\u00e1sz and Alexander Schrijver. 1988. Geometric Algorithms and Combinatorial Optimization. Springer-Verlag New York.","DOI":"10.1007\/978-3-642-97881-4"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1250790.1250807"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/1374376.1374475"},{"key":"e_1_3_2_1_25_1","volume-title":"Learning Theory","author":"Madani Omid"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-004-0552-5"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"crossref","unstructured":"Sandeep Pandey and Christopher Olston. 2006. Handling Advertisements of Unknown Quality in Search Advertising. In NIPS. 1065--1072. Sandeep Pandey and Christopher Olston. 2006. Handling Advertisements of Unknown Quality in Search Advertising. In NIPS. 1065--1072.","DOI":"10.7551\/mitpress\/7503.003.0138"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1561\/2200000018"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"crossref","unstructured":"Adish Singla and Andreas Krause. 2013. Truthful incentives in crowdsourcing tasks using regret minimization mechanisms. In WWW. 1167--1178. Adish Singla and Andreas Krause. 2013. Truthful incentives in crowdsourcing tasks using regret minimization mechanisms. In WWW. 1167--1178.","DOI":"10.1145\/2488388.2488490"},{"key":"e_1_3_2_1_30_1","unstructured":"Aleksandrs Slivkins and Jennifer Wortman Vaughan. 2013. Online Decision Making in Crowdsourcing Markets: Theoretical Challenges (Position Paper). CoRR abs\/1308.1746 (2013). Aleksandrs Slivkins and Jennifer Wortman Vaughan. 2013. Online Decision Making in Crowdsourcing Markets: Theoretical Challenges (Position Paper). CoRR abs\/1308.1746 (2013)."},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"crossref","unstructured":"Long Tran-Thanh Archie Chapman Enrique Munoz de Cote Alex Rogers and Nicholas R Jennings. 2010. Epsilon-First Policies for Budget--Limited Multi-Armed Bandits. In AAAI. Long Tran-Thanh Archie Chapman Enrique Munoz de Cote Alex Rogers and Nicholas R Jennings. 2010. Epsilon-First Policies for Budget--Limited Multi-Armed Bandits. In AAAI.","DOI":"10.1609\/aaai.v24i1.7758"},{"key":"e_1_3_2_1_32_1","unstructured":"Long Tran-Thanh Archie C. Chapman Alex Rogers and Nicholas R. Jennings. 2012. Knapsack Based Optimal Policies for Budget-Limited Multi-Armed Bandits. In AAAI. Long Tran-Thanh Archie C. Chapman Alex Rogers and Nicholas R. Jennings. 2012. Knapsack Based Optimal Policies for Budget-Limited Multi-Armed Bandits. In AAAI."},{"key":"e_1_3_2_1_33_1","unstructured":"Martin Zinkevich. 2003. Online Convex Programming and Generalized Infinitesimal Gradient Ascent. In ICML. Martin Zinkevich. 2003. Online Convex Programming and Generalized Infinitesimal Gradient Ascent. In ICML."}],"event":{"name":"EC '14: ACM Conference on Economics and Computation","location":"Palo Alto California USA","acronym":"EC '14","sponsor":["SIGecom Special Interest Group on Economics and Computation"]},"container-title":["Proceedings of the fifteenth ACM conference on Economics and computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2600057.2602844","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2600057.2602844","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T07:01:20Z","timestamp":1750230080000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2600057.2602844"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,6]]},"references-count":33,"alternative-id":["10.1145\/2600057.2602844","10.1145\/2600057"],"URL":"https:\/\/doi.org\/10.1145\/2600057.2602844","relation":{},"subject":[],"published":{"date-parts":[[2014,6]]},"assertion":[{"value":"2014-06-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}