Competitive query minimization for stable matching with one-sided uncertainty

DOI10.4230/LIPICS.APPROX/RANDOM.2024.17MaRDI QIDQ6920827zbMATH OpenFDO

Authors Evripidis Bampis, Konstantinos Dogeas, Thomas Erlebach, Nicole Megow, Jens Schlöter, Amitabh Trehan

Publication date 6 October 2025

Copyright license Creative Commons Attribution 4.0 International

zbMATH Keywords

uncertaintymatching under preferencesstable marriagequery-competitive algorithms

Mathematics Subject Classification ID

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

This page was built for publication: Competitive query minimization for stable matching with one-sided uncertainty

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