Polynomial-time Stable Matching in Network Hypergraphs

2026-08-25

AI Summary

本文提出了一种在网路超图偏好系统中寻找稳定匹配的多项式时间算法，该方法的关键联系是通过与ChatGPT-5.6 Sol Max交流发现。

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.

Problem

• polynomial-time
• stable matching
• network hypergraphs

Innovation

• polynomial-time algorithm
• stable matching
• network hypergraphs
• preference systems