Polynomial-time Stable Matching in Network Hypergraphs
Karthekeyan Chandrasekaran, Krishna Kalathur
Abstract
We show that there exists a polynomial-time algorithm to find a stable matching in network hypergraphic preference systems. The key connection that drives the algorithm was discovered by chatting with ChatGPT-5.6 Sol Max. We verified it independently and present the details in our own words.
Create a lesson
Related papers
A Near-Optimal Space Lower Bound for Euclidean Diameter Estimation in Dynamic Streams
Ashwin Padaki, Krish Singal, Erik Waingarten
A Walk From Free Probability to Matrix Discrepancy I: Matrix Spencer
Tarun Kathuria
A Walk From Free Probability to Matrix Discrepancy II: Weaver's Problem and the Kadison-Singer Conjecture
Tarun Kathuria
Degree-Free Spectral Independence for Log-Concave Holant Measures
Xiaoyu Chen, Zejia Chen, Xinyuan Zhang
Optimizing Both Checking and Update Costs in Random Walk Search
Simon Apers, Marin Costes
Routing Multiple Agents Below the Sum of Distances
Matthias Bentert, Eduard Eiben, Fedor V. Fomin et al.