The communication complexity of local search

DOI10.1145/3313276.3316354MaRDI QIDQ5212806zbMATH OpenOpenAlexFDO

Authors Yakov Babichenko, Shahar Dobzinski, Noam Nisan

Publication date 30 January 2020

Published in Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1804.02676

zbMATH Keywords

communication complexitycongestion gameslocal search

Mathematics Subject Classification ID

Communication complexity, information complexity (68Q11) Graph theory (including graph drawing) in computer science (68R10) Noncooperative games (91A10) Auctions, bargaining, bidding and selling, and other market models (91B26)

Abstract: 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 $Omega(sqrtN)$ 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.

Recommendations

• The Communication Complexity of Optimization
• Local search: complexity and approximation
• A note on the complexity of local search problems
• Local search in coding theory
• Computational Science - ICCS 2004
• Local search and the local structure of NP-complete problems
• On the probe complexity of local computation algorithms
• Computational bounds for local search in combinatorial optimization
• Communication-Aware Local Search for Distributed Constraint Optimization
• Local search inequalities

Cited in

(8)

• Combinatorial auctions with endowment effect
• Quality of local equilibria in discrete exchange economies
• The communication complexity of graphical games on grid graphs
• Near-Optimal Communication Lower Bounds for Approximate Nash Equilibria
• Adventures in monotone complexity and TFNP
• Near-Optimal Communication Lower Bounds for Approximate Nash Equilibria
• On the communication complexity of finding a king in a tournament
• The randomized query complexity of finding a Tarski fixed point on the Boolean hypercube

This page was built for publication: The communication complexity of local search

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5212806)