摘要翻译：
对于多对多匹配市场，我们研究了随机稳定匹配集的格结构。在随机稳定集上定义了一个偏序，并给出了两个直观的二进制运算来计算匹配市场每边的最小上界和最大下界。然后，我们证明了通过这些二元运算，随机稳定匹配集形成两个对偶格。
---
英文标题：
《Lattice structure of the random stable set in many-to-many matching
  market》
---
作者：
Noelia Juarez and Pablo A. Neme and Jorge Oviedo
---
最新提交年份：
2020
---
分类信息：

一级分类：Economics        经济学
二级分类：Theoretical Economics        理论经济学
分类描述：Includes theoretical contributions to Contract Theory, Decision Theory, Game Theory, General Equilibrium, Growth, Learning and Evolution, Macroeconomics, Market and Mechanism Design, and Social Choice.
包括对契约理论、决策理论、博弈论、一般均衡、增长、学习与进化、宏观经济学、市场与机制设计、社会选择的理论贡献。
--

---
英文摘要：
  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.
---
PDF链接：
https://arxiv.org/pdf/2002.08156