Weizmann Logo
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



TR15-054 | 7th April 2015 23:06

Welfare Maximization with Limited Interaction


Authors: Noga Alon, Noam Nisan, Ran Raz, Omri Weinstein
Publication: 7th April 2015 23:53
Downloads: 1773


We continue the study of welfare maximization in unit-demand (matching) markets, in a distributed information model
where agent's valuations are unknown to the central planner, and therefore communication is required to determine an
efficient allocation. Dobzinski, Nisan and Oren (STOC'14) showed that if the market size is $n$, then $r$ rounds of interaction
(with logarithmic bandwidth) suffice to obtain an $n^{1/(r+1)}$-approximation to the optimal social welfare. In particular,
this implies that such markets converge to a stable state (constant approximation) in time logarithmic in the market size.

We obtain the first multi-round lower bound for this setup. We show that even if the allowable per-round bandwidth of each
agent is $n^{\eps(r)}$, the approximation ratio of any $r$-round (randomized) protocol is no better than $\Omega(n^{1/5^{r+1}})$,
implying an $\Omega(\log \log n)$ lower bound on the rate of convergence of the market to equilibrium.

Our construction and technique may be of interest to round-communication tradeoffs in the more general setting of
combinatorial auctions, for which the only known lower bound is for simultaneous ($r=1$) protocols [DNO14].

ISSN 1433-8092 | Imprint