arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1804.02676cs.GTcs.CC
收藏

局部搜索的通信复杂性

The Communication Complexity of Local Search

Yakov Babichenko, Shahar Dobzinski, Noam Nisan

摘要:

我们研究以下局部搜索的通信变体。有一些固定的、众所周知的图$G$。Alice持有$f_A$,Bob持有$f_B$,两者都是为每个顶点指定值的函数。目标是找到$f_A+f_B$相对于$G$的局部最大值,即,顶点$v$,其中$(f_A+f_B)(v)\geq (f_A+f_B)(u)$用于$v$的每个邻居$u$。我们的主要结果是,找到一个局部最大值需要多项式(在顶点数)位的通信。该结果适用于以下图族:三维网格、超立方体、奇图和4度图。此外,我们提供了一个\emph{optimal}通信界的$Ω(\sqrt{N})$的超立方体,并为一个常数维贪婪,其中$N$是在图中的顶点数。我们提供了我们的主要结果在两个领域中的应用,确切的潜在的游戏和组合拍卖。首先,我们发现,在$2$ -玩家$N$ -动作精确势游戏中找到一个纯纳什均衡需要多项式(在$N$中)通信。我们还表明,在$n$ -玩家$2$ -行动精确的潜在游戏中找到一个纯纳什均衡需要指数(在$n$)通信。第二个域,我们认为是组合拍卖,在这里我们证明了,找到一个局部最大值组合拍卖需要指数(项目数)的通信,即使当估值是submodular。每个结果都表明总搜索问题的非确定性通信复杂性和随机通信复杂性之间呈指数分离。

英文摘要:

We study the following communication variant of local search. There is some fixed, commonly known graph $G$. Alice holds $f_A$ and Bob holds $f_B$, both are functions that specify a value for each vertex. The goal is to find a local maximum of $f_A+f_B$ with respect to $G$, i.e., a vertex $v$ for which $(f_A+f_B)(v)\geq (f_A+f_B)(u)$ for every neighbor $u$ of $v$. Our main result is that finding a local maximum requires polynomial (in the number of vertices) bits of communication. The result holds for the following families of graphs: three dimensional grids, hypercubes, odd graphs, and degree 4 graphs. Moreover, we provide an \emph{optimal} communication bound of $Ω(\sqrt{N})$ for the hypercube, and for a constant dimensional greed, where $N$ is the number of vertices in the graph. We provide applications of our main result in two domains, exact potential games and combinatorial auctions. First, we show that finding a pure Nash equilibrium in $2$-player $N$-action exact potential games requires polynomial (in $N$) communication. We also show that finding a pure Nash equilibrium in $n$-player $2$-action exact potential games requires exponential (in $n$) communication. The second domain that we consider is combinatorial auctions, in which we prove that finding a local maximum in combinatorial auctions requires exponential (in the number of items) communication even when the valuations are submodular. Each one of the results demonstrates an exponential separation between the non-deterministic communication complexity and the randomized communication complexity of a total search problem.

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

↑