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

以最低的成本普及

Popularity at Minimum Cost

Telikepalli Kavitha, Meghana Nasre, Prajakta Nimbhorkar

摘要:

本文考虑了{ \em流行匹配}问题的一个扩展。流行的匹配问题的输入是一个二分图G =(A U B,E),其中A是一组人,B是一组项目,属于A的每个人a按照偏好顺序排列项目的子集,允许领带。流行的匹配问题寻求计算人与物品之间的匹配M*,使得不存在匹配M,其中更多的人对M比M* 更快乐。这样的匹配M* 被称为流行匹配。然而,存在不存在流行匹配的简单实例。在这里,我们考虑上述问题的以下自然扩展:与属于B的每个项目b相关联的是非负价格成本(b),即对于任何项目b,可以通过为每个副本支付一定数量的成本(b)来将b的新副本添加到输入图。当G不允许流行匹配时,问题是以最小的代价“扩充”G,使得新的图允许流行匹配。我们证明了这个问题是NP-难的;事实上,在sqrt{n1}/2的因子内近似它是NP-难的,其中n1是人数。这个问题有一个简单的多项式时间算法,当每个人都有一个长度最多为2的偏好列表。然而,如果我们考虑以最小代价“构造”一个图的问题,该图允许匹配所有人的流行匹配,那么即使使用长度为2的偏好列表,该问题也成为NP难的。另一方面,当每个项目的副本的数量是“固定的”,我们表明,计算最低成本流行的匹配或决定,没有流行的匹配存在的问题可以解决在O(mn 1)的时间,其中m是边缘的数量。

英文摘要:

We consider an extension of the {\em popular matching} problem in this paper. The input to the popular matching problem is a bipartite graph G = (A U B,E), where A is a set of people, B is a set of items, and each person a belonging to A ranks a subset of items in an order of preference, with ties allowed. The popular matching problem seeks to compute a matching M* between people and items such that there is no matching M where more people are happier with M than with M*. Such a matching M* is called a popular matching. However, there are simple instances where no popular matching exists. Here we consider the following natural extension to the above problem: associated with each item b belonging to B is a non-negative price cost(b), that is, for any item b, new copies of b can be added to the input graph by paying an amount of cost(b) per copy. When G does not admit a popular matching, the problem is to "augment" G at minimum cost such that the new graph admits a popular matching. We show that this problem is NP-hard; in fact, it is NP-hard to approximate it within a factor of sqrt{n1}/2, where n1 is the number of people. This problem has a simple polynomial time algorithm when each person has a preference list of length at most 2. However, if we consider the problem of "constructing" a graph at minimum cost that admits a popular matching that matches all people, then even with preference lists of length 2, the problem becomes NP-hard. On the other hand, when the number of copies of each item is "fixed", we show that the problem of computing a minimum cost popular matching or deciding that no popular matching exists can be solved in O(mn1) time, where m is the number of edges.

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

↑