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.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.