On the complexity of stable fractional hypergraph matching

DOI10.4230/LIPICS.ISAAC.2018.11MaRDI QIDQ5091001zbMATH OpenOpenAlexFDO

Authors Takashi Ishizuka, Naoyuki Kamiyama

Publication date 21 July 2022

Full work available at URL https://dblp.uni-trier.de/db/conf/isaac/isaac2018.html#IshizukaK18

zbMATH Keywords

fractional hypergraph matchingPPAD-completenessstable matching

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Recommendations

• On the complexity of stable hypergraph matching, stable multicommodity flow and related problems
• Stable fractional matchings
• scientific article; zbMATH DE number 2086256
• Approximating stable matchings with ties of bounded size
• Reducibility among fractional stability problems

Cites work

• College Admissions and the Stability of Marriage
• Equilibrium points in n -person games
• Fractional solutions for capacitated NTU-games, with applications to stable matchings
• scientific article; zbMATH DE number 45086 (Why is no real title available?)
• Matching couples with Scarf's algorithm
• Matching with couples: a multidisciplinary survey
• On a lemma of Scarf.
• On the complexity of the parity argument and other inefficient proofs of existence
• On total functions, existence theorems and computational complexity
• Polynomial algorithms in linear programming
• Reducibility among fractional stability problems
• Settling the complexity of computing two-player Nash equilibria
• The complexity of computing a Nash equilibrium
• The complexity of finding Nash equilibria
• The Core of an N Person Game

Cited in

(3)

• On the complexity of stable hypergraph matching, stable multicommodity flow and related problems
• Fractional Strong Matching Preclusion for DHcube
• Scarf's algorithm on arborescence hypergraphs

This page was built for publication: On the complexity of stable fractional hypergraph matching

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