On the complexity of stable fractional hypergraph matching

DOI10.4230/LIPIcs.ISAAC.2018.11OpenAlexW2907222859MaRDI QIDQ5091001

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

stable matchingPPAD-completenessfractional hypergraph matching

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Related Items (1)

On the complexity of stable hypergraph matching, stable multicommodity flow and related problems

Cites Work

• Unnamed Item
• Unnamed Item
• Matching couples with Scarf's algorithm
• On total functions, existence theorems and computational complexity
• On the complexity of the parity argument and other inefficient proofs of existence
• On a lemma of Scarf.
• Fractional solutions for capacitated NTU-games, with applications to stable matchings
• MATCHING WITH COUPLES: A MULTIDISCIPLINARY SURVEY
• Settling the complexity of computing two-player Nash equilibria
• Polynomial algorithms in linear programming
• The Complexity of Computing a Nash Equilibrium
• Reducibility among Fractional Stability Problems
• The Core of an N Person Game
• Equilibrium points in n -person games
• College Admissions and the Stability of Marriage

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