{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,12]],"date-time":"2025-10-12T20:09:57Z","timestamp":1760299797439,"version":"3.37.3"},"reference-count":38,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2018,2,13]],"date-time":"2018-02-13T00:00:00Z","timestamp":1518480000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"publisher","award":["Cluster of Excellence MMCI"],"award-info":[{"award-number":["Cluster of Excellence MMCI"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Distrib. Comput."],"published-print":{"date-parts":[[2019,10]]},"DOI":"10.1007\/s00446-018-0327-5","type":"journal-article","created":{"date-parts":[[2018,2,13]],"date-time":"2018-02-13T08:15:36Z","timestamp":1518509736000},"page":"361-378","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","volume":"32","author":[{"given":"Ning","family":"Chen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3806-0469","authenticated-orcid":false,"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":[[2018,2,13]]},"reference":[{"key":"327_CR1","doi-asserted-by":"crossref","unstructured":"Alaei, S., Hajiaghayi, M.T., Liaghat, V.: Online prophet-inequality matching with applications to ad allocation. In: Proceedings of 13th Conference Electronic Commerce (EC), pp. 18\u201335 (2012)","DOI":"10.1145\/2229012.2229018"},{"key":"327_CR2","doi-asserted-by":"crossref","unstructured":"Babaioff, M., Dinitz, M., Gupta, A., Immorlica, N., Talwar, K.: Secretary problems: weights and discounts. In: Proceedings of 20th Symposium Discrete Algorithms (SODA), pp. 1245\u20131254 (2009)","DOI":"10.1137\/1.9781611973068.135"},{"issue":"2","key":"327_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1399589.1399596","volume":"7","author":"Moshe Babaioff","year":"2008","unstructured":"Babaioff, M., Immorlica, Nicole, K., David, Kleinberg, R.: Online auctions and generalized secretary problems. SIGecom Exchanges, 7(2) (2008)","journal-title":"ACM SIGecom Exchanges"},{"key":"327_CR4","unstructured":"Babaioff, M., Immorlica, N., Kleinberg, R.: Matroids, secretary problems, and online mechanisms. In: Proceedings 18th Symposium Discrete Algorithms (SODA), pp. 434\u2013443 (2007)"},{"key":"327_CR5","doi-asserted-by":"crossref","unstructured":"Babichenko, Y., Emek, Y., Feldman, M., Patt-Shamir, B., Peretz, R., Smorodinsky, R.: Stable secretaries. In: Proceedings of 18th Conference Economics and Computation (EC), pp. 243\u2013244 (2017)","DOI":"10.1145\/3033274.3085103"},{"issue":"4","key":"327_CR6","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1145\/2500121","volume":"9","author":"MH Bateni","year":"2013","unstructured":"Bateni, M.H., Hajiaghayi, M.T., Zadimoghaddam, M.: Submodular secretary problem and extensions. ACM Trans. Algorithms 9(4), 32 (2013)","journal-title":"ACM Trans. Algorithms"},{"key":"327_CR7","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/978-3-642-13036-6_13","volume-title":"Integer Programming and Combinatorial Optimization","author":"Niv Buchbinder","year":"2010","unstructured":"Buchbinder, N., Jain, K., Singh, M.: Secretary problems via linear programming. In: Proceedingsof 14th International Conference Integer Programming and Combinatorial Optimization (IPCO), pp. 163\u2013176 (2010)"},{"key":"327_CR8","doi-asserted-by":"publisher","first-page":"552","DOI":"10.1007\/978-3-662-47666-6_44","volume-title":"Automata, Languages, and Programming","author":"Ning Chen","year":"2015","unstructured":"Chen, N., Hoefer, M., K\u00fcnnemann, M., Lin, Chengyu, M., Peihan: Secretary markets with local information. In: Proceedings of 42nd Intl. Coll. Automata, Languages and Programming (ICALP), vol. 2, pp. 552\u2013563 (2015)"},{"issue":"1","key":"327_CR9","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1287\/opre.2013.1233","volume":"62","author":"D Cownden","year":"2014","unstructured":"Cownden, D., Steinsaltz, D.: Effects of competition in a secretary problem. Oper. Res. 62(1), 104\u2013113 (2014)","journal-title":"Oper. Res."},{"key":"327_CR10","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: Proceedings of 12th Conference Electronic Commerce (EC), pp. 29\u201338 (2011)","DOI":"10.1145\/1993574.1993581"},{"issue":"1\u20132","key":"327_CR11","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":"327_CR12","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":"327_CR13","doi-asserted-by":"crossref","unstructured":"D\u00fctting, P., Feldman, M., Kesselheim, T., Lucier, B.: Prophet inequalities made easy: stochastic optimization by pricing non-stochastic inputs. In: Proceedings of 27th Symposium Foundations of Computer Science (FOCS), pp. 540\u2013551 (2017)","DOI":"10.1109\/FOCS.2017.56"},{"key":"327_CR14","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1007\/978-3-662-48350-3_37","volume-title":"Algorithms - ESA 2015","author":"Paul D\u00fctting","year":"2015","unstructured":"D\u00fctting, P., Kleinberg, R.: Polymatroid prophet inequalities. In: Proceedings of 23rd European Symposium Algorithms (ESA), pp. 437\u2013449 (2015)"},{"key":"327_CR15","unstructured":"Dynkin, E.: The optimum choice of the instant for stopping a Markov process. In: Sov. Math. Dokl, vol. 4, pp. 627\u2013629 (1963)"},{"key":"327_CR16","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: Proceedings of 26th Symposium Discrete Algorithms (SODA), pp. 1189\u20131201 (2015)","DOI":"10.1137\/1.9781611973730.79"},{"key":"327_CR17","doi-asserted-by":"crossref","unstructured":"Feldman, M., Tennenholtz, M.: Interviewing secretaries in parallel. In: Proceedings of 13th Conference Electronic Commerce (EC), pp. 550\u2013567 (2012)","DOI":"10.1145\/2229012.2229053"},{"key":"327_CR18","doi-asserted-by":"crossref","unstructured":"Feldman, M., Zenklusen, R.: The submodular secretary problem goes linear. In: Proceedings of 56th Symposium Foundations of Computer Science (FOCS), pp. 486\u2013505 (2015)","DOI":"10.1109\/FOCS.2015.37"},{"issue":"3","key":"327_CR19","doi-asserted-by":"publisher","first-page":"282","DOI":"10.1214\/ss\/1177012493","volume":"4","author":"T Ferguson","year":"1989","unstructured":"Ferguson, T.: Who solved the secretary problem? Stat. Sci. 4(3), 282\u2013289 (1989)","journal-title":"Stat. Sci."},{"key":"327_CR20","doi-asserted-by":"publisher","first-page":"508","DOI":"10.1007\/978-3-662-43951-7_43","volume-title":"Automata, Languages, and Programming","author":"Oliver 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: Proceedings of 41st Intl. Coll. Automata, Languages and Programming (ICALP), vol. 2, pp. 508\u2013519 (2014)"},{"key":"327_CR21","doi-asserted-by":"crossref","unstructured":"Gupta, A., Roth, A., Schoenebeck, G., Talwar, K.: Constrained non-monotone submodular maximization: Offline and secretary algorithms. In: Proceedings of 6th Workshop Internet & Network Economics (WINE), pp. 246\u2013257 (2010)","DOI":"10.1007\/978-3-642-17572-5_20"},{"key":"327_CR22","unstructured":"Hoefer, M., Kodric, B.: Combinatorial secretary problems with ordinal information. In: Proceedings of 44th Intl. Coll. Automata, Languages and Programming (ICALP), pp. 133:1\u2013133:14 (2017)"},{"key":"327_CR23","doi-asserted-by":"crossref","unstructured":"Im, S., Wang, Y.: Secretary problems: laminar matroid and interval scheduling. In: Proceedings of 22nd Symposium Discrete Algorithms (SODA), pp. 1265\u20131274 (2011)","DOI":"10.1137\/1.9781611973082.96"},{"key":"327_CR24","doi-asserted-by":"crossref","unstructured":"Immorlica, N., Kalai, A., Lucier, B., Moitra, A., Postlewaite, A., Tennenholtz, M.: Dueling algorithms. In: Proceedings of 43rd Symposium Theory of Computing (STOC), pp. 215\u2013224 (2011)","DOI":"10.1145\/1993636.1993666"},{"key":"327_CR25","doi-asserted-by":"crossref","unstructured":"Immorlica, N., Kleinberg, R., Mahdian, M.: Secretary problems with competing employers. In: Proceedings 2nd Workshop Internet & Network Economics (WINE), pp. 389\u2013400 (2006)","DOI":"10.1007\/11944874_35"},{"key":"327_CR26","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1007\/978-3-642-36694-9_22","volume-title":"Integer Programming and Combinatorial Optimization","author":"Patrick Jaillet","year":"2013","unstructured":"Jaillet, P., Soto, J., Zenklusen, R.: Advances on matroid secretary problems: free order model and laminar case. In: Proceedings of 16th International Conference Integer Programming and Combinatorial Optimization (IPCO), pp. 254\u2013265 (2013)"},{"key":"327_CR27","doi-asserted-by":"crossref","unstructured":"Karlin, A., Lei, E.: On a competitive secretary problem. In: Proceedings of 29th Conference Artificial Intelligence (AAAI), pp. 944\u2013950 (2015)","DOI":"10.1609\/aaai.v29i1.9312"},{"key":"327_CR28","first-page":"589","volume-title":"Lecture Notes in Computer Science","author":"Thomas Kesselheim","year":"2013","unstructured":"Kesselheim, T., Radke, K., Andreas, V.B.: An optimal online algorithm for weighted bipartite matching and extensions to combinatorial auctions. In: Proceedings of 21st European Symposium Algorithms (ESA), pp. 589\u2013600 (2013)"},{"key":"327_CR29","doi-asserted-by":"crossref","unstructured":"Kesselheim, T., Radke, K., Andreas, V.B.: Primal beats dual on online packing LPs in the random-order model. In: Proceedings of 46th Symposium Theory of Computing (STOC), pp. 303\u2013312 (2014)","DOI":"10.1145\/2591796.2591810"},{"key":"327_CR30","unstructured":"Kleinberg, R.: A multiple-choice secretary algorithm with applications to online auctions. In: Proceedings of 16th Symposium Discrete Algorithms (SODA), pp. 630\u2013631 (2005)"},{"key":"327_CR31","doi-asserted-by":"crossref","unstructured":"Kleinberg, R., Weinberg, M.: Matroid prophet inequalities. In: Proceedings of 44th Symposium Theory of Computing (STOC), pp. 123\u2013136 (2012)","DOI":"10.1145\/2213977.2213991"},{"key":"327_CR32","doi-asserted-by":"publisher","first-page":"508","DOI":"10.1007\/978-3-642-02930-1_42","volume-title":"Automata, Languages and Programming","author":"Nitish Korula","year":"2009","unstructured":"Korula, N.M.: Algorithms for secretary problems on graphs and hypergraphs. In: Proceedings of 36th International Coll. Automata, Languages and Programming (ICALP), pp. 508\u2013520 (2009)"},{"key":"327_CR33","doi-asserted-by":"publisher","first-page":"745","DOI":"10.1090\/S0002-9904-1977-14378-4","volume":"83","author":"U Krengel","year":"1977","unstructured":"Krengel, U., Sucheston, L.: Semiamarts and finite values. Bull. Am. Math. Soc 83, 745\u2013747 (1977)","journal-title":"Bull. Am. Math. Soc"},{"key":"327_CR34","first-page":"197","volume":"4","author":"U Krengel","year":"1978","unstructured":"Krengel, U., Sucheston, L.: On semiamarts, amarts and processes with finite value. Adv. Prob. 4, 197\u2013266 (1978)","journal-title":"Adv. Prob."},{"key":"327_CR35","doi-asserted-by":"crossref","unstructured":"Lachish, O.: O(log log rank) competitive ratio for the matroid secretary problem. In: Proceedings of 55th Symposium Foundations of Computer Science (FOCS), pp. 326\u2013335 (2014)","DOI":"10.1109\/FOCS.2014.42"},{"key":"327_CR36","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. Appl. Stat. 10, 39\u201351 (1961)","journal-title":"Appl. Stat."},{"key":"327_CR37","unstructured":"Molinaro, M., Ravi, R.: Geometry of online packing linear programs. Math. Oper. Res., 39(1), 46\u201359 (2014)"},{"issue":"1","key":"327_CR38","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":["Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00446-018-0327-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-018-0327-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-018-0327-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,14]],"date-time":"2022-08-14T07:05:48Z","timestamp":1660460748000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00446-018-0327-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,2,13]]},"references-count":38,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2019,10]]}},"alternative-id":["327"],"URL":"https:\/\/doi.org\/10.1007\/s00446-018-0327-5","relation":{},"ISSN":["0178-2770","1432-0452"],"issn-type":[{"type":"print","value":"0178-2770"},{"type":"electronic","value":"1432-0452"}],"subject":[],"published":{"date-parts":[[2018,2,13]]},"assertion":[{"value":"8 November 2016","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 February 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 February 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}