An Approximation Algorithm for the Discrete Team Decision Problem

Download PDF
Open Webpage

Randy Cogill, Sanjay Lall

Published: 2006, Last Modified: 22 May 2024SIAM J. Control. Optim. 2006EveryoneRevisionsBibTeXCC BY-SA 4.0
Abstract: 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.MSC codes93A1468Q2568W25