The communication complexity of local search
From MaRDI portal
Publication:5212806
DOI10.1145/3313276.3316354zbMath1433.68143arXiv1804.02676OpenAlexW2964164893MaRDI QIDQ5212806
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
Noncooperative games (91A10) Graph theory (including graph drawing) in computer science (68R10) Auctions, bargaining, bidding and selling, and other market models (91B26) Communication complexity, information complexity (68Q11)
Related Items (6)
Communication complexity of approximate Nash equilibria ⋮ Quality of local equilibria in discrete exchange economies ⋮ Adventures in monotone complexity and TFNP ⋮ Combinatorial auctions with endowment effect ⋮ Near-Optimal Communication Lower Bounds for Approximate Nash Equilibria ⋮ Near-Optimal Communication Lower Bounds for Approximate Nash Equilibria
This page was built for publication: The communication complexity of local search
