Approximating stable matchings with ties of bounded size

DOI10.1007/978-3-030-57980-7_12zbMath1506.91118arXiv2005.05228OpenAlexW3089746070MaRDI QIDQ2109960

Kanstantsin Pashkovich, Natig Tofigzade, Jochen Könemann

Publication date: 21 December 2022

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

zbMATH Keywords

combinatorial optimizationapproximation algorithmsstable matching

Mathematics Subject Classification ID

Approximation algorithms (68W25) Matching models (91B68) Algorithmic game theory and complexity (91A68)

This page was built for publication: Approximating stable matchings with ties of bounded size