Advertisement

Multi-Party Games

  • Stasys Jukna
Chapter
Part of the Algorithms and Combinatorics book series (AC, volume 27)

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:

Keywords

Boolean Function Communication Complexity Positive Instance Negative Instance Balance Partition 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  1. 1.Institute of InformaticsUniversity of FrankfurtFrankfurt am MainGermany
  2. 2.Institute of Mathematics and InformaticsVilnius UniversityVilniusLithuania

Personalised recommendations