Distributed Algorithmic Mechanism Design and Algebraic Communication Complexity [chapter]

Markus Bläser, Elias Vicari
2008 Lecture Notes in Computer Science  
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 over an arbitrary field k of characteristic 0, where the involved functions can be computed with the natural operations additions, multiplications and
more » ... and possibly with comparisons. 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.
doi:10.1007/978-3-540-79309-0_19 fatcat:4jxzih7tebdn3palt6tjukbhjy