{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T09:13:28Z","timestamp":1742980408426,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662476659"},{"type":"electronic","value":"9783662476666"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-662-47666-6_44","type":"book-chapter","created":{"date-parts":[[2015,6,19]],"date-time":"2015-06-19T07:46:47Z","timestamp":1434700007000},"page":"552-563","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Secretary Markets with Local Information"],"prefix":"10.1007","author":[{"given":"Ning","family":"Chen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martin","family":"Hoefer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marvin","family":"K\u00fcnnemann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chengyu","family":"Lin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peihan","family":"Miao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,6,20]]},"reference":[{"key":"44_CR1","doi-asserted-by":"crossref","unstructured":"Babaioff, M., Immorlica, N., Kempe, D., Kleinberg, R.: Online auctions and generalized secretary problems. SIGecom Exchanges 7(2) (2008)","DOI":"10.1145\/1399589.1399596"},{"key":"44_CR2","unstructured":"Babaioff, M., Immorlica, N., Kleinberg, R.: Matroids, secretary problems, and online mechanisms. In: Proc. 18th Symp. Discrete Algorithms (SODA), pp. 434\u2013443 (2007)"},{"key":"44_CR3","doi-asserted-by":"crossref","unstructured":"Devanur, N., Hayes, T.: The adwords problem: Online keyword matching with budgeted bidders under random permutations. In: Proc. 10th Conf. Electronic Commerce (EC), pp. 71\u201378 (2009)","DOI":"10.1145\/1566374.1566384"},{"key":"44_CR4","doi-asserted-by":"crossref","unstructured":"Devanur, N., Jain, K., Sivan, B., Wilkens, C.: Near optimal online algorithms and fast approximation algorithms for resource allocation problems. In: Proc. 12th Conf. Electronic Commerce (EC), pp. 29\u201338 (2011)","DOI":"10.1145\/1993574.1993581"},{"issue":"1\u20132","key":"44_CR5","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1007\/s00453-010-9457-2","volume":"62","author":"N Dimitrov","year":"2012","unstructured":"Dimitrov, N., Plaxton, G.: Competitive weighted matching in transversal matroids. Algorithmica 62(1\u20132), 333\u2013348 (2012)","journal-title":"Algorithmica"},{"issue":"5","key":"44_CR6","doi-asserted-by":"publisher","first-page":"1807","DOI":"10.1137\/13094030X","volume":"43","author":"M Dinitz","year":"2014","unstructured":"Dinitz, M., Kortsarz, G.: Matroid secretary for regular and decomposable matroids. SIAM J. Comput. 43(5), 1807\u20131830 (2014)","journal-title":"SIAM J. Comput."},{"key":"44_CR7","first-page":"627","volume":"4","author":"E Dynkin","year":"1963","unstructured":"Dynkin, E.: The optimum choice of the instant for stopping a Markov process. Sov. Math. Dokl. 4, 627\u2013629 (1963)","journal-title":"Sov. Math. Dokl."},{"key":"44_CR8","doi-asserted-by":"crossref","unstructured":"Feldman, M., Svensson, O., Zenklusen, R.: A simple O(log log(rank))-competitive algorithm for the matroid secretary problem. In: Proc. 26th Symp. Discrete Algorithms (SODA), pp. 1189\u20131201 (2015)","DOI":"10.1137\/1.9781611973730.79"},{"key":"44_CR9","doi-asserted-by":"crossref","unstructured":"Feldman, M., Tennenholtz, M.: Interviewing secretaries in parallel. In: Proc. 13th Conf. Electronic Commerce (EC), pp. 550\u2013567 (2012)","DOI":"10.1145\/2229012.2229053"},{"key":"44_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"508","DOI":"10.1007\/978-3-662-43951-7_43","volume-title":"Automata, Languages, and Programming","author":"O G\u00f6bel","year":"2014","unstructured":"G\u00f6bel, O., Hoefer, M., Kesselheim, T., Schleiden, T., V\u00f6cking, B.: Online independent set beyond the worst-case: secretaries, prophets, and periods. In: Esparza, J., Fraigniaud, P., Husfeldt, T., Koutsoupias, E. (eds.) ICALP 2014, Part II. LNCS, vol. 8573, pp. 508\u2013519. Springer, Heidelberg (2014)"},{"key":"44_CR11","doi-asserted-by":"crossref","unstructured":"Im, S., Wang, Y.: Secretary problems: Laminar matroid and interval scheduling. In: Proc. 22nd Symp. Discrete Algorithms (SODA), pp. 1265\u20131274 (2011)","DOI":"10.1137\/1.9781611973082.96"},{"key":"44_CR12","doi-asserted-by":"crossref","unstructured":"Immorlica, N., Kalai, A., Lucier, B., Moitra, A., Postlewaite, A., Tennenholtz, M.: Dueling algorithms. In: Proc. 43rd Symp. Theory of Computing (STOC), pp. 215\u2013224 (2011)","DOI":"10.1145\/1993636.1993666"},{"key":"44_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1007\/11944874_35","volume-title":"Internet and Network Economics","author":"N Immorlica","year":"2006","unstructured":"Immorlica, N., Kleinberg, R.D., Mahdian, M.: Secretary problems with competing employers. In: Spirakis, P.G., Mavronicolas, M., Kontogiannis, S.C. (eds.) WINE 2006. LNCS, vol. 4286, pp. 389\u2013400. Springer, Heidelberg (2006)"},{"key":"44_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1007\/978-3-642-36694-9_22","volume-title":"Integer Programming and Combinatorial Optimization","author":"P Jaillet","year":"2013","unstructured":"Jaillet, P., Soto, J.A., Zenklusen, R.: Advances on matroid secretary problems: free order model and laminar case. In: Goemans, M., Correa, J. (eds.) IPCO 2013. LNCS, vol. 7801, pp. 254\u2013265. Springer, Heidelberg (2013)"},{"key":"44_CR15","doi-asserted-by":"crossref","unstructured":"Karande, C., Mehta, A., Tripathi, P.: Online bipartite matching with unknown distributions. In: Proc. 43rd Symp. Theory of Computing (STOC), pp. 587\u2013596 (2011)","DOI":"10.1145\/1993636.1993715"},{"key":"44_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"589","DOI":"10.1007\/978-3-642-40450-4_50","volume-title":"Algorithms \u2013 ESA 2013","author":"T Kesselheim","year":"2013","unstructured":"Kesselheim, T., Radke, K., T\u00f6nnis, A., V\u00f6cking, B.: An optimal online algorithm for weighted bipartite matching and extensions to combinatorial auctions. In: Bodlaender, H.L., Italiano, G.F. (eds.) ESA 2013. LNCS, vol. 8125, pp. 589\u2013600. Springer, Heidelberg (2013)"},{"key":"44_CR17","doi-asserted-by":"crossref","unstructured":"Kesselheim, T., Radke, K., T\u00f6nnis, A., V\u00f6cking, B.: Primal beats dual on online packing LPs in the random-order model. In: Proc. 46th Symp. Theory of Computing (STOC), pp. 303\u2013312 (2014)","DOI":"10.1145\/2591796.2591810"},{"key":"44_CR18","unstructured":"Kleinberg, R.: A multiple-choice secretary algorithm with applications to online auctions. In: Proc. 16th Symp. Discrete Algorithms (SODA), pp. 630\u2013631 (2005)"},{"key":"44_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"508","DOI":"10.1007\/978-3-642-02930-1_42","volume-title":"Automata, Languages and Programming","author":"N Korula","year":"2009","unstructured":"Korula, N., P\u00e1l, M.: Algorithms for secretary problems on graphs and hypergraphs. In: Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S., Thomas, W. (eds.) ICALP 2009, Part II. LNCS, vol. 5556, pp. 508\u2013520. Springer, Heidelberg (2009)"},{"key":"44_CR20","doi-asserted-by":"crossref","unstructured":"Lachish, O.: O(log log rank) competitive ratio for the matroid secretary problem. In: Proc. 55th Symp. Foundations of Computer Science (FOCS), pp. 326\u2013335 (2014)","DOI":"10.1109\/FOCS.2014.42"},{"key":"44_CR21","doi-asserted-by":"publisher","first-page":"39","DOI":"10.2307\/2985407","volume":"10","author":"D Lindley","year":"1961","unstructured":"Lindley, D.: Dynamic programming and decision theory. Applied Statistics 10, 39\u201351 (1961)","journal-title":"Applied Statistics"},{"key":"44_CR22","doi-asserted-by":"crossref","unstructured":"Mehta, A., Saberi, A., Vazirani, U., Vazirani, V.: Adwords and generalized online matching. J. ACM 54(5) (2007)","DOI":"10.1145\/1284320.1284321"},{"issue":"1","key":"44_CR23","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1287\/moor.2013.0612","volume":"39","author":"M Molinaro","year":"2014","unstructured":"Molinaro, M., Ravi, R.: Geometry of online packing linear programs. Math. Oper. Res. 39(1), 46\u201359 (2014)","journal-title":"Math. Oper. Res."},{"issue":"1","key":"44_CR24","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1137\/110852061","volume":"42","author":"J Soto","year":"2013","unstructured":"Soto, J.: Matroid secretary problem in the random-assignment model. SIAM J. Comput. 42(1), 178\u2013211 (2013)","journal-title":"SIAM J. Comput."}],"container-title":["Lecture Notes in Computer Science","Automata, Languages, and Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-47666-6_44","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,31]],"date-time":"2023-01-31T04:13:33Z","timestamp":1675138413000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-662-47666-6_44"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783662476659","9783662476666"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-47666-6_44","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"20 June 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}