{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T05:46:23Z","timestamp":1725860783764},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319411675"},{"type":"electronic","value":"9783319411682"}],"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-41168-2_18","type":"book-chapter","created":{"date-parts":[[2016,7,4]],"date-time":"2016-07-04T01:26:28Z","timestamp":1467595588000},"page":"209-221","source":"Crossref","is-referenced-by-count":0,"title":["Online k-max Search Algorithms with Applications to the Secretary Problem"],"prefix":"10.1007","author":[{"given":"Sizhe","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yinfeng","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,7,5]]},"reference":[{"unstructured":"Babaioff, M., Immorlica, N., Kleinberg, R.: Matroids, secretary problems, and online mechanisms. In: SODA 2007, pp. 434\u2013443 (2007)","key":"18_CR1"},{"issue":"2","key":"18_CR2","doi-asserted-by":"crossref","first-page":"447","DOI":"10.1137\/S0097539799358847","volume":"31","author":"GH Chen","year":"2001","unstructured":"Chen, G.H., Kao, M.Y., Lyuu, Y.D., Wong, H.K.: Optimal buy-and-hold strategies for financial markets with bounded daily returns. SIAM J. Compt. 31(2), 447\u2013459 (2001)","journal-title":"SIAM J. Compt."},{"key":"18_CR3","series-title":"Lecture Notes in Computer Science","first-page":"32","volume-title":"Algorithmic Aspects in Information and Management","author":"FYL Chin","year":"2014","unstructured":"Chin, F.Y.L., Fu, B., Jiang, M., Ting, H.-F., Zhang, Y.: Competitive algorithms for unbounded one-way trading. In: Gu, Q., Hell, P., Yang, B. (eds.) AAIM 2014. LNCS, vol. 8546, pp. 32\u201343. Springer, Heidelberg (2014)"},{"issue":"4","key":"18_CR4","doi-asserted-by":"crossref","first-page":"619","DOI":"10.1007\/s00453-007-9156-9","volume":"55","author":"P Damaschke","year":"2009","unstructured":"Damaschke, P., Ha, P.H., Tsigas, P.: Online search with time-varying price bounds. Algorithmica 55(4), 619\u2013642 (2009)","journal-title":"Algorithmica"},{"doi-asserted-by":"crossref","unstructured":"El-Yaniv, R., Fiat, A., Karp, R., Turpin, G.: Competitive analysis of financial games. In: 33rd Symposium on Foundations of Computer Science, pp. 327\u2013323 (1992)","key":"18_CR5","DOI":"10.1109\/SFCS.1992.267758"},{"issue":"1","key":"18_CR6","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1007\/s00453-001-0003-0","volume":"30","author":"R El-Yaniv","year":"2001","unstructured":"El-Yaniv, R., Fiat, A., Karp, R., Turpin, G.: Optimal search and one-way trading online algorithms. Algorithmica 30(1), 101\u2013139 (2001)","journal-title":"Algorithmica"},{"key":"18_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"182","DOI":"10.1007\/978-3-642-15775-2_16","volume-title":"Algorithms \u2013 ESA 2010","author":"J Feldman","year":"2010","unstructured":"Feldman, J., Henzinger, M., Korula, N., Mirrokni, V.S., Stein, C.: Online stochastic packing applied to display ad allocation. In: de Berg, M., Meyer, U. (eds.) ESA 2010, Part I. LNCS, vol. 6346, pp. 182\u2013194. Springer, Heidelberg (2010)"},{"issue":"1","key":"18_CR8","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1007\/s10878-009-9239-4","volume":"21","author":"H Fujiwara","year":"2011","unstructured":"Fujiwara, H., Iwama, K., Sekiguchi, Y.: Average case competitive analysis for one-way trading. J. Comb. Optim. 21(1), 83\u2013107 (2011)","journal-title":"J. Comb. Optim."},{"doi-asserted-by":"crossref","unstructured":"Gardner, M.: Mathematical games column. Sci. Am. February 1960","key":"18_CR9","DOI":"10.1038\/scientificamerican0160-150"},{"key":"18_CR10","doi-asserted-by":"crossref","first-page":"472","DOI":"10.1007\/s00453-013-9795-y","volume":"67","author":"SO Gharan","year":"2013","unstructured":"Gharan, S.O., Vondrak, J.: On the variants of the matroids secretary problems. Algorithmica 67, 472\u2013497 (2013)","journal-title":"Algorithmica"},{"key":"18_CR11","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. Soc. 61, 35\u201373 (1966)","journal-title":"J. Am. Stat. Soc."},{"unstructured":"Hajiaghayi, M.T., Kleinberg, R., Sandholm, T.: Automated online mechanism design and prophet inequalities. In: ICAI 2007, pp. 58\u201365 (2007)","key":"18_CR12"},{"key":"18_CR13","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1007\/s13675-014-0031-6","volume":"3","author":"I Javeria","year":"2015","unstructured":"Javeria, I., Iftikhar, A.: Optimal online $$k$$ k -min search. EURO J. Comput. Optim. 3, 147\u2013160 (2015)","journal-title":"EURO J. Comput. Optim."},{"unstructured":"Kleinberg, R.: A multiple-choice secretary algorithm with applications to online auctions. In: SODA 2005, pp. 630\u2013631 (2005)","key":"18_CR14"},{"key":"18_CR15","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1007\/s00453-008-9217-8","volume":"55","author":"J Lorenz","year":"2009","unstructured":"Lorenz, J., Panagiotou, K., Steger, A.: Optimal algorithm for $$k$$ k -search with application in option pricing. Algorithmica 55, 311\u2013328 (2009)","journal-title":"Algorithmica"},{"key":"18_CR16","doi-asserted-by":"crossref","first-page":"192","DOI":"10.1016\/j.tcs.2009.09.026","volume":"412","author":"YF Xu","year":"2011","unstructured":"Xu, Y.F., Zhang, W.M., Zheng, F.F.: Optimal algorithms for the online time series search problem. Theor. Comput. Sci. 412, 192\u2013197 (2011)","journal-title":"Theor. Comput. Sci."},{"key":"18_CR17","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1007\/s10878-010-9344-4","volume":"23","author":"WM Zhang","year":"2012","unstructured":"Zhang, W.M., Xu, Y.F., Zheng, F.F., Dong, Y.C.: Optimal algorithms for online time series search and one-way trading with interrelated prices. J. Comb. Optim. 23, 159\u2013196 (2012)","journal-title":"J. Comb. Optim."}],"container-title":["Lecture Notes in Computer Science","Algorithmic Aspects in Information and Management"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-41168-2_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,24]],"date-time":"2017-06-24T17:43:58Z","timestamp":1498326238000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-41168-2_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319411675","9783319411682"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-41168-2_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}