General Graphs are Easier than Bipartite Graphs: Tight Bounds for Secretary Matching

Summary

This is a publication. If there is no link to the publication on this page, you can try the pre-formated search via the search engines listed on this page.

Authors: Tomer Ezra, Michal Feldman, Nick Gravin, Zhihao Gavin Tang

Journal title: ACM Conference on Economics and Computation (EC22)

Journal publisher: ACM

Published year: 2022

DOI identifier: 10.1145/3490486.3538290