A stronger impossibility for fully online matching
type: Item
instance of: scholarly article
title: A stronger impossibility for fully online matching
author: Alexander Eckl
author: Anja Kirschbaum
author: Marilena Leichter
author: Kevin Schewior
published in: Operations Research Letters
publication date: 2021-12-13T00:00:00Z
full work available at URL: https://arxiv.org/abs/2102.09432
Mathematics Subject Classification ID: 90-XX
zbMATH DE Number: 7442931
zbMATH Keywords: online algorithms
zbMATH Keywords: competitive analysis
zbMATH Keywords: matching theory
MaRDI profile type: Publication
OpenAlex ID: W3198403917
cites work: Fully Online Matching
cites work: Tight Competitive Ratios of Classic Matching Algorithms in the Fully Online Model
cites work: An optimal deterministic algorithm for online \(b\)-matching
cites work: Online matching and ad allocation
DOI: 10.1016/J.ORL.2021.08.012
description: scientific article; zbMATH DE number 7442931