489 search results - page 5 / 98 » Communication Complexity of Permutation-Invariant Functions |
AAMAS
2002
Springer
15 years 1 months ago
2002
Springer
The evolution of collaboration and communication in communities of individuals is a puzzling problem for a wide range of scientific disciplines, spanning from evolutionary theory ...
125
click to vote
STOC
2009
ACM
16 years 1 months ago
2009
ACM
We consider the following question: given a two-argument boolean function f, represented as an N ? N binary matrix, how hard is to determine the (deterministic) communication comp...
FOCS
2008
IEEE
15 years 7 months ago
2008
IEEE
115
click to vote
ATAL
2006
Springer
15 years 5 months ago
2006
Springer
It is self-evident that in numerous Multiagent settings, selfish agents stand to benefit from cooperating by forming coalitions. Nevertheless, negotiating a stable distribution of...
109
click to vote
TMC
2008
15 years 1 months ago
2008
We consider a scenario in which a wireless sensor network is formed by randomly deploying n sensors to measure some spatial function over a field, with the objective of computing a...