Stable hypergraph matching in unimodular hypergraphs

DOI10.4230/LIPICS.ICALP.2025.31MaRDI QIDQ7346462zbMATH OpenFDO

Authors Péter Biró, Gergely Csáji, Ildikó Schlotter

Publication date 10 September 2026

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.ICALP.2025.31

Mathematics Subject Classification ID

Theory of software (68Nxx) Theory of computing (68Qxx)

Cites work

• Algorithmics of matching under preferences. With a foreword by Kurt Mehlhorn
• College Admissions and the Stability of Marriage
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Core in a simple coalition formation game
• Core stability in hedonic coalition formation
• Fractional solutions for capacitated NTU-games, with applications to stable matchings
• scientific article; zbMATH DE number 48303 (Why is no real title available?)
• Hypergraph theory. An introduction
• Normal hypergraphs and the perfect graph conjecture
• On a lemma of Scarf.
• On the complexity of stable hypergraph matching, stable multicommodity flow and related problems
• On the stable b-matching polytope.
• Reducibility among fractional stability problems
• The Core of an N Person Game

This page was built for publication: Stable hypergraph matching in unimodular hypergraphs

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