Stochastic Nestedness and the Belief Sharing Information Pattern

  • Serdar Yüksel
  • Published 2009 in IEEE Transactions on Automatic Control


Solutions to decentralized stochastic optimization problems lead to recursions in which the state space enlarges with the time-horizon, thus leading to non-tractability of classical dynamic programming. A common joint information state supplied to each of the agents leads to a tractable recursion, as is evident in the one-step-delayed information sharing… (More)
DOI: 10.1109/TAC.2009.2031723

3 Figures and Tables



Citations per Year

58 Citations

Semantic Scholar estimates that this publication has 58 citations based on the available data.

See our FAQ for additional information.

  • Presentations referencing similar topics