Computing values in cooperative games is a hard task because, in general, it involves the evaluation of a non polynomial numbers of terms. Sampling theory gives alternative ways to approximately compute these values and, at the same time, measures the error of these estimations. In this paper we present a rst attempt to apply sampling theory to compute values in games of any number of players.
© 2008-2024 Fundación Dialnet · Todos los derechos reservados