Optimal, distributed decision-making: The case of no communication
Spirakis, Paul G.
Source12th International Symposium on Fundamentals of Computation Theory, FCT 1999
Google Scholar check
MetadataShow full item record
We present a combinatorial framework for the study of a natural class of distributed optimization problems that involve decisionmaking by a collection of n distributed agents in the presence of incomplete informationsuch problems were originally considered in a load balancing setting by Papadimitriou and Yannakakis (Proceedings of the 10th Annual ACM Symposium on Principles of Distributed Computing, pp. 61-64, August 1991). For any given decision protocol and assuming no communication among the agents, our framework allows to obtain a combinatorial inclusion-exclusion expression for the probability that no "overflow" occurs, called the winning probability, in terms of the volume of some simple combinatorial polytope. Within our general framework, we offer a complete resolution to the special cases of oblivious algorithms, for which agents do not "look at" their inputs, and non-oblivious algorithms, for which they do, of the general optimization problem. In either case, we derive optimality conditions in the form of combinatorial polynomial equations. For oblivious algorithms, we explicitly solve these equations to show that the optimal algorithm is simple and uniform, in the sense that agents need not "know" n. Most interestingly, we show that optimal non-oblivious algorithms must be non-uniform: we demonstrate that the optimality conditions admit different solutions for particular, different "small" values of nhowever, these solutions improve in terms of the winning probability over the optimal, oblivious algorithm. Our results demonstrate an interesting tradeoff between the amount of knowledge used by agents and uniformity for optimal, distributed decision-making with no communication. © Springer-Verlag Berlin Heidelberg 1999.
Showing items related by title, author, creator and subject.
Classes of nonlinear partially observable stochastic optimal control problems with explicit optimal control laws Charalambous, Charalambos D.; Elliott, R. J. (1998)This paper introduces certain nonlinear partially observable stochastic optimal control problems which are equivalent to completely observable control problems with finite-dimensional state space. In some cases the optimal ...
Optimization of fully observable nonlinear stochastic uncertain controlled diffusion: Monotonicity properties and optimal sensitivity Rezaei, F.; Charalambous, Charalambos D.; Kyprianou, Andreas (2004)This paper is concerned with fully observable nonlinear stochastically controlled diffusions, in which uncertainty is described by a relative entropy constraint between the nominal measure and the uncertain measure, while ...
Papadopoulos, A.; Theocharides, Theocharis; Michael, Maria K. (2011)