Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Witsenhausen's counterexample

Known as: Witsenhausen counterexample 
Witsenhausen's counterexample, shown in the figure below, is a deceptively simple toy problem in decentralized stochastic control. It was formulated… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
This paper proposes an optimization method, based on information theoretic ideas, to a class of distributed control problems. As… Expand
  • figure 1
  • table I
  • figure 2
  • figure 4
  • figure 3
Is this relevant?
2013
2013
Recently, a vector version of Witsenhausen's counterexample was considered and it was shown that in the asymptotic limit of… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2012
2012
Motivated by the presence of an implicit communication channel in the asymptotic version of Witsenhausen's counterexample… Expand
  • figure 1
  • figure 2
  • table I
  • figure 3
  • figure 4
Is this relevant?
2010
2010
Motivated by the existence of an implicit channel in Witsenhausen's counterexample, we formulate a vector extension that can be… Expand
  • figure 2
  • figure 3
  • figure 1
  • table I
  • figure 4
Is this relevant?
2010
2010
Q. In my graduate-level controls course, the instructor mentioned the “Witsenhausen counterexample,” which seems to have… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2010
2010
This paper answers a question raised by Doyle on the relevance of the Witsenhausen counterexample as a toy decentralized control… Expand
  • figure 1
Is this relevant?
2009
2009
Recently, we considered a vector version of Witsenhausen's counterexample and used a new lower bound to show that in that limit… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2001
Highly Cited
2001
We introduce the first algorithm for off-policy temporal-difference learning that is stable with linear function approximation… Expand
  • figure 3
  • figure 2
  • figure 4
Is this relevant?
Highly Cited
1998
Highly Cited
1998
The Nelder--Mead simplex algorithm, first published in 1965, is an enormously popular direct search method for multidimensional… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1997
Highly Cited
1997
Substantial policy changes, like market-oriented reforms by populist parties and steps towards peace by 'hawks,' are sometimes… Expand
Is this relevant?