Tomer Ezra, Michal Feldman, Nick Gravin, Zhihao Gavin Tang. General Graphs are Easier than Bipartite Graphs: Tight Bounds for Secretary Matching. In David M. Pennock, Ilya Segal, Sven Seuken, editors, EC '22: The 23rd ACM Conference on Economics and Computation, Boulder, CO, USA, July 11 - 15, 2022. pages 1148-1177, ACM, 2022. [doi]
Abstract is missing.