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 [9]. © 2008 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Bläser, M., & Vicari, E. (2008). Distributed algorithmic mechanism design and algebraic communication complexity. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4997 LNCS, pp. 206–217). https://doi.org/10.1007/978-3-540-79309-0_19
Mendeley helps you to discover research relevant for your work.