Abstract
The rich mathematical theory of two-party communication naturally invites us to consider scenarios involving k > 2 players. In the simplest case, we have some function f(x)whose input x is decomposed into k equally-sized parts \(\rm x=\rm (x_{1},\,.\,.\,.\,,x_{k})\). There are k players who wish to collaboratively evaluate a given function f on every input x. Each player has unlimited computational power and full knowledge of the function. As in the case of two players, the players are not adversaries—they help and trust each other. Depending on what parts of the input x each player can see, there are two main models of communication:
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Jukna, S. (2012). Multi-Party Games. In: Boolean Function Complexity. Algorithms and Combinatorics, vol 27. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-24508-4_5
Download citation
DOI: https://doi.org/10.1007/978-3-642-24508-4_5
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-24507-7
Online ISBN: 978-3-642-24508-4
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)