An Approximation Algorithm for the Discrete Team Decision Problem
- R. Cogill and S. Lall.
- SIAM Journal on Control and Optimization, V. 45, No. 4, p. 1359--1368, 2006.
In this paper we study a discrete version of the classical team decision problem. It has been shown previously that the general discrete team decision problem is NP-hard. Here we present an efficient approximation algorithm for this problem. For the maximization version of this problem with nonnegative rewards, this algorithm computes decision rules which are guaranteed to be within a fixed bound of optimal.