{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,28]],"date-time":"2026-04-28T01:23:29Z","timestamp":1777339409428,"version":"3.51.4"},"publisher-location":"New York, NY, USA","reference-count":47,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,7,12]],"date-time":"2022-07-12T00:00:00Z","timestamp":1657584000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"New Generation of Artificial Intelligence? Major Project","award":["2018AAA0100903"],"award-info":[{"award-number":["2018AAA0100903"]}]},{"name":"NSFC","award":["62150610500,61902233"],"award-info":[{"award-number":["62150610500,61902233"]}]},{"DOI":"10.13039\/501100000781","name":"European Research Council","doi-asserted-by":"publisher","award":["866132, 788893"],"award-info":[{"award-number":["866132, 788893"]}],"id":[{"id":"10.13039\/501100000781","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Israel Science Foundation","award":["317\/17"],"award-info":[{"award-number":["317\/17"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,7,12]]},"DOI":"10.1145\/3490486.3538290","type":"proceedings-article","created":{"date-parts":[[2022,7,13]],"date-time":"2022-07-13T13:29:36Z","timestamp":1657718976000},"page":"1148-1177","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":10,"title":["General Graphs are Easier than Bipartite Graphs: Tight Bounds for Secretary Matching"],"prefix":"10.1145","author":[{"given":"Tomer","family":"Ezra","sequence":"first","affiliation":[{"name":"Sapienza University of Rome, Rome, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michal","family":"Feldman","sequence":"additional","affiliation":[{"name":"Tel Aviv University & Microsoft Research, Tel Aviv, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nick","family":"Gravin","sequence":"additional","affiliation":[{"name":"Shanghai University of Finance and Economics, Shanghai, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhihao Gavin","family":"Tang","sequence":"additional","affiliation":[{"name":"Shanghai University of Finance and Economics, Shanghai, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2022,7,13]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Online Vertex-Weighted Bipartite Matching and Single-bid Budgeted Allocations","author":"Aggarwal Gagan","unstructured":"Gagan Aggarwal , Gagan Goel , Chinmay Karande , and Aranyak Mehta . 2011. Online Vertex-Weighted Bipartite Matching and Single-bid Budgeted Allocations . In SODA. SIAM , 1253--1264. Gagan Aggarwal, Gagan Goel, Chinmay Karande, and Aranyak Mehta. 2011. Online Vertex-Weighted Bipartite Matching and Single-bid Budgeted Allocations. In SODA. SIAM, 1253--1264."},{"key":"e_1_3_2_1_2_1","unstructured":"Noga Alon Tristan Pollner and S. Matthew Weinberg. 2020. Three Results on Prophet Inequalities on (Hyper-) Graphs. Personal communication.  Noga Alon Tristan Pollner and S. Matthew Weinberg. 2020. Three Results on Prophet Inequalities on (Hyper-) Graphs. Personal communication."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"crossref","unstructured":"Itai Ashlagi Maximilien Burq Chinmoy Dutta Patrick Jaillet Amin Saberi and Chris Sholley. 2019. Edge Weighted Online Windowed Matching. In EC. ACM 729--742.  Itai Ashlagi Maximilien Burq Chinmoy Dutta Patrick Jaillet Amin Saberi and Chris Sholley. 2019. Edge Weighted Online Windowed Matching. In EC. ACM 729--742.","DOI":"10.1145\/3328526.3329573"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/3212512"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/3328526.3329627"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-010-9457-2"},{"key":"e_1_3_2_1_7_1","volume-title":"47th International Colloquium on Automata, Languages, and Programming, ICALP","author":"Dughmi Shaddin","year":"2020","unstructured":"Shaddin Dughmi . 2020. The Outer Limits of Contention Resolution on Matroids and Connections to the Secretary Problem . In 47th International Colloquium on Automata, Languages, and Programming, ICALP 2020 , July 8--11, 2020, Saarbr\u00fccken, Germany (Virtual Conference) (LIPIcs), Artur Czumaj, Anuj Dawar, and Emanuela Merelli (Eds.), Vol. 168 . Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik , 42:1--42:18. https:\/\/doi.org\/10.4230\/LIPIcs.ICALP.2020.42 10.4230\/LIPIcs.ICALP.2020.42 Shaddin Dughmi. 2020. The Outer Limits of Contention Resolution on Matroids and Connections to the Secretary Problem. In 47th International Colloquium on Automata, Languages, and Programming, ICALP 2020, July 8--11, 2020, Saarbr\u00fccken, Germany (Virtual Conference) (LIPIcs), Artur Czumaj, Anuj Dawar, and Emanuela Merelli (Eds.), Vol. 168. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, 42:1--42:18. https:\/\/doi.org\/10.4230\/LIPIcs.ICALP.2020.42"},{"key":"e_1_3_2_1_8_1","unstructured":"E. Dynkin. 1963. The optimum choice of the instant for stopping a markov process.  E. Dynkin. 1963. The optimum choice of the instant for stopping a markov process."},{"key":"e_1_3_2_1_9_1","volume-title":"Online Stochastic Max-Weight Matching: Prophet Inequality for Vertex and Edge Arrival Models. In EC '20: The 21st ACM Conference on Economics and Computation","author":"Ezra Tomer","year":"2020","unstructured":"Tomer Ezra , Michal Feldman , Nick Gravin , and Zhihao Gavin Tang . 2020 . Online Stochastic Max-Weight Matching: Prophet Inequality for Vertex and Edge Arrival Models. In EC '20: The 21st ACM Conference on Economics and Computation , Virtual Event, Hungary, July 13--17 , 2020, P\u00e9ter Bir\u00f3, Jason Hartline, Michael Ostrovsky, and Ariel D. Procaccia (Eds.). ACM, 769--787. https:\/\/doi.org\/10.1145\/3391403.3399513 10.1145\/3391403.3399513 Tomer Ezra, Michal Feldman, Nick Gravin, and Zhihao Gavin Tang. 2020. Online Stochastic Max-Weight Matching: Prophet Inequality for Vertex and Edge Arrival Models. In EC '20: The 21st ACM Conference on Economics and Computation, Virtual Event, Hungary, July 13--17, 2020, P\u00e9ter Bir\u00f3, Jason Hartline, Michael Ostrovsky, and Ariel D. Procaccia (Eds.). ACM, 769--787. https:\/\/doi.org\/10.1145\/3391403.3399513"},{"key":"e_1_3_2_1_10_1","volume-title":"Edge-Weighted Online Bipartite Matching","author":"Fahrbach Matthew","unstructured":"Matthew Fahrbach , Zhiyi Huang , Runzhou Tao , and Morteza Zadimoghaddam . 2020. Edge-Weighted Online Bipartite Matching . In FOCS. IEEE , 412--423. Matthew Fahrbach, Zhiyi Huang, Runzhou Tao, and Morteza Zadimoghaddam. 2020. Edge-Weighted Online Bipartite Matching. In FOCS. IEEE, 412--423."},{"key":"e_1_3_2_1_11_1","volume-title":"WINE (Lecture Notes in Computer Science)","author":"Feldman Jon","unstructured":"Jon Feldman , Nitish Korula , Vahab S. Mirrokni , S. Muthukrishnan , and Martin P\u00e1l. 2009. Online Ad Assignment with Free Disposal . In WINE (Lecture Notes in Computer Science) , Vol. 5929 . Springer , 374--385. Jon Feldman, Nitish Korula, Vahab S. Mirrokni, S. Muthukrishnan, and Martin P\u00e1l. 2009. Online Ad Assignment with Free Disposal. In WINE (Lecture Notes in Computer Science), Vol. 5929. Springer, 374--385."},{"key":"e_1_3_2_1_12_1","volume-title":"Combinatorial Auctions via Posted Prices","author":"Feldman Michal","unstructured":"Michal Feldman , Nick Gravin , and Brendan Lucier . 2015. Combinatorial Auctions via Posted Prices . In SODA. SIAM , 123--135. Michal Feldman, Nick Gravin, and Brendan Lucier. 2015. Combinatorial Auctions via Posted Prices. In SODA. SIAM, 123--135."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1287\/moor.2017.0876"},{"key":"e_1_3_2_1_14_1","volume-title":"Who Solved the Secretary Problem? Statist. Sci. 4, 3 (08","author":"Ferguson Thomas S.","year":"1989","unstructured":"Thomas S. Ferguson . 1989. Who Solved the Secretary Problem? Statist. Sci. 4, 3 (08 1989 ), 282--289. https:\/\/doi.org\/10.1214\/ss\/1177012493 10.1214\/ss Thomas S. Ferguson. 1989. Who Solved the Secretary Problem? Statist. Sci. 4, 3 (08 1989), 282--289. https:\/\/doi.org\/10.1214\/ss\/1177012493"},{"key":"e_1_3_2_1_15_1","volume-title":"Online Matching with General Arrivals","author":"Gamlath Buddhima","unstructured":"Buddhima Gamlath , Michael Kapralov , Andreas Maggiori , Ola Svensson , and David Wajc . 2019. Online Matching with General Arrivals . In FOCS. IEEE Computer Society , 26--37. Buddhima Gamlath, Michael Kapralov, Andreas Maggiori, Ola Svensson, and David Wajc. 2019. Online Matching with General Arrivals. In FOCS. IEEE Computer Society, 26--37."},{"key":"e_1_3_2_1_16_1","volume-title":"New Mathematical Diversions from Scientific American","author":"Gardner Martin","year":"1960","unstructured":"Martin Gardner . 1966. New Mathematical Diversions from Scientific American . Simon and Schuster , Chapter 3, problem 3. Reprint of the original column published in February 1960 with additional comments. Martin Gardner. 1966. New Mathematical Diversions from Scientific American. Simon and Schuster, Chapter 3, problem 3. Reprint of the original column published in February 1960 with additional comments."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1214\/aop\/1176988613"},{"key":"e_1_3_2_1_18_1","first-page":"1","article-title":"Online Stochastic Matching with Edge Arrivals. In ICALP (LIPIcs), Vol. 198","volume":"74","author":"Gravin Nick","year":"2021","unstructured":"Nick Gravin , Zhihao Gavin Tang , and Kangning Wang . 2021 . Online Stochastic Matching with Edge Arrivals. In ICALP (LIPIcs), Vol. 198 . Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik , 74 : 1 -- 74 :20. Nick Gravin, Zhihao Gavin Tang, and Kangning Wang. 2021. Online Stochastic Matching with Edge Arrivals. In ICALP (LIPIcs), Vol. 198. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, 74:1--74:20.","journal-title":"Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/3328526.3329604"},{"key":"e_1_3_2_1_20_1","volume-title":"IPCO 2017, Waterloo, ON, Canada, June 26--28, 2017, Proceedings (Lecture Notes in Computer Science), Friedrich Eisenbrand and Jochen K\u00f6nemann (Eds.)","volume":"10328","author":"Guruganesh Guru Prashanth","year":"2017","unstructured":"Guru Prashanth Guruganesh and Sahil Singla . 2017 . Online Matroid Intersection: Beating Half for Random Arrival. In Integer Programming and Combinatorial Optimization - 19th International Conference , IPCO 2017, Waterloo, ON, Canada, June 26--28, 2017, Proceedings (Lecture Notes in Computer Science), Friedrich Eisenbrand and Jochen K\u00f6nemann (Eds.) , Vol. 10328 . Springer, 241--253. Guru Prashanth Guruganesh and Sahil Singla. 2017. Online Matroid Intersection: Beating Half for Random Arrival. In Integer Programming and Combinatorial Optimization - 19th International Conference, IPCO 2017, Waterloo, ON, Canada, June 26--28, 2017, Proceedings (Lecture Notes in Computer Science), Friedrich Eisenbrand and Jochen K\u00f6nemann (Eds.), Vol. 10328. Springer, 241--253."},{"key":"e_1_3_2_1_21_1","volume-title":"Proceedings of the Twenty-Second AAAI Conference on Artificial Intelligence. 58--65","author":"Hajiaghayi Mohammad Taghi","year":"2007","unstructured":"Mohammad Taghi Hajiaghayi , Robert D. Kleinberg , and Tuomas Sandholm . 2007 . Automated Online Mechanism Design and Prophet Inequalities . In Proceedings of the Twenty-Second AAAI Conference on Artificial Intelligence. 58--65 . Mohammad Taghi Hajiaghayi, Robert D. Kleinberg, and Tuomas Sandholm. 2007. Automated Online Mechanism Design and Prophet Inequalities. In Proceedings of the Twenty-Second AAAI Conference on Artificial Intelligence. 58--65."},{"key":"e_1_3_2_1_22_1","first-page":"1","article-title":"Combinatorial Secretary Problems with Ordinal Information. In ICALP (LIPIcs), Vol. 80","volume":"133","author":"Hoefer Martin","year":"2017","unstructured":"Martin Hoefer and Bojana Kodric . 2017 . Combinatorial Secretary Problems with Ordinal Information. In ICALP (LIPIcs), Vol. 80 . Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik , 133 : 1 -- 133 :14. Martin Hoefer and Bojana Kodric. 2017. Combinatorial Secretary Problems with Ordinal Information. In ICALP (LIPIcs), Vol. 80. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, 133:1--133:14.","journal-title":"Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/3390890"},{"key":"e_1_3_2_1_24_1","volume-title":"Runzhou Tao, Xiaowei Wu, and Yuhao Zhang.","author":"Huang Zhiyi","year":"2019","unstructured":"Zhiyi Huang , Binghui Peng , Zhihao Gavin Tang , Runzhou Tao, Xiaowei Wu, and Yuhao Zhang. 2019 . Tight Competitive Ratios of Classic Matching Algorithms in the Fully Online Model. In SODA. SIAM , 2875--2886. Zhiyi Huang, Binghui Peng, Zhihao Gavin Tang, Runzhou Tao, Xiaowei Wu, and Yuhao Zhang. 2019. Tight Competitive Ratios of Classic Matching Algorithms in the Fully Online Model. In SODA. SIAM, 2875--2886."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/3326169"},{"key":"e_1_3_2_1_26_1","volume-title":"Xiaowei Wu, and Yuhao Zhang.","author":"Huang Zhiyi","year":"2020","unstructured":"Zhiyi Huang , Zhihao Gavin Tang , Xiaowei Wu, and Yuhao Zhang. 2020 . Fully Online Matching II: Beating Ranking and Water-filling . to appear in FOCS (2020). Zhiyi Huang, Zhihao Gavin Tang, Xiaowei Wu, and Yuhao Zhang. 2020. Fully Online Matching II: Beating Ranking and Water-filling. to appear in FOCS (2020)."},{"key":"e_1_3_2_1_27_1","volume-title":"AdWords in a Panorama","author":"Huang Zhiyi","unstructured":"Zhiyi Huang , Qiankun Zhang , and Yuhao Zhang . 2020. AdWords in a Panorama . In FOCS. IEEE , 1416--1426. Zhiyi Huang, Qiankun Zhang, and Yuhao Zhang. 2020. AdWords in a Panorama. In FOCS. IEEE, 1416--1426."},{"key":"e_1_3_2_1_28_1","volume-title":"Williamson","author":"Jin Billy","year":"2020","unstructured":"Billy Jin and David P . Williamson . 2020 . Improved Analysis of RANKING for Online Vertex-Weighted Bipartite Matching. CoRR abs\/2007.12823 (2020). Billy Jin and David P. Williamson. 2020. Improved Analysis of RANKING for Online Vertex-Weighted Bipartite Matching. CoRR abs\/2007.12823 (2020)."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"crossref","unstructured":"Chinmay Karande Aranyak Mehta and Pushkar Tripathi. 2011. Online bipartite matching with unknown distributions. In STOC. ACM 587--596.  Chinmay Karande Aranyak Mehta and Pushkar Tripathi. 2011. Online bipartite matching with unknown distributions. In STOC. ACM 587--596.","DOI":"10.1145\/1993636.1993715"},{"key":"e_1_3_2_1_30_1","volume-title":"Proceedings of the 22nd Annual ACM Symposium on Theory of Computing, STOC. ACM, 352--358","author":"Karp Richard M.","unstructured":"Richard M. Karp , Umesh V. Vazirani , and Vijay V. Vazirani . 1990. An Optimal Algorithm for On-line Bipartite Matching . In Proceedings of the 22nd Annual ACM Symposium on Theory of Computing, STOC. ACM, 352--358 . Richard M. Karp, Umesh V. Vazirani, and Vijay V. Vazirani. 1990. An Optimal Algorithm for On-line Bipartite Matching. In Proceedings of the 22nd Annual ACM Symposium on Theory of Computing, STOC. ACM, 352--358."},{"key":"e_1_3_2_1_31_1","volume-title":"ESA (Lecture Notes in Computer Science)","author":"Kesselheim Thomas","unstructured":"Thomas Kesselheim , Klaus Radke , Andreas T\u00f6nnis , and Berthold V\u00f6cking . 2013. An Optimal Online Algorithm for Weighted Bipartite Matching and Extensions to Combinatorial Auctions . In ESA (Lecture Notes in Computer Science) , Vol. 8125 . Springer , 589--600. Thomas Kesselheim, Klaus Radke, Andreas T\u00f6nnis, and Berthold V\u00f6cking. 2013. An Optimal Online Algorithm for Weighted Bipartite Matching and Extensions to Combinatorial Auctions. In ESA (Lecture Notes in Computer Science), Vol. 8125. Springer, 589--600."},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.geb.2014.11.002"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.5555\/1070432.1070519"},{"key":"e_1_3_2_1_34_1","volume-title":"ICALP (2) (Lecture Notes in Computer Science)","author":"Korula Nitish","unstructured":"Nitish Korula and Martin P\u00e1l. 2009. Algorithms for Secretary Problems on Graphs and Hypergraphs . In ICALP (2) (Lecture Notes in Computer Science) , Vol. 5556 . Springer , 508--520. Nitish Korula and Martin P\u00e1l. 2009. Algorithms for Secretary Problems on Graphs and Hypergraphs. In ICALP (2) (Lecture Notes in Computer Science), Vol. 5556. Springer, 508--520."},{"key":"e_1_3_2_1_35_1","volume-title":"Semiamarts and finite values. Bull. Amer. Math. Soc. 83, 4 (07","author":"Krengel Ulrich","year":"1977","unstructured":"Ulrich Krengel and Louis Sucheston . 1977. Semiamarts and finite values. Bull. Amer. Math. Soc. 83, 4 (07 1977 ), 745--747. Ulrich Krengel and Louis Sucheston. 1977. Semiamarts and finite values. Bull. Amer. Math. Soc. 83, 4 (07 1977), 745--747."},{"key":"e_1_3_2_1_36_1","first-page":"197","article-title":"On semiamarts, amarts, and processes with finite value","volume":"4","author":"Krengel Ulrich","year":"1978","unstructured":"Ulrich Krengel and Louis Sucheston . 1978 . On semiamarts, amarts, and processes with finite value . Advances in Prob 4 , 197 -- 266 (1978), 1--5. Ulrich Krengel and Louis Sucheston. 1978. On semiamarts, amarts, and processes with finite value. Advances in Prob 4, 197--266 (1978), 1--5.","journal-title":"Advances in Prob"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"crossref","unstructured":"Oded Lachish. 2014. O(log log Rank) Competitive Ratio for the Matroid Secretary Problem. In FOCS. IEEE Computer Society 326--335.  Oded Lachish. 2014. O(log log Rank) Competitive Ratio for the Matroid Secretary Problem. In FOCS. IEEE Computer Society 326--335.","DOI":"10.1109\/FOCS.2014.42"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"crossref","unstructured":"Mohammad Mahdian and Qiqi Yan. 2011. Online bipartite matching with random arrivals: an approach based on strongly factor-revealing LPs. In STOC. ACM 597--606.  Mohammad Mahdian and Qiqi Yan. 2011. Online bipartite matching with random arrivals: an approach based on strongly factor-revealing LPs. In STOC. ACM 597--606.","DOI":"10.1145\/1993636.1993716"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1561\/0400000057"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/1284320.1284321"},{"key":"e_1_3_2_1_41_1","unstructured":"Tristan Pollner. 2020. Two Problems In Combinatorial Optimization Under Uncertainty.  Tristan Pollner. 2020. Two Problems In Combinatorial Optimization Under Uncertainty."},{"key":"e_1_3_2_1_42_1","volume-title":"Classic Papers in Combinatorics","author":"Ramsey Frank P","unstructured":"Frank P Ramsey . 2009. On a problem of formal logic . In Classic Papers in Combinatorics . Springer , 1--24. Frank P Ramsey. 2009. On a problem of formal logic. In Classic Papers in Combinatorics. Springer, 1--24."},{"key":"e_1_3_2_1_43_1","volume-title":"An Optimal Truthful Mechanism for the Online Weighted Bipartite Matching Problem","author":"Reiffenh\u00e4user Rebecca","year":"1982","unstructured":"Rebecca Reiffenh\u00e4user . 2019. An Optimal Truthful Mechanism for the Online Weighted Bipartite Matching Problem . In SODA. SIAM , 1982 --1993. Rebecca Reiffenh\u00e4user. 2019. An Optimal Truthful Mechanism for the Online Weighted Bipartite Matching Problem. In SODA. SIAM, 1982--1993."},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/2897518.2897540"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"crossref","unstructured":"Ester Samuel-Cahn etal 1984. Comparison of threshold stop rules and maximum for independent nonnegative random variables. the Annals of Probability 12 4 (1984) 1213--1216.  Ester Samuel-Cahn et al. 1984. Comparison of threshold stop rules and maximum for independent nonnegative random variables. the Annals of Probability 12 4 (1984) 1213--1216.","DOI":"10.1214\/aop\/1176993150"},{"key":"e_1_3_2_1_46_1","volume-title":"Strong Algorithms for the Ordinal Matroid Secretary Problem","author":"Soto Jos\u00e9 A.","unstructured":"Jos\u00e9 A. Soto , Abner Turkieltaub , and Victor Verdugo . 2018. Strong Algorithms for the Ordinal Matroid Secretary Problem . In SODA. SIAM , 715--734. Jos\u00e9 A. Soto, Abner Turkieltaub, and Victor Verdugo. 2018. Strong Algorithms for the Ordinal Matroid Secretary Problem. In SODA. SIAM, 715--734."},{"key":"e_1_3_2_1_47_1","volume-title":"ICALP (1) (Lecture Notes in Computer Science)","author":"Wang Yajun","unstructured":"Yajun Wang and Sam Chiu-wai Wong . 2015. Two-sided Online Bipartite Matching and Vertex Cover: Beating the Greedy Algorithm . In ICALP (1) (Lecture Notes in Computer Science) , Vol. 9134 . Springer , 1070--1081. Yajun Wang and Sam Chiu-wai Wong. 2015. Two-sided Online Bipartite Matching and Vertex Cover: Beating the Greedy Algorithm. In ICALP (1) (Lecture Notes in Computer Science), Vol. 9134. Springer, 1070--1081."}],"event":{"name":"EC '22: The 23rd ACM Conference on Economics and Computation","location":"Boulder CO USA","acronym":"EC '22","sponsor":["SIGecom Special Interest Group on Economics and Computation"]},"container-title":["Proceedings of the 23rd ACM Conference on Economics and Computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3490486.3538290","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3490486.3538290","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T19:31:04Z","timestamp":1750188664000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3490486.3538290"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,7,12]]},"references-count":47,"alternative-id":["10.1145\/3490486.3538290","10.1145\/3490486"],"URL":"https:\/\/doi.org\/10.1145\/3490486.3538290","relation":{},"subject":[],"published":{"date-parts":[[2022,7,12]]},"assertion":[{"value":"2022-07-13","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}