用行走极大链表示所有稳定匹配
Representing All Stable Matchings by Walking a Maximal Chain
摘要：
Gusfield和Irving的开创性著作[GI89]提供了一种紧凑且在算法上有用的方法来表示与给定偏好集相对应的稳定匹配的集合。本文重新解释了[GI89]的主要结果，给出了刻画的一个新的证明，它能够绕过原著作中的许多“理论建构”.我们还提供了一个简化和有效的方式来计算这种表示。我们的证明和算法强调连接到众所周知的属性的延迟接受算法。
英文摘要：
The seminal book of Gusfield and Irving [GI89] provides a compact and algorithmically useful way to represent the collection of stable matches corresponding to a given set of preferences. In this paper, we reinterpret the main results of [GI89], giving a new proof of the characterization which is able to bypass a lot of the "theory building" of the original works. We also provide a streamlined and efficient way to compute this representation. Our proofs and algorithms emphasize the connection to well-known properties of the deferred acceptance algorithm.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
