arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1611.06189cs.DScs.AIcs.DM
收藏

锦标赛解的查询复杂度

Query Complexity of Tournament Solutions

Indian Institute of Technology, Kharagpur(印度理工学院卡拉格普尔分校)

Arnab Maiti, Palash Dey

AI总结:

本文研究锦标赛解的查询复杂度问题,给出Condorcet非失败者集的紧查询界,证明多种常用锦标赛解的最坏查询下界为Ω(n²),并在top cycle规模受限条件下得到更优的上界结果。

摘要:

每对顶点之间恰好存在一条边的有向图被称为锦标赛(tournament)。寻找锦标赛的“最佳”顶点集是社会选择理论中一个被广泛研究的问题。锦标赛解(tournament solution)以一个锦标赛作为输入,输出该输入锦标赛的一个顶点子集。然而在许多应用场景中,例如从给定的一组药物中选出最佳药物组,锦标赛的边仅以隐式形式给出,而确定一条边的方向需要付出成本。在这类场景下,我们希望通过尽可能少地“查询”边来确定最佳顶点集(依据某种锦标赛解)。\n\n本文针对常用的锦标赛解精确研究了这一问题:给定对锦标赛T的边的预言机访问权限,通过尽可能少的边查询求出f(T),其中f为一个锦标赛解。我们首先证明,仅需查询2n−⌊log n⌋−2条边即可找到锦标赛中的Condorcet非失败者集,且该结果是紧的——在最坏情况下,任何求解Condorcet非失败者集的算法都至少需要查询2n−⌊log n⌋−2条边,其中n为输入锦标赛的顶点数。\n\n随后我们研究了其他常用的锦标赛解,并证明在最坏情况下,任何求解Copeland集、Slater集、Markov集、bipartisan集、uncovered集、Banks集和top cycle的算法都必须查询Ω(n²)条边。在正面结果方面,我们通过证明以下结论规避了上述强查询复杂度下界结果:若输入锦标赛的top cycle规模至多为k,则仅需查询O(nk + n log n / log(1−1/k))条边即可求出所有上述提到的锦标赛解。

英文摘要:

A directed graph where there is exactly one edge between every pair of vertices is called a {\em tournament}. Finding the "best" set of vertices of a tournament is a well studied problem in social choice theory. A {\em tournament solution} takes a tournament as input and outputs a subset of vertices of the input tournament. However, in many applications, for example, choosing the best set of drugs from a given set of drugs, the edges of the tournament are given only implicitly and knowing the orientation of an edge is costly. In such scenarios, we would like to know the best set of vertices (according to some tournament solution) by "querying" as few edges as possible. We, in this paper, precisely study this problem for commonly used tournament solutions: given an oracle access to the edges of a tournament T, find $f(T)$ by querying as few edges as possible, for a tournament solution f. We first show that the set of Condorcet non-losers in a tournament can be found by querying $2n-\lfloor \log n \rfloor -2$ edges only and this is tight in the sense that every algorithm for finding the set of Condorcet non-losers needs to query at least $2n-\lfloor \log n \rfloor -2$ edges in the worst case, where $n$ is the number of vertices in the input tournament. We then move on to study other popular tournament solutions and show that any algorithm for finding the Copeland set, the Slater set, the Markov set, the bipartisan set, the uncovered set, the Banks set, and the top cycle must query $Ω(n^2)$ edges in the worst case. On the positive side, we are able to circumvent our strong query complexity lower bound results by proving that, if the size of the top cycle of the input tournament is at most $k$, then we can find all the tournament solutions mentioned above by querying $O(nk + \frac{n\log n}{\log(1-\frac{1}{k})})$ edges only.

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

↑