{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T13:39:53Z","timestamp":1740145193986,"version":"3.37.3"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2022,1,18]],"date-time":"2022-01-18T00:00:00Z","timestamp":1642464000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,18]],"date-time":"2022-01-18T00:00:00Z","timestamp":1642464000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100000181","name":"Air Force Office of Scientific Research","doi-asserted-by":"publisher","award":["FA9550-19-1-0106"],"award-info":[{"award-number":["FA9550-19-1-0106"]}],"id":[{"id":"10.13039\/100000181","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2022,6]]},"DOI":"10.1007\/s11590-021-01814-0","type":"journal-article","created":{"date-parts":[[2022,1,18]],"date-time":"2022-01-18T00:04:12Z","timestamp":1642464252000},"page":"1411-1426","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Online total bipartite matching problem"],"prefix":"10.1007","volume":"16","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4890-1302","authenticated-orcid":false,"given":"Meghan","family":"Shanks","sequence":"first","affiliation":[]},{"given":"Sheldon H.","family":"Jacobson","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,1,18]]},"reference":[{"key":"1814_CR1","doi-asserted-by":"crossref","unstructured":"Aggarwal, G., Goel, G., Karande, C., Mehta, A.: Online vertex-weighted bipartite matching and single-bid budgeted allocations. In: Proceedings of the Twenty-second Annual ACM-SIAM Symposium on Discrete Algorithms, SODA \u201911, pp. 1253\u20131264. Society for Industrial and Applied Mathematics, Philadelphia, PA, USA (2011). http:\/\/dl.acm.org\/citation.cfm?id=2133036.2133131","DOI":"10.1137\/1.9781611973082.95"},{"key":"1814_CR2","doi-asserted-by":"publisher","unstructured":"Ashlagi, I., Burq, M., Dutta, C., Jaillet, P., Saberi, A., Sholley, C.: Edge weighted online windowed matching. In: Proceedings of the 2019 ACM Conference on Economics and Computation, EC \u201919, pp. 729\u2013742. ACM, New York, NY, USA (2019). https:\/\/doi.org\/10.1145\/3328526.3329573","DOI":"10.1145\/3328526.3329573"},{"key":"1814_CR3","doi-asserted-by":"crossref","unstructured":"Bahmani, B., Kapralov, M.: Improved bounds for online stochastic matching. In: Algorithms: ESA 2010, pp. 170\u2013181. Springer, Berlin (2010)","DOI":"10.1007\/978-3-642-15775-2_15"},{"key":"1814_CR4","doi-asserted-by":"publisher","unstructured":"Feldman, J., Mehta, A., Mirrokni, V., Muthukrishnan, S.: Online stochastic matching: Beating 1-1\/e. In: 2009 50th Annual IEEE Symposium on Foundations of Computer Science, pp. 117\u2013126 (2009). https:\/\/doi.org\/10.1109\/FOCS.2009.72","DOI":"10.1109\/FOCS.2009.72"},{"key":"1814_CR5","doi-asserted-by":"crossref","unstructured":"Gamlath, B., Kapralov, M., Maggiori, A., Svensson, O., Wajc, D.: Online matching with general arrivals (2019)","DOI":"10.1109\/FOCS.2019.00011"},{"key":"1814_CR6","doi-asserted-by":"crossref","unstructured":"Haeupler, B., Mirrokni, V.S., Zadimoghaddam, M.: Online stochastic weighted matching: Improved approximation algorithms. In: Internet and Network Economics, pp. 170\u2013181. Springer, Berlin (2011)","DOI":"10.1007\/978-3-642-25510-6_15"},{"key":"1814_CR7","doi-asserted-by":"publisher","unstructured":"Huang, Z., Kang, N., Tang, Z.G., Wu, X., Zhang, Y., Zhu, X.: How to match when all vertices arrive online. In: Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2018, pp. 17\u201329. ACM, New York, NY, USA (2018). https:\/\/doi.org\/10.1145\/3188745.3188858","DOI":"10.1145\/3188745.3188858"},{"key":"1814_CR8","doi-asserted-by":"publisher","unstructured":"Huang, Z., Peng, B., Tang, Z.G., Tao, R., Wu, X., Zhang, Y.: Tight competitive ratios of classic matching algorithms in the fully online model, pp. 2875\u20132886 (2019). https:\/\/doi.org\/10.1137\/1.9781611975482.178","DOI":"10.1137\/1.9781611975482.178"},{"issue":"3","key":"1814_CR9","doi-asserted-by":"publisher","first-page":"624","DOI":"10.1287\/moor.2013.0621","volume":"39","author":"P Jaillet","year":"2014","unstructured":"Jaillet, P., Lu, X.: Online stochastic matching: new algorithms with better bounds. Math. Oper. Res. 39(3), 624\u2013646 (2014). https:\/\/doi.org\/10.1287\/moor.2013.0621","journal-title":"Math. Oper. Res."},{"issue":"3","key":"1814_CR10","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1016\/0020-0190(91)90231-6","volume":"38","author":"M Kao","year":"1991","unstructured":"Kao, M., Tate, S.R.: Online matching with blocked input. Inform. Process. Lett. 38(3), 113\u2013116 (1991). https:\/\/doi.org\/10.1016\/0020-0190(91)90231-6","journal-title":"Inform. Process. Lett."},{"key":"1814_CR11","doi-asserted-by":"publisher","unstructured":"Karp, R.M., Vazirani, U.V., Vazirani, V.V.: An optimal algorithm for on-line bipartite matching. In: Proceedings of the Twenty-second Annual ACM Symposium on Theory of Computing, STOC \u201990, pp. 352\u2013358. ACM, New York, NY, USA (1990). https:\/\/doi.org\/10.1145\/100216.100262","DOI":"10.1145\/100216.100262"},{"issue":"4","key":"1814_CR12","doi-asserted-by":"publisher","first-page":"2085","DOI":"10.1137\/070707014","volume":"48","author":"AJ Lee","year":"2009","unstructured":"Lee, A.J., McLay, L.A., Jacobson, S.H.: Designing aviation security passenger screening systems using nonlinear control. SIAM J. Control Optim. 48(4), 2085\u20132105 (2009)","journal-title":"SIAM J. Control Optim."},{"issue":"4","key":"1814_CR13","doi-asserted-by":"publisher","first-page":"559","DOI":"10.1287\/moor.1120.0551","volume":"37","author":"VH Manshadi","year":"2012","unstructured":"Manshadi, V.H., Gharan, S.O., Saberi, A.: Online stochastic matching: online actions based on offline statistics. Math. Oper. Res. 37(4), 559\u2013573 (2012). https:\/\/doi.org\/10.1287\/moor.1120.0551","journal-title":"Math. Oper. Res."},{"issue":"6","key":"1814_CR14","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1080\/07408170802510416","volume":"41","author":"LA McLay","year":"2009","unstructured":"McLay, L.A., Jacobson, S.H., Nikolaev, A.G.: A sequential stochastic passenger screening problem for aviation security. IIE Trans. 41(6), 575\u2013591 (2009)","journal-title":"IIE Trans."},{"issue":"4","key":"1814_CR15","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1561\/0400000057","volume":"8","author":"A Mehta","year":"2013","unstructured":"Mehta, A.: Online matching and ad allocation. Found. Trends Theor. Comput. Sci. 8(4), 265\u2013368 (2013). https:\/\/doi.org\/10.1561\/0400000057","journal-title":"Found. Trends Theor. Comput. Sci."},{"key":"1814_CR16","doi-asserted-by":"publisher","DOI":"10.1145\/1284320.1284321","author":"A Mehta","year":"2007","unstructured":"Mehta, A., Saberi, A., Vazirani, U., Vazirani, V.: Adwords and generalized online matching. J. ACM (2007). https:\/\/doi.org\/10.1145\/1284320.1284321","journal-title":"J. ACM"},{"issue":"2","key":"1814_CR17","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1287\/trsc.1070.0198","volume":"41","author":"AG Nikolaev","year":"2007","unstructured":"Nikolaev, A.G., Jacobson, S.H., McLay, L.A.: A sequential stochastic security system design problem for aviation security. Transp. Sci. 41(2), 182\u2013194 (2007)","journal-title":"Transp. Sci."},{"issue":"1","key":"1814_CR18","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1109\/TITS.2011.2167230","volume":"13","author":"AG Nikolaev","year":"2012","unstructured":"Nikolaev, A.G., Lee, A.J., Jacobson, S.H.: Optimal aviation security screening strategies with dynamic passenger risk updates. IEEE Trans. Intell. Transp. Syst. 13(1), 203\u2013212 (2012)","journal-title":"IEEE Trans. Intell. Transp. Syst."},{"key":"1814_CR19","unstructured":"Tsopelakos, A., Jacobson, S.H.: Optimal policies for the sequential stochastic threshold assignment problem. Technical report, University of Illinois, Urbana, IL (2018)"}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-021-01814-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11590-021-01814-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-021-01814-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,10]],"date-time":"2022-05-10T16:19:21Z","timestamp":1652199561000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11590-021-01814-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,1,18]]},"references-count":19,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2022,6]]}},"alternative-id":["1814"],"URL":"https:\/\/doi.org\/10.1007\/s11590-021-01814-0","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"type":"print","value":"1862-4472"},{"type":"electronic","value":"1862-4480"}],"subject":[],"published":{"date-parts":[[2022,1,18]]},"assertion":[{"value":"25 April 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 October 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 January 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}