Polynomial-time Stable Matching in Network Hypergraphs
arXiv:2608.24728
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.