论文标题
在多对多匹配市场中随机稳定的晶格结构
Lattice structure of the random stable set in many-to-many matching market
论文作者
论文摘要
对于一个多对多的匹配市场，我们研究了一组随机稳定匹配的晶格结构。我们在随机稳定集中定义了部分顺序，并呈现两个直观的二进制操作，以计算匹配市场每一侧的最小上限和最大下限。然后，我们证明，使用这些二进制操作，一组随机稳定匹配形成了两个双晶格。
For a many-to-many matching market, we study the lattice structure of the set of random stable matchings. We define a partial order on the random stable set and present two intuitive binary operations to compute the least upper bound and the greatest lower bound for each side of the matching market. Then, we prove that with these binary operations the set of random stable matchings forms two dual lattices.
