{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T21:13:10Z","timestamp":1725570790328},"publisher-location":"Berlin, Heidelberg","reference-count":11,"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_9","type":"book-chapter","created":{"date-parts":[[2010,12,6]],"date-time":"2010-12-06T08:54:45Z","timestamp":1291625685000},"page":"106-117","source":"Crossref","is-referenced-by-count":4,"title":["Incentives in Online Auctions via Linear Programming"],"prefix":"10.1007","author":[{"given":"Niv","family":"Buchbinder","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kamal","family":"Jain","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mohit","family":"Singh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"doi-asserted-by":"crossref","unstructured":"Awerbuch, B., Azar, Y., Meyerson, A.: Reducing Truth-Telling Online Mechanisms to Online Optimization. In: Proc. ACM Symposium on Theory of Computing, pp. 503\u2013510 (2003)","key":"9_CR1","DOI":"10.1145\/780542.780616"},{"unstructured":"Babaioff, M., Immorlica, N., Kleinberg, R.: Matroids, Secretary Problems, and Online Mechanisms. In: Proceedings 18th ACM-SIAM Symposium on Discrete Algorithms (2007)","key":"9_CR2"},{"key":"9_CR3","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.: A 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)"},{"key":"9_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1399589.1399596","volume":"7","author":"M. Babaioff","year":"2008","unstructured":"Babaioff, M., Immorlica, N., Kempe, D., Kleinberg, R.: Online Auctions and Generalized Secretary Problems. SIGecom Exchange\u00a07, 1\u201311 (2008)","journal-title":"SIGecom Exchange"},{"doi-asserted-by":"crossref","unstructured":"Buchbinder, N., Jain, K., Singh, M.: Secretary problems via linear programming. In: Eisenbrand, F., Shepherd, F.B. (eds.) IPCO 2010. LNCS, vol.\u00a06080, pp. 163\u2013176. Springer, Heidelberg (2010)","key":"9_CR5","DOI":"10.1007\/978-3-642-13036-6_13"},{"key":"9_CR6","doi-asserted-by":"publisher","first-page":"282","DOI":"10.1214\/ss\/1177012493","volume":"4","author":"T.S. Ferguson","year":"1989","unstructured":"Ferguson, T.S.: Who Solved the Secretary Problem? Statist. Sci.\u00a04, 282\u2013289 (1989)","journal-title":"Statist. Sci."},{"doi-asserted-by":"crossref","unstructured":"Gardner, M.: Mathematical Games. Scientific American, 150\u2013153 (1960)","key":"9_CR7","DOI":"10.1038\/scientificamerican0160-150"},{"doi-asserted-by":"crossref","unstructured":"Hajiaghayi, M.T., Kleinberg, R., Parkes, D.C.: Adaptive Limited-Supply Online Auctions. In: Proceedings of the 5th ACM Conference on Electronic Commerce (2004)","key":"9_CR8","DOI":"10.1145\/988772.988784"},{"unstructured":"Kleinberg, R.: A Multiple-Choice Secretary Algorithm with Applications to Online Auctions. In: Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete algorithms (2005)","key":"9_CR9"},{"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, pp. 233\u2013241 (2000)","key":"9_CR10","DOI":"10.1145\/352871.352897"},{"issue":"1","key":"9_CR11","doi-asserted-by":"publisher","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. The Journal of Finance\u00a016(1), 8\u201337 (1961)","journal-title":"The Journal of Finance"}],"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_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,6]],"date-time":"2019-06-06T20:54:36Z","timestamp":1559854476000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-17572-5_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642175718","9783642175725"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-17572-5_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}