A stronger impossibility for fully online matching

DOI10.1016/j.orl.2021.08.012OpenAlexW3198403917MaRDI QIDQ2060387

Alexander Eckl, Anja Kirschbaum, Kevin Schewior, Marilena Leichter

Publication date: 13 December 2021

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2102.09432

zbMATH Keywords

competitive analysisonline algorithmsmatching theory

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Cites Work

• An optimal deterministic algorithm for online \(b\)-matching
• Bayesian Mechanism Design
• Fully Online Matching
• Tight Competitive Ratios of Classic Matching Algorithms in the Fully Online Model

This page was built for publication: A stronger impossibility for fully online matching