Distributed Algorithmic Mechanism Design and Algebraic Communication Complexity
In this paper, we introduce and develop the field of algebraic communication complexity, the theory dealing with the least number of messages to be exchanged between two players in order to compute the value of a polynomial or rational function depending on an input distributed between the two players. We define a general algebraic model, where the involved functions can be computed with the natural operations additions, multiplications and divisions and possibly with comparisons. We provide various lower bound techniques, mainly for fields of characteristic 0.
We then apply this general theory to problems from distributed mechanism design, in particular to the multicast cost sharing problem, and study the number of messages that need to be exchanged to compute the outcome of the mechanism. This addresses a question raised by Feigenbaum, Papadimitriou, and Shenker .
KeywordsRational Function Communication Complexity Equality Test Combinatorial Auction Transcendence Degree
Unable to display preview. Download preview PDF.
- 4.Briest, P., Krysta, P., Vöcking, B.: Approximation techniques for utilitarian mechanism design. In: Proc. ACM Symp. on Theory of Computing (2005)Google Scholar
- 10.Feigenbaum, J., Shenker, S.: Distributed algorithmic mechanism design: Recent results and future directions. In: Proc. 6th Int. Workshop on Discr. Alg. and Methods for Mobile Comput. and Communic., pp. 1–13 (2002)Google Scholar
- 11.Grigoriev, D.: Probabilistic communication complexity over the reals (preprint, 2007)Google Scholar
- 12.Hromkovic̆, J.: Communication Complexity and Parallel Computation. Springer, Heidelberg (1998)Google Scholar
- 14.Lehmann, D., O’Callaghan, L., Shoham, Y.: Truth revelation in approximately efficient combinatorial auctions. In: Proc. ACM Conference on Electronic Commerce (2003)Google Scholar
- 18.Yao, A.C.: Some complexity questions related to distributed computing. In: Proc. of 11th ACM Symp. on Theory of Comput., pp. 209–213 (1979)Google Scholar