{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T21:13:05Z","timestamp":1725570785673},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642175718"},{"type":"electronic","value":"9783642175725"}],"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_27","type":"book-chapter","created":{"date-parts":[[2010,12,6]],"date-time":"2010-12-06T03:54:45Z","timestamp":1291607685000},"page":"327-338","source":"Crossref","is-referenced-by-count":4,"title":["On the Competitive Ratio of Online Sampling Auctions"],"prefix":"10.1007","author":[{"given":"Elias","family":"Koutsoupias","sequence":"first","affiliation":[]},{"given":"George","family":"Pierrakos","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"27_CR1","doi-asserted-by":"crossref","unstructured":"Aggarwal, G., Fiat, A., Goldberg, A.V., Hartline, J.D., Immorlica, N., Sudan, M.: Derandomization of auctions. In: STOC, pp. 619\u2013625 (2005)","DOI":"10.1145\/1060590.1060682"},{"key":"27_CR2","doi-asserted-by":"crossref","unstructured":"Alaei, S., Malekian, A., Srinivasan, A.: On random sampling auctions for digital goods. In: ACM Conference on Electronic Commerce, pp. 187\u2013196 (2009)","DOI":"10.1145\/1566374.1566402"},{"key":"27_CR3","doi-asserted-by":"crossref","unstructured":"Babaioff, M., Immorlica, N., Kempe, D., Kleinberg, R.: Online auctions and generalized secretary problems. SIGecom Exchanges\u00a07(2) (2008)","DOI":"10.1145\/1399589.1399596"},{"issue":"8","key":"27_CR4","doi-asserted-by":"publisher","first-page":"1245","DOI":"10.1016\/j.jcss.2007.08.002","volume":"74","author":"M.-F. Balcan","year":"2008","unstructured":"Balcan, M.-F., Blum, A., Hartline, J.D., Mansour, Y.: Reducing mechanism design to algorithm design via machine learning. J. Comput. Syst. Sci.\u00a074(8), 1245\u20131270 (2008)","journal-title":"J. Comput. Syst. Sci."},{"key":"27_CR5","unstructured":"Bar-Yossef, Z., Hildrum, K., Wu, F.: Incentive-compatible online auctions for digital goods. In: SODA, pp. 964\u2013970 (2002)"},{"key":"27_CR6","unstructured":"Blum, A., Hartline, J.D.: Near-optimal online auctions. In: SODA, pp. 1156\u20131163 (2005)"},{"issue":"2-3","key":"27_CR7","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1016\/j.tcs.2004.05.012","volume":"324","author":"A. Blum","year":"2004","unstructured":"Blum, A., Kumar, V., Rudra, A., Wu, F.: Online learning in online auctions. Theor. Comput. Sci.\u00a0324(2-3), 137\u2013146 (2004)","journal-title":"Theor. Comput. Sci."},{"key":"27_CR8","doi-asserted-by":"crossref","unstructured":"Dhangwatnotai, P., Roughgarden, T., Yan, Q.: Revenue maximization with a single sample. In: ACM Conference on Electronic Commerce, pp. 129\u2013138 (2010)","DOI":"10.1145\/1807342.1807364"},{"key":"27_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"878","DOI":"10.1007\/11600930_89","volume-title":"Internet and Network Economics","author":"U. Feige","year":"2005","unstructured":"Feige, U., Flaxman, A.D., Hartline, J.D., Kleinberg, R.D.: On the competitive ratio of the random sampling auction. In: Deng, X., Ye, Y. (eds.) WINE 2005. LNCS, vol.\u00a03828, pp. 878\u2013886. Springer, Heidelberg (2005)"},{"key":"27_CR10","unstructured":"Goldberg, A.V., Hartline, J.D., Karlin, A.R., Wright, A., Saks, M.: Competitive auctions. In: Games and Economic Behavior, pp. 72\u201381 (2002)"},{"key":"27_CR11","doi-asserted-by":"crossref","unstructured":"Hajiaghayi, M.T., Kleinberg, R.D., Parkes, D.C.: Adaptive limited-supply online auctions. In: ACM Conference on Electronic Commerce, pp. 71\u201380 (2004)","DOI":"10.1145\/988772.988784"},{"key":"27_CR12","doi-asserted-by":"crossref","unstructured":"Hartline, J.D., McGrew, R.: From optimal limited to unlimited supply auctions. In: ACM Conference on Electronic Commerce, pp. 175\u2013182 (2005)","DOI":"10.1145\/1064009.1064028"},{"key":"27_CR13","doi-asserted-by":"crossref","unstructured":"Hartline, J.D., Roughgarden, T.: Optimal mechanism design and money burning. In: STOC, pp. 75\u201384 (2008)","DOI":"10.1145\/1374376.1374390"},{"key":"27_CR14","doi-asserted-by":"crossref","unstructured":"Hartline, J.D., Roughgarden, T.: Simple versus optimal mechanisms. In: ACM Conference on Electronic Commerce, pp. 225\u2013234 (2009)","DOI":"10.1145\/1566374.1566407"},{"key":"27_CR15","doi-asserted-by":"crossref","unstructured":"Lavi, R., Nisan, N.: Competitive analysis of incentive compatible on-line auctions. In: Proc. 2nd ACM Conf. on Electronic Commerce (EC 2000), pp. 233\u2013241 (2000)","DOI":"10.1145\/352871.352897"},{"key":"27_CR16","unstructured":"Myerson, R.B.: Optimal auction design. Discussion Papers 362, Northwestern University, Center for Mathematical Studies in Economics and Management Science (December 1978)"}],"container-title":["Lecture Notes in Computer Science","Internet and Network Economics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-17572-5_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,6]],"date-time":"2019-06-06T16:54:34Z","timestamp":1559840074000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-17572-5_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642175718","9783642175725"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-17572-5_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}