{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T06:19:24Z","timestamp":1775283564385,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642175718","type":"print"},{"value":"9783642175725","type":"electronic"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-17572-5_12","type":"book-chapter","created":{"date-parts":[[2010,12,6]],"date-time":"2010-12-06T08:54:45Z","timestamp":1291625685000},"page":"145-157","source":"Crossref","is-referenced-by-count":22,"title":["Selective Call Out and Real Time Bidding"],"prefix":"10.1007","author":[{"given":"Tanmoy","family":"Chakraborty","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eyal","family":"Even-Dar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sudipto","family":"Guha","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yishay","family":"Mansour","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S.","family":"Muthukrishnan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"12_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/978-3-642-04128-0_14","volume-title":"Algorithms - ESA 2009","author":"Y. Azar","year":"2009","unstructured":"Azar, Y., Birnbaum, B.E., Karlin, A.R., Nguyen, C.T.: On revenue maximization in second-price ad auctions. In: Fiat, A., Sanders, P. (eds.) ESA 2009. LNCS, vol.\u00a05757, pp. 155\u2013166. Springer, Heidelberg (2009)"},{"key":"12_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1007\/978-3-540-74208-1_2","volume-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","author":"M. Babaioff","year":"2007","unstructured":"Babaioff, M., Immorlica, N., Kempe, D., Kleinberg, R.: Knapsack secretary problem with applications. In: Charikar, M., Jansen, K., Reingold, O., Rolim, J.D.P. (eds.) RANDOM 2007 and APPROX 2007. LNCS, vol.\u00a04627, pp. 16\u201328. Springer, Heidelberg (2007)"},{"issue":"2","key":"12_CR3","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1214\/aoms\/1177704147","volume":"34","author":"R.E. Barlow","year":"1963","unstructured":"Barlow, R.E., Marshall, A.W., Proschan, F.: Properties of probability distributions with monotone hazard rate. The Annals of Mathematical Statistics\u00a034(2), 375\u2013389 (1963)","journal-title":"The Annals of Mathematical Statistics"},{"key":"12_CR4","unstructured":"Bhattacharya, S., Goel, G., Gollapudi, S., Munagala, K.: Budget constrained auctions with heterogeneous items. In: STOC (2010), http:\/\/arxiv.org\/abs\/0907.4166"},{"key":"12_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1007\/978-3-540-75520-3_24","volume-title":"Algorithms \u2013 ESA 2007","author":"N. Buchbinder","year":"2007","unstructured":"Buchbinder, N., Jain, K., Naor, J.: Online primal-dual algorithms for maximizing ad-auctions revenue. In: Arge, L., Hoffmann, M., Welzl, E. (eds.) ESA 2007. LNCS, vol.\u00a04698, pp. 253\u2013264. Springer, Heidelberg (2007)"},{"key":"12_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1007\/978-3-540-72792-7_15","volume-title":"Integer Programming and Combinatorial Optimization","author":"G. Calinescu","year":"2007","unstructured":"Calinescu, G., Chekuri, C., P\u00e1l, M., Vondr\u00e1k, J.: Maximizing a submodular set function subject to a matroid constraint (extended abstract). In: Fischetti, M., Williamson, D.P. (eds.) IPCO 2007. LNCS, vol.\u00a04513, pp. 182\u2013196. Springer, Heidelberg (2007)"},{"key":"12_CR7","doi-asserted-by":"crossref","unstructured":"Chakrabarty, D., Goel, G.: On the approximability of budgeted allocations and improved lower bounds for submodular welfare maximization and gap. In: Proceedings of FOCS, pp. 687\u2013696 (2008)","DOI":"10.1109\/FOCS.2008.47"},{"key":"12_CR8","unstructured":"Chawla, S., Hartline, J., Malec, D., Sivan, B.: Sequential posted pricing and multi-parameter mechanism design. In: STOC (2010), http:\/\/arxiv.org\/abs\/0907.2435"},{"key":"12_CR9","doi-asserted-by":"crossref","unstructured":"Devanur, N., Hayes, T.: The adwords problem: Online keyword matching with budgeted bidders under random permutations. In: Proc. 10th Annual ACM Conference on Electronic Commerge, EC (2009)","DOI":"10.1145\/1566374.1566384"},{"key":"12_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1007\/978-3-642-10841-9_20","volume-title":"Internet and Network Economics","author":"A. Ghosh","year":"2009","unstructured":"Ghosh, A., McAfee, P., Papineni, K., Vassilvitskii, S.: Bidding for representative allocations for display advertising. In: Leonardi, S. (ed.) WINE 2009. LNCS, vol.\u00a05929, pp. 208\u2013219. Springer, Heidelberg (2009)"},{"key":"12_CR11","doi-asserted-by":"crossref","unstructured":"Ghosh, A., Rubinstein, B.I.P., Vassilvitskii, S., Zinkevich, M.: Adaptive bidding for display advertising. In: WWW, pp. 251\u2013260 (2009)","DOI":"10.1145\/1526709.1526744"},{"key":"12_CR12","doi-asserted-by":"crossref","unstructured":"Guha, S., McGregor, A.: Approximate quantiles and the order of the stream. In: Proc. of PODS, pp. 273\u2013279 (2006)","DOI":"10.1145\/1142351.1142390"},{"key":"12_CR13","unstructured":"Guha, S., Munagala, K.: Adaptive uncertainty resolution in bayesian combinatorial optimization problems. ACM Transactions of Algorithms (to appear)"},{"issue":"1","key":"12_CR14","first-page":"171","volume":"30","author":"J. Kleinberg","year":"2001","unstructured":"Kleinberg, J., Rabani, Y., Tardos, E.: Allocating bandwidth for bursty connections. SIAM J. Of Computing\u00a030(1), 171\u2013217 (2001)","journal-title":"SIAM J. Of Computing"},{"key":"12_CR15","unstructured":"Kleinberg, R.: A multiple-choice secretary problem with applications to online auctions. In: Proceedings of SODA, pp. 630\u2013631 (2005)"},{"key":"12_CR16","doi-asserted-by":"crossref","unstructured":"Kleinberg, R., Slivkins, A., Upfal, E.: Multi-armed bandits in metric spaces. In: STOC, pp. 681\u2013690 (2008)","DOI":"10.1145\/1374376.1374475"},{"key":"12_CR17","doi-asserted-by":"crossref","unstructured":"Kulik, A., Shachnai, H., Tamir, T.: Maximizing submodular set functions subject to multiple linear constraints. In: SODA, pp. 545\u2013554 (2009)","DOI":"10.1137\/1.9781611973068.60"},{"key":"12_CR18","first-page":"73","volume":"68","author":"A. Marchetti-Spaccamela","year":"1995","unstructured":"Marchetti-Spaccamela, A., Vercellis, C.: Stochastic on-line knapsack problems. Mathematical Programming\u00a068, 73\u2013104 (1995)","journal-title":"Mathematical Programming"},{"key":"12_CR19","doi-asserted-by":"crossref","unstructured":"Mehta, A., Saberi, A., Vazirani, U., Vazirani, V.: Adwords and generalized on-line matching. In: FOCS, pp. 264\u2013273 (2005)","DOI":"10.1109\/SFCS.2005.12"},{"key":"12_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-10841-9_1","volume-title":"Internet and Network Economics","author":"S. Muthukrishnan","year":"2009","unstructured":"Muthukrishnan, S.: Adexchanges: Research issues. In: Leonardi, S. (ed.) WINE 2009. LNCS, vol.\u00a05929, pp. 1\u201312. Springer, Heidelberg (2009)"},{"issue":"1","key":"12_CR21","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1287\/moor.6.1.58","volume":"6","author":"R.B. Myerson","year":"1981","unstructured":"Myerson, R.B.: Optimal auction design. Math. of OR\u00a06(1), 58\u201373 (1981)","journal-title":"Math. of OR"},{"key":"12_CR22","unstructured":"Nolet, M.: http:\/\/www.mikeonads.com\/2009\/08\/30\/rtb-part-i-what-is-it\/"},{"key":"12_CR23","doi-asserted-by":"crossref","unstructured":"Pandey, S., Olston, C.: Handling advertisements of unknown quality in search advertising. In: Proceedings of NIPS, pp. 1065\u20131072 (2006)","DOI":"10.7551\/mitpress\/7503.003.0138"},{"key":"12_CR24","unstructured":"P. release, http:\/\/www.doubleclick.com\/insight\/blog\/archives\/doubleclick-advertising-exchange\/announcing-the-new-doubleclick-adexchange.html"},{"key":"12_CR25","doi-asserted-by":"publisher","DOI":"10.1515\/9781400873173","volume-title":"Convex Analysis","author":"R.T. Rockafellar","year":"1970","unstructured":"Rockafellar, R.T.: Convex Analysis. Princeton University Press, Princeton (1970)"},{"key":"12_CR26","volume-title":"Computer Networks","author":"A.S. Tanenbaum","year":"1996","unstructured":"Tanenbaum, A.S.: Computer Networks, 3rd edn. Prentice-Hall, Englewood Cliffs (1996)","edition":"3"},{"key":"12_CR27","doi-asserted-by":"crossref","unstructured":"Vee, E., Vassilvitskii, S., Shanmugasundaram, J.: Optimal online assignment with forecasts. In: EC (2010)","DOI":"10.1145\/1807342.1807360"}],"container-title":["Lecture Notes in Computer Science","Internet and Network Economics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-17572-5_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,28]],"date-time":"2025-02-28T13:37:27Z","timestamp":1740749847000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-17572-5_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642175718","9783642175725"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-17572-5_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010]]}}}