Maximum stable matching with one-sided ties of bounded length

DOI10.1007/978-3-030-30473-7_23zbMath1431.91260OpenAlexW2973164778MaRDI QIDQ5919371

C. Gregory Plaxton, Chi-Kit Lam

Publication date: 4 February 2020

Published in: Algorithmic Game Theory (Search for Journal in Brave)

Full work available at URL: https://rd.springer.com/content/pdf/10.1007%2F978-3-030-30473-7_23.pdf

zbMATH Keywords

approximation algorithmstable matchingintegrality gap

Mathematics Subject Classification ID

Approximation algorithms (68W25) Matching models (91B68)

Related Items (2)

On the approximability of the stable matching problem with ties of size two ⋮ Maximum stable matching with one-sided ties of bounded length

This page was built for publication: Maximum stable matching with one-sided ties of bounded length