当前位置: X-MOL 学术arXiv.cs.MA › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
A Generalization of Teo and Sethuraman's Median Stable Marriage Theorem
arXiv - CS - Multiagent Systems Pub Date : 2020-01-09 , DOI: arxiv-2001.03133
Vijay K. Garg

Let $L$ be any finite distributive lattice and $B$ be any boolean predicate defined on $L$ such that the set of elements satisfying $B$ is a sublattice of $L$. Consider any subset $M$ of $L$ of size $k$ of elements of $L$ that satisfy $B$. Then, we show that $k$ generalized median elements generated from $M$ also satisfy $B$. We call this result generalized median theorem on finite distributive lattices. When this result is applied to the stable matching, we get Teo and Sethuraman's median stable matching theorem. Our proof is much simpler than that of Teo and Sethuraman. When the generalized median theorem is applied to the assignment problem, we get an analogous result for market clearing price vectors.

中文翻译:

Teo 和 Sethuraman 中值稳定婚姻定理的推广

令 $L$ 是任何有限分配格,$B$ 是定义在 $L$ 上的任何布尔谓词,使得满足 $B$ 的元素集合是 $L$ 的子格。考虑满足 $B$ 的 $L$ 元素的大小为 $k$ 的 $L$ 的任何子集 $M$。然后,我们证明从 $M$ 生成的 $k$ 广义中值元素也满足 $B$。我们称这个结果为有限分布格上的广义中值定理。当这个结果应用于稳定匹配时,我们得到了 Teo 和 Sethuraman 的中值稳定匹配定理。我们的证明比 Teo 和 Sethuraman 的证明简单得多。当广义中值定理应用于分配问题时,我们得到市场出清价格向量的类似结果。
更新日期:2020-01-10
down
wechat
bug