{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,10]],"date-time":"2026-04-10T10:05:10Z","timestamp":1775815510831,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":25,"publisher":"ACM","license":[{"start":{"date-parts":[[2012,6,4]],"date-time":"2012-06-04T00:00:00Z","timestamp":1338768000000},"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":[[2012,6,4]]},"DOI":"10.1145\/2229012.2229026","type":"proceedings-article","created":{"date-parts":[[2012,6,5]],"date-time":"2012-06-05T17:35:37Z","timestamp":1338917737000},"page":"128-145","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":64,"title":["Learning on a budget"],"prefix":"10.1145","author":[{"given":"Ashwinkumar","family":"Badanidiyuru","sequence":"first","affiliation":[{"name":"Cornell University, Ithaca, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Robert","family":"Kleinberg","sequence":"additional","affiliation":[{"name":"Cornell University, Ithaca, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yaron","family":"Singer","sequence":"additional","affiliation":[{"name":"Google, Mountain View, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2012,6,4]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1186810.1186813"},{"key":"e_1_3_2_1_2_1","first-page":"166","article-title":"Posting prices with unknown distributions","author":"BABAIOFF M.","year":"2011","unstructured":"BABAIOFF , M. , BLUMROSEN , L. , DUGHMI , S. , AND SINGER , Y. 2011 . Posting prices with unknown distributions . In ICS. 166 - 178 . BABAIOFF, M., BLUMROSEN, L., DUGHMI, S., AND SINGER, Y. 2011. Posting prices with unknown distributions. In ICS. 166-178.","journal-title":"ICS."},{"key":"e_1_3_2_1_3_1","first-page":"434","article-title":"Matroids, secretary problems, and online mechanisms","author":"BABAIOFF M.","year":"2007","unstructured":"BABAIOFF , M. , IMMORLICA , N. , AND KLEINBERG , R. 2007 . Matroids, secretary problems, and online mechanisms . In SODA. 434 - 443 . BABAIOFF, M., IMMORLICA, N., AND KLEINBERG, R. 2007. Matroids, secretary problems, and online mechanisms. In SODA. 434-443.","journal-title":"SODA."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"crossref","unstructured":"BARMAN S. UMBOH S. CHAWLA S. AND MALEC D. 2012. Secretary problems with convex costs.  BARMAN S. UMBOH S. CHAWLA S. AND MALEC D. 2012. Secretary problems with convex costs.","DOI":"10.1007\/978-3-642-31594-7_7"},{"key":"e_1_3_2_1_5_1","first-page":"39","article-title":"Submodular secretary problem and extensions","author":"BATENI M.","year":"2010","unstructured":"BATENI , M. , HAJIAGHAYI , M. , AND ZADIMOGHADDAM , M. 2010 . Submodular secretary problem and extensions . In APPROX-RANDOM. 39 - 52 . BATENI, M., HAJIAGHAYI, M., AND ZADIMOGHADDAM, M. 2010. Submodular secretary problem and extensions. In APPROX-RANDOM. 39-52.","journal-title":"APPROX-RANDOM."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"crossref","unstructured":"BEI X. CHEN N. GRAVIN N. AND LU P. 2011. Budget feasible mechanism design via random sampling. CoRR abs\/1107.2994.  BEI X. CHEN N. GRAVIN N. AND LU P. 2011. Budget feasible mechanism design via random sampling. CoRR abs\/1107.2994 .","DOI":"10.1145\/2213977.2214020"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"crossref","unstructured":"BEI X. CHEN N. GRAVIN N. AND LU P. 2012. Budget feasible mechanism design: From prior-free to bayesian. CoRR abs\/1203.4455.  BEI X. CHEN N. GRAVIN N. AND LU P. 2012. Budget feasible mechanism design: From prior-free to bayesian. CoRR abs\/1203.4455 .","DOI":"10.1145\/2213977.2214020"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.1080.0640"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1064009.1064013"},{"key":"e_1_3_2_1_10_1","first-page":"304","article-title":"Auctions for structured procurement","author":"CARY M.","year":"2008","unstructured":"CARY , M. , FLAXMAN , A. D. , HARTLINE , J. D. , AND KARLIN , A. R. 2008 . Auctions for structured procurement . In SODA. 304 - 313 . CARY, M., FLAXMAN, A. D., HARTLINE, J. D., AND KARLIN, A. R. 2008. Auctions for structured procurement. In SODA. 304-313.","journal-title":"SODA."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1806689.1806733"},{"key":"e_1_3_2_1_12_1","first-page":"685","article-title":"On the approximability of budget feasible mechanisms","author":"CHEN N.","year":"2011","unstructured":"CHEN , N. , GRAVIN , N. , AND LU , P. 2011 . On the approximability of budget feasible mechanisms . In SODA. 685 - 699 . CHEN, N., GRAVIN, N., AND LU, P. 2011. On the approximability of budget feasible mechanisms. In SODA. 685-699.","journal-title":"SODA."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993574.1993615"},{"key":"e_1_3_2_1_14_1","unstructured":"DYNKIN E. B. 1963. The optimum choice of the instant for stopping a Markov process. Soviet Math. Dokl 4.  DYNKIN E. B. 1963. The optimum choice of the instant for stopping a Markov process. Soviet Math. Dokl 4 ."},{"key":"e_1_3_2_1_15_1","first-page":"701","article-title":"Frugality in path auctions","author":"ELKIND E.","year":"2004","unstructured":"ELKIND , E. , SAHAI , A. , AND STEIGLITZ , K. 2004 . Frugality in path auctions . In SODA. 701 - 709 . ELKIND, E., SAHAI, A., AND STEIGLITZ, K. 2004. Frugality in path auctions. In SODA. 701-709.","journal-title":"SODA."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/285055.285059"},{"key":"e_1_3_2_1_17_1","first-page":"218","article-title":"Improved competitive ratios for submodular secretary problems","author":"FELDMAN M.","year":"2011","unstructured":"FELDMAN , M. , NAOR , J. , AND SCHWARTZ , R. 2011 . Improved competitive ratios for submodular secretary problems . In APPROX-RANDOM. 218 - 229 . FELDMAN, M., NAOR, J., AND SCHWARTZ, R. 2011. Improved competitive ratios for submodular secretary problems. In APPROX-RANDOM. 218-229.","journal-title":"APPROX-RANDOM."},{"key":"e_1_3_2_1_18_1","first-page":"246","article-title":"Constrained nonmonotone submodular maximization: Offline and secretary algorithms","author":"GUPTA A.","year":"2010","unstructured":"GUPTA , A. , ROTH , A. , SCHOENEBECK , G. , AND TALWAR , K. 2010 . Constrained nonmonotone submodular maximization: Offline and secretary algorithms . In WINE. 246 - 257 . GUPTA, A., ROTH, A., SCHOENEBECK, G., AND TALWAR, K. 2010. Constrained nonmonotone submodular maximization: Offline and secretary algorithms. In WINE. 246-257.","journal-title":"WINE."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2005.25"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(99)00031-9"},{"key":"e_1_3_2_1_21_1","first-page":"630","article-title":"A multiple-choice secretary algorithm with applications to online auctions","author":"KLEINBERG R. D.","year":"2005","unstructured":"KLEINBERG , R. D. 2005 . A multiple-choice secretary algorithm with applications to online auctions . In SODA. 630 - 631 . KLEINBERG, R. D. 2005. A multiple-choice secretary algorithm with applications to online auctions. In SODA. 630-631.","journal-title":"SODA."},{"key":"e_1_3_2_1_22_1","first-page":"594","article-title":"The value of knowing a demand curve: Bounds on regret for online posted-price auctions","author":"KLEINBERG R. D.","year":"2003","unstructured":"KLEINBERG , R. D. AND LEIGHTON , F. T. 2003 . The value of knowing a demand curve: Bounds on regret for online posted-price auctions . In FOCS. 594 - 605 . KLEINBERG, R. D. AND LEIGHTON, F. T. 2003. The value of knowing a demand curve: Bounds on regret for online posted-price auctions. In FOCS. 594-605.","journal-title":"FOCS."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2010.78"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-6377(03)00062-2"},{"key":"e_1_3_2_1_25_1","first-page":"608","article-title":"The price of truth: Frugality in truthful mechanisms","author":"TALWAR K.","year":"2003","unstructured":"TALWAR , K. 2003 . The price of truth: Frugality in truthful mechanisms . In STACS. 608 - 619 . TALWAR, K. 2003. The price of truth: Frugality in truthful mechanisms. In STACS. 608-619.","journal-title":"STACS."}],"event":{"name":"EC '12: ACM Conference on Electronic Commerce","location":"Valencia Spain","acronym":"EC '12","sponsor":["SIGecom Special Interest Group on Economics and Computation"]},"container-title":["Proceedings of the 13th ACM Conference on Electronic Commerce"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2229012.2229026","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2229012.2229026","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T08:48:59Z","timestamp":1750236539000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2229012.2229026"}},"subtitle":["posted price mechanisms for online procurement"],"short-title":[],"issued":{"date-parts":[[2012,6,4]]},"references-count":25,"alternative-id":["10.1145\/2229012.2229026","10.1145\/2229012"],"URL":"https:\/\/doi.org\/10.1145\/2229012.2229026","relation":{},"subject":[],"published":{"date-parts":[[2012,6,4]]},"assertion":[{"value":"2012-06-04","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}