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: EC '22: Proceedings of the 23rd ACM Conference on Economics and Computation

Journal publisher: dl.acm

Published year: 2022

Published pages: 1148–1177

DOI identifier: 10.1145/3490486.3538290