{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,7]],"date-time":"2026-06-07T08:49:22Z","timestamp":1780822162845,"version":"3.54.1"},"publisher-location":"New York, NY, USA","reference-count":25,"publisher":"ACM","license":[{"start":{"date-parts":[[2009,7,6]],"date-time":"2009-07-06T00:00:00Z","timestamp":1246838400000},"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":[[2009,7,6]]},"DOI":"10.1145\/1566374.1566383","type":"proceedings-article","created":{"date-parts":[[2009,7,15]],"date-time":"2009-07-15T13:51:31Z","timestamp":1247665891000},"page":"61-70","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":34,"title":["Selling ad campaigns"],"prefix":"10.1145","author":[{"given":"Moshe","family":"Babaioff","sequence":"first","affiliation":[{"name":"Microsoft Research - Silicon Valley, Mountain View, CA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jason D.","family":"Hartline","sequence":"additional","affiliation":[{"name":"Northwestern University, Evanston, IL, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Robert D.","family":"Kleinberg","sequence":"additional","affiliation":[{"name":"Cornell University, Ithaca, NY, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2009,7,6]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.5555\/1109557.1109677"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.5555\/1496770.1496905"},{"key":"e_1_3_2_1_3_1","volume-title":"Proc. 4th Workshop on Ad Auctions","author":"Babaioff M.","year":"2008","unstructured":"Babaioff , M. , Hartline , J.D. , and Kleinberg , R . Online algorithms with buyback . In Proc. 4th Workshop on Ad Auctions ( 2008 ). Babaioff, M., Hartline, J.D., and Kleinberg, R. Online algorithms with buyback. In Proc. 4th Workshop on Ad Auctions (2008)."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-74208-1_2"},{"key":"e_1_3_2_1_5_1","first-page":"434","volume-title":"SODA","author":"Babaioff M.","year":"2007","unstructured":"Babaioff , M. , Immorlica , N. , and Kleinberg , R . Matroids, secretary problems, and online mechanisms . In SODA ( 2007 ), pp. 434 -- 443 . Babaioff, M., Immorlica, N., and Kleinberg, R. Matroids, secretary problems, and online mechanisms. In SODA (2007), pp. 434--443."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1287\/mksc.18.4.605"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1242572.1242644"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.5555\/1778580.1778606"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1367497.1367747"},{"key":"e_1_3_2_1_10_1","volume-title":"Proc. 4th Workshop on Ad Auctions","author":"Constantin F.","year":"2008","unstructured":"Constantin , F. , Feldman , J. , Muthukrishnan , S. , and P\u00e1l , M . An online mechanism for ad slot reservations with cancellations . In Proc. 4th Workshop on Ad Auctions ( 2008 ). Constantin, F., Feldman, J., Muthukrishnan, S., and P\u00e1l, M. An online mechanism for ad slot reservations with cancellations. In Proc. 4th Workshop on Ad Auctions (2008)."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.5555\/1496770.1496907"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-70575-8_33"},{"key":"e_1_3_2_1_13_1","first-page":"238","article-title":"Optimal choice of the stopping moment of a Markov process","volume":"150","author":"Dynkin E.B","year":"1963","unstructured":"Dynkin , E.B . Optimal choice of the stopping moment of a Markov process . Dokl. Akad. Nauk SSSR 150 ( 1963 ), 238 -- 240 . Dynkin, E.B. Optimal choice of the stopping moment of a Markov process. Dokl. Akad. Nauk SSSR 150 (1963), 238--240.","journal-title":"Dokl. Akad. Nauk SSSR"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1367497.1367521"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.5555\/646255.758841"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-74208-1_13"},{"key":"e_1_3_2_1_17_1","first-page":"630","volume-title":"SODA","author":"Kleinberg R.","year":"2005","unstructured":"Kleinberg , R. A multiple-choice secretary algorithm with applications to online auctions . In SODA ( New York , 2005 ), ACM, pp. 630 -- 631 (electronic). Kleinberg, R. A multiple-choice secretary algorithm with applications to online auctions. In SODA (New York, 2005), ACM, pp. 630--631 (electronic)."},{"key":"e_1_3_2_1_18_1","first-page":"179","volume-title":"SODA","author":"Lueker G.S.","year":"1995","unstructured":"Lueker , G.S. Average-case analysis of off-line and on-line knapsack problems . In SODA ( 1995 ), pp. 179 -- 188 . Lueker, G.S. Average-case analysis of off-line and on-line knapsack problems. In SODA (1995), pp. 179--188."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01585758"},{"key":"e_1_3_2_1_20_1","volume-title":"Stochastic Models in Queueing Theory","author":"Medhi J.","year":"2002","unstructured":"Medhi , J. Stochastic Models in Queueing Theory , Second Edition. Academic Press , October 2002 . Medhi, J. Stochastic Models in Queueing Theory, Second Edition. Academic Press, October 2002."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1284320.1284321"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISPAN.2005.19"},{"key":"e_1_3_2_1_23_1","volume-title":"Adventures in stochastic processes","author":"Resnick S.","year":"1992","unstructured":"Resnick , S. Adventures in stochastic processes . Birkh\u00e4user , 1992 . Resnick, S. Adventures in stochastic processes. Birkh\u00e4user, 1992."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/1134707.1134736"},{"key":"e_1_3_2_1_25_1","first-page":"126","article-title":"Advantages of a leveled commitment contracting protocol","volume":"1","author":"Sandholm T.","year":"1996","unstructured":"Sandholm , T. , and Lesser , V.R . Advantages of a leveled commitment contracting protocol . In AAAI\/IAAI , Vol. 1 ( 1996 ), pp. 126 -- 133 . Sandholm, T., and Lesser, V.R. Advantages of a leveled commitment contracting protocol. In AAAI\/IAAI, Vol. 1 (1996), pp. 126--133.","journal-title":"AAAI\/IAAI"}],"event":{"name":"EC '09: ACM Conference on Electronic Commerce","location":"Stanford California USA","acronym":"EC '09","sponsor":["ACM Association for Computing Machinery","SIGecom Special Interest Group on Economics and Computation"]},"container-title":["Proceedings of the 10th ACM conference on Electronic commerce"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1566374.1566383","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1566374.1566383","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T12:23:10Z","timestamp":1750249390000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1566374.1566383"}},"subtitle":["online algorithms with cancellations"],"short-title":[],"issued":{"date-parts":[[2009,7,6]]},"references-count":25,"alternative-id":["10.1145\/1566374.1566383","10.1145\/1566374"],"URL":"https:\/\/doi.org\/10.1145\/1566374.1566383","relation":{},"subject":[],"published":{"date-parts":[[2009,7,6]]},"assertion":[{"value":"2009-07-06","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}