Abstract
In this paper, we provide another view of the basic difficulty of a nonclassical information structure decision problem. Computational considerations led us to the result that, under the assumption of linear information structure, the partially nested structure is the only class of structures which are equivalent to a static one.

This publication has 2 references indexed in Scilit: