Secretary Matching Meets Probing with Commitment.

DOI10.4230/LIPICS.APPROX/RANDOM.2021.13MaRDI QIDQ6090884zbMATH OpenOpenAlexFDO

Authors Allan Borodin, Calum MacRury

Publication date 20 November 2023

Full work available at URL https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2021.13

zbMATH Keywords

bipartite matchingonline algorithmsoptimization under uncertaintystochastic probing

Mathematics Subject Classification ID

Randomized algorithms (68W20) Approximation algorithms (68W25) Combinatorial optimization (90C27)

Cited in

(2)

• Online bipartite matching in the probe-commit model
• A new impossibility result for online bipartite matching problems

This page was built for publication: Secretary Matching Meets Probing with Commitment.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6090884)