Distributed decision making : the case of no communication

We examine the case of $n$ agents trying to achieve a global goal without any communication. Our analysis for the bottleneck probability of scheduling loads in common finite buffers also includes the first exact expressions for the density of a general sum of uniform random variables, this being obtained via a new polyhedral combinatorial approach.