{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T05:58:33Z","timestamp":1725861513714},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319426334"},{"type":"electronic","value":"9783319426341"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"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":[[2016]]},"DOI":"10.1007\/978-3-319-42634-1_1","type":"book-chapter","created":{"date-parts":[[2016,7,19]],"date-time":"2016-07-19T15:50:21Z","timestamp":1468943421000},"page":"3-14","source":"Crossref","is-referenced-by-count":0,"title":["Clairvoyant Mechanisms for Online Auctions"],"prefix":"10.1007","author":[{"given":"Philipp","family":"Brandes","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zengfeng","family":"Huang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hsin-Hao","family":"Su","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Roger","family":"Wattenhofer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,7,20]]},"reference":[{"key":"1_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1007\/978-3-642-22006-7_32","volume-title":"Automata, Languages and Programming","author":"AB Varadaraja","year":"2011","unstructured":"Varadaraja, A.B.: Buyback problem - approximate matroid intersection with cancellation costs. In: Aceto, L., Henzinger, M., Sgall, J. (eds.) ICALP 2011, Part I. LNCS, vol. 6755, pp. 379\u2013390. Springer, Heidelberg (2011)"},{"key":"1_CR2","series-title":"Lecture Notes in Computer Science","first-page":"529","volume-title":"Internet and Network Economics","author":"AB Varadaraja","year":"2009","unstructured":"Varadaraja, A.B., Kleinberg, R.: Randomized online algorithms for the buyback problem. In: Leonardi, S. (ed.) WINE 2009. LNCS, vol. 5929, pp. 529\u2013536. Springer, Heidelberg (2009)"},{"key":"1_CR3","doi-asserted-by":"crossref","unstructured":"Babaioff, M., Hartline, J.D., Kleinberg, R.: Selling ad campaigns: online algorithms with cancellations. In: EC, pp. 61\u201370 (2009)","DOI":"10.1145\/1566374.1566383"},{"key":"1_CR4","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1007\/s00453-007-9005-x","volume":"50","author":"M Chrobak","year":"2008","unstructured":"Chrobak, M., Kenyon, C., Noga, J., Young, N.E.: Incremental medians via online bidding. Algorithmica 50, 455\u2013478 (2008)","journal-title":"Algorithmica"},{"issue":"1","key":"1_CR5","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1007\/BF01726210","volume":"11","author":"EH Clarke","year":"1971","unstructured":"Clarke, E.H.: Multipart pricing of public goods. Public Choice 11(1), 17\u201333 (1971)","journal-title":"Public Choice"},{"key":"1_CR6","doi-asserted-by":"crossref","unstructured":"Constantin, F., Feldman, J., Muthukrishnan, S., P\u00e1l, M.: An online mechanism for ad slot reservations with cancellations. In: SODA, pp. 1265\u20131274 (2009)","DOI":"10.1137\/1.9781611973068.137"},{"issue":"4","key":"1_CR7","doi-asserted-by":"crossref","first-page":"555","DOI":"10.1016\/j.jcss.2004.10.006","volume":"70","author":"S Dasgupta","year":"2005","unstructured":"Dasgupta, S., Long, P.M.: Performance guarantees for hierarchical clustering. J. Comput. Syst. Sci. 70(4), 555\u2013569 (2005)","journal-title":"J. Comput. Syst. Sci."},{"key":"1_CR8","doi-asserted-by":"crossref","unstructured":"Friedman, E.J., Parkes, D.C.: Pricing WiFi at Starbucks: issues in online mechanism design. In: EC, pp. 240\u2013241 (2003)","DOI":"10.1145\/779928.779978"},{"key":"1_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"54","DOI":"10.1007\/978-3-662-44602-7_5","volume-title":"Theoretical Computer Science","author":"SPY Fung","year":"2014","unstructured":"Fung, S.P.Y.: Online scheduling of unit length jobs with commitment and penalties. In: Diaz, J., Lanese, I., Sangiorgi, D. (eds.) TCS 2014. LNCS, vol. 8705, pp. 54\u201365. Springer, Heidelberg (2014)"},{"issue":"313","key":"1_CR10","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1080\/01621459.1966.10502008","volume":"61","author":"J Gilbert","year":"1966","unstructured":"Gilbert, J., Mosteller, F.: Recognizing the maximum of a sequence. J. Am. Stat. Assoc. 61(313), 35\u201373 (1966)","journal-title":"J. Am. Stat. Assoc."},{"key":"1_CR11","doi-asserted-by":"crossref","first-page":"617","DOI":"10.2307\/1914085","volume":"41","author":"T Groves","year":"1973","unstructured":"Groves, T.: Incentives in teams. Econom.: J. Econom. Soc. 41, 617\u2013631 (1973)","journal-title":"Econom.: J. Econom. Soc."},{"key":"1_CR12","doi-asserted-by":"crossref","unstructured":"Hajiaghayi, M.T.: Online auctions with re-usable goods. In: EC (2005)","DOI":"10.1145\/1064009.1064027"},{"key":"1_CR13","doi-asserted-by":"crossref","unstructured":"Hajiaghayi, M.T., Kleinberg, R.D., Parkes, D.C.: Adaptive limited-supply online auctions. In: EC, pp. 71\u201380 (2004)","DOI":"10.1145\/988772.988784"},{"key":"1_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1007\/978-3-642-32241-9_6","volume-title":"Computing and Combinatorics","author":"X Han","year":"2012","unstructured":"Han, X., Kawase, Y., Makino, K.: Online knapsack problem with removal cost. In: Gudmundsson, J., Mestre, J., Viglas, T. (eds.) COCOON 2012. LNCS, vol. 7434, pp. 61\u201373. Springer, Heidelberg (2012)"},{"key":"1_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1007\/11764298_4","volume-title":"Experimental Algorithms","author":"J Hartline","year":"2006","unstructured":"Hartline, J., Sharp, A.: An incremental model for combinatorial maximization problems. In: \u00c0lvarez, C., Serna, M. (eds.) WEA 2006. LNCS, vol. 4007, pp. 36\u201348. Springer, Heidelberg (2006)"},{"issue":"1","key":"1_CR16","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1002\/net.20168","volume":"50","author":"J Hartline","year":"2007","unstructured":"Hartline, J., Sharp, A.: Incremental flow. Networks 50(1), 77\u201385 (2007)","journal-title":"Networks"},{"key":"1_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"435","DOI":"10.1007\/978-3-642-45030-3_41","volume-title":"Algorithms and Computation","author":"Y Kawase","year":"2013","unstructured":"Kawase, Y., Han, X., Makino, K.: Unit cost buyback problem. In: Cai, L., Cheng, S.-W., Lam, T.-W. (eds.) Algorithms and Computation. LNCS, vol. 8283, pp. 435\u2013445. Springer, Heidelberg (2013)"},{"key":"1_CR18","doi-asserted-by":"crossref","unstructured":"Lavi, R., Nisan, N.: Competitive analysis of incentive compatible on-line auctions. In: EC, pp. 233\u2013241 (2000)","DOI":"10.1145\/352871.352897"},{"key":"1_CR19","unstructured":"Lavi, R., Nisan, N.: Online ascending auctions for gradually expiring items. In: SODA, pp. 1146\u20131155 (2005)"},{"issue":"1","key":"1_CR20","doi-asserted-by":"crossref","first-page":"39","DOI":"10.2307\/2985407","volume":"10","author":"DV Lindley","year":"1961","unstructured":"Lindley, D.V.: Dynamic programming and decision theory. j-APPL-STAT 10(1), 39\u201351 (1961)","journal-title":"j-APPL-STAT"},{"key":"1_CR21","doi-asserted-by":"crossref","unstructured":"Mettu, R.R., Plaxton, C.G.: The online median problem. In: FOCS (2000)","DOI":"10.1109\/SFCS.2000.892122"},{"key":"1_CR22","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511800481","volume-title":"Algorithmic Game Theory","author":"N Nisan","year":"2007","unstructured":"Nisan, N., Roughgarden, T., Tardos, E., Vazirani, V.V.: Algorithmic Game Theory. Cambridge University Press, New York (2007)"},{"key":"1_CR23","unstructured":"Parkes, D.C., Singh, S.P.: An MDP-based approach to online mechanism design. In: NIPS (2003)"},{"key":"1_CR24","doi-asserted-by":"crossref","unstructured":"Parkes, D.C., Singh, S.P., Yanovsky, D.: Approximately efficient online mechanism design. In: NIPS (2004)","DOI":"10.1007\/978-1-4419-8909-3_3"},{"key":"1_CR25","doi-asserted-by":"crossref","unstructured":"Plaxton, C.G.: Approximation algorithms for hierarchical location problems. In: STOC, pp. 40\u201349 (2003)","DOI":"10.1145\/780542.780549"},{"issue":"1","key":"1_CR26","doi-asserted-by":"crossref","first-page":"8","DOI":"10.1111\/j.1540-6261.1961.tb02789.x","volume":"16","author":"W Vickrey","year":"1961","unstructured":"Vickrey, W.: Counterspeculation, auctions, and competitive sealed tenders. J. Financ. 16(1), 8\u201337 (1961)","journal-title":"J. Financ."}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-42634-1_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,11]],"date-time":"2019-09-11T11:02:49Z","timestamp":1568199769000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-42634-1_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319426334","9783319426341"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-42634-1_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}