arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1707.01608cs.GT
收藏

二部匹配中信息与序近似的权衡

Tradeoffs Between Information and Ordinal Approximation for Bipartite Matching

Elliot Anshelevich, Wennan Zhu

摘要:

我们研究了最大权二部匹配的有序近似算法。这样的算法只知道图中的代理/节点对于其优选匹配的顺序偏好,但必须与知道真实数值边权重(效用)的完全全知算法竞争。%,而不仅仅是它们的相对排序。有序近似就是能够用有限的信息产生好的结果。正因为如此,一个重要的问题是随着信息量的增加,算法能有多好。为了解决这个问题,在$\mathcal{X}$和$\mathcal{Y}$中的代理之间形成高效用匹配,我们考虑三种序数信息类型:当我们知道只有$\mathcal{X}$中的节点对$\mathcal{Y}$中的节点的偏好顺序时,当我们知道$\mathcal{X}$和$\mathcal{Y}$两者的偏好时,以及当我们知道整个图中的边权重的总顺序时,尽管不是权重本身。我们还考虑设置只有顶部的代理的偏好是我们所知道的,而不是他们的全部偏好排序。我们设计了新的顺序近似算法,为这些设置,并量化如何以及这样的算法执行的信息量给他们增加。

英文摘要:

We study ordinal approximation algorithms for maximum-weight bipartite matchings. Such algorithms only know the ordinal preferences of the agents/nodes in the graph for their preferred matches, but must compete with fully omniscient algorithms which know the true numerical edge weights (utilities). %instead of only their relative orderings. Ordinal approximation is all about being able to produce good results with only limited information. Because of this, one important question is how much better the algorithms can be as the amount of information increases. To address this question for forming high-utility matchings between agents in $\mathcal{X}$ and $\mathcal{Y}$, we consider three ordinal information types: when we know the preference order of only nodes in $\mathcal{X}$ for nodes in $\mathcal{Y}$, when we know the preferences of both $\mathcal{X}$ and $\mathcal{Y}$, and when we know the total order of the edge weights in the entire graph, although not the weights themselves. We also consider settings where only the top preferences of the agents are known to us, instead of their full preference orderings. We design new ordinal approximation algorithms for each of these settings, and quantify how well such algorithms perform as the amount of information given to them increases.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑