Slopey quantizers are locally optimal for Witsenhausen's counterexample
|
|
- Hollie Moore
- 5 years ago
- Views:
Transcription
1 Slopey quantizers are locally optimal for Witsenhausen's counterexample The MIT Faculty has mae this article openly available. Please share how this access benefits you. Your story matters. Citation As Publishe Publisher Ajorlou, Amir, an Jababaie, Ali. Slopey Quantizers Are Locally Optimal for Witsenhausen s Counterexample. 06 IEEE 55th Conference on Decision an Control (CDC), December -4 06, Las Vegas, Nevaa, USA, Institute of Electrical an Electronics Engineers (IEEE), December Institute of Electrical an Electronics Engineers (IEEE) Institute of Electrical an Electronics Engineers (IEEE) Version Author's final manuscript Accesse We Nov 4 7::40 EST 08 Citable Link Terms of Use Creative Commons Attribution-Noncommercial-Share Alike Detaile Terms
2 Slopey Quantizers Are Locally Optimal for Witsenhausen s Counterexample Amir Ajorlou an Ali Jababaie Abstract We stuy the perfect Bayesian equilibria of a leaer-follower game of incomplete information. The follower makes a noisy observation of the leaer s action (who moves first) an chooses an action minimizing her expecte eviation from the leaer s action. Knowing this, leaer who observes the realization of the state, chooses an action that minimizes her istance to the state of the worl an the ex-ante expecte eviation from the follower s action. We show the existence of what we call near piecewise-linear equilibria when there is strong complementarity between the leaer an the follower an the precision of the prior is poor. As a major consequence of this result, we prove local optimality of a class of slopey quantization strategies which ha been suspecte of being the optimal solution in the past, base on numerical evience for Witsenhausen s counterexample. Inex Terms Decentralize control, optimal stochastic control, incomplete information games, perfect Bayesian equilibrium. I. INTRODUCTION In his seminal work [], Witsenhausen constructe a simple two-stage linear-quaratic-gaussian (LQG) ecentralize control problem where the optimal controller happens to be nonlinear. This example showe for the first time that linear quaratic Gaussian team problems can have nonlinear solutions. By resorting to Witsenhausen s counterexample, [] prouce an example showing that the stanar ecentralize static output optimal control problem of linear eterministic systems coul also amit optimal nonlinear solutions. For nearly half a century, this counterexample has been a subject of intense research across multiple communities ( [3] [8]). The enogenous information structure of Witsenhausen s counterexample, where the signal observe in the secon stage is a noisy version of the control action in the first stage, gives rise to a nonclassical information structure. While the problem looks eceptively simple an quaratic on first look, it is actually a very complicate, nonconvex, functional optimization problem. This counterexample has she light on intricacies of optimal ecisions in stochastic team optimization problems with similar information structure. Naturally, this problem has given rise to a large boy of literature. For example, [9] provies a variant of Witsenhausen s counterexample with iscrete primitive ranom variables an finite support, where no optimal solution exists. Another interesting variant, with the same information structure but ifferent cost function, is the Gaussian test channel ( [4], [0]) where the linear strategies can be shown to be optimal. Also, [] shows that if the objective function is Institute for Data, Systems, an Society, Massachusetts Institute of Technology (MIT), Cambrige, MA 039, USA. {ajorlou,jababai}@mit.eu. This work was supporte by ARO MURI W9NF change to a worst case inuce norm, the linear controllers ominate nonlinear policies. While [] proves the existence of an optimal solution using tools from real an functional analysis, other works such as ( [6], [8]) suggest lifting the problem to an equivalent optimization problem over the space of probability measures an then employing tools from the optimal transport theory []. Although the optimal strategy an optimal cost for Witsenhausen s counterexample are still unknown, it can be shown that carefully esigne nonlinear strategies can largely outperform the linear strategies (see, e.g., the multi-point quantization strategies propose by [5]). This result, in particular, implies the fragility of the comparative statics an policies solely erive base on the linear strategies in problems with similar setting. A relevant line of research is to provie error bouns on the proximity to optimality for approximate solutions. [3] [5] use information theoretic techniques an vector versions of the original problem to provie such bouns. There are also several works aiming to approximate the optimal solution. [6] [9] employ ifferent heuristic approaches, all confirming an almost piecewiselinear form for the optimal controller. However, a complete optimality proof for such strategies has been elusive. In this paper, we view Witsenhausen s problem as a leaer-follower coorination game in which the action of the leaer is corrupte by an aitive noise, before reaching the follower. The leaer aims to coorinate with the follower while staying close to the observe state, recognizing that her action is not observe perfectly. As a result, she nees to signal the follower in a manner that can be ecoe efficiently. More than a mere acaemic counterexample, the above setup coul moel a scenario where coorination happens across generations an the insights of the leaer who is from a ifferent generation is corrupte/lost by the time the message reaches the future generations. If the leaer can internalize the fact that her actions will not be observe perfectly, how shoul she act to make sure coorination occur? When the leaer cares far more about coorination with the follower than staying on the message, the near piecewise-linear equilibrium strategy of the leaer coarsens the observation in well-space intervals, rather than merely broacasting a linearly scale version of the observe state as the linear strategy woul suggest. In this line, we prove the existence of a superior equilibrium strategy which coarsens the message via a slopey quantizer, making both the leaer an follower better off compare to the linear equilibrium strategies. To this en, we analyze the perfect Bayesian equilibria of this game an show that strong complimentarily between
3 the leaer an the follower combine with a prior with poor enough precision can give rise to nonlinear equilibria, an in particular, equilibria in form of slopey quantizers. To the best of our knowlege, this work is the first proviing an analytical rationale for the optimality of slopey quantization strategies for Witsenhausen s counterexample. The main iea behin the proof is to carefully construct a class of what we call near piecewise-linear strategies for the leaer that stays invariant uner the best response operator. By a near piecewise-linear strategy, we mean a piecewise strategy where the changes in the erivative in each segment are very small, making the strategy in each segment almost linear. Each strategy has a fixe number of segments, with leaer s action changing very slowly within each segment. As a result, leaer s actions stay very close to fixe points of the strategy in each segment. These fixe points are the values of the state which the leaer oes not istort. Therefore, well-space fixe points (combine with some appropriate bouns on the relative prior of the state of the worl in ifferent segments) reveal the leaer s actions to the follower with high probability, making the signal easily ecoable. As a consequence, we can characterize the best response of the follower to leaer s strategy. Using this characterization, we show that the best response of the leaer to follower s strategy also varies very little, essentially remaining near piecewise-linear as well. A key challenge in eriving the invariance property for this set of strategies for the leaer is to boun an control the isplacement in the fixe points an enpoints of the segments of leaer s strategy uner the best response. A key observation here is that the fixe points of the leaer s best responses are local minimizers of the expecte eviation of the leaer s action from the follower. This insight allows us to show that the fixe points of the leaer s best response lie in a tight neighborhoo of the fixe points of the follower s strategy. We then show that the fixe points of the follower s strategy in turn lie in a vicinity of a convex combination of the leaer s fixe points an the expecte value of the state of the worl within each segment. Combining the two, we can erive an approximate ynamics for the isplacement in the fixe points an enpoints of the segments in leaer s strategy uner the best response. Using this approximate ynamics, we then characterize an invariant set of fixe points an interval enpoints for leaer s strategy, which we can then use in orer to prove the existence of a near piecewise-linear equilibrium strategy for the leaer. II. MODEL The game consists of a leaer L an a follower F. Before the agents act, the state of the worlθ is rawn from a normal istribution with zero mean an variance σ. The leaer can observe the realization of θ an acts first. The payoff of the leaer is given as u L = r L (θ a L ) ( r L )(a F a L ), () where a F is the action of the follower an 0 < r L <. The follower makes a private, noisy observation of the leaer s action, s = a L + δ where δ N(0,). The payoff of the follower is u F = (a L a F ). () We consier the perfect Bayesian equilibria of the game an show that they reuce to the Bayes Nash equilibria ue to the Gaussian noise in the observation. Denote with a L (θ) an a F (s) the equilibrium strategies, an with ν ( s) the follower s belief about leaer s action given s. Due to the normal noise in the observation, ν ( s) is fully etermine by a L (θ) an the prior as there are no off-equilibrium-path information sets. Equilibrium strategies shoul thus satisfy a F (s) =E ν [a L s] = a L ν (a L s)a L, a L(θ) =argmax r L (θ a L ) a L ( r L ) (a F(s) a L ) φ(s a L )s, (3) where φ( ) enotes the PDF of the stanar normal istribution. We can easily characterize the linear equilibria of the game, following []. Theorem : Linear Bayes strategies of the leaer an follower are of the form a F (s) = µs an a L (θ) = λθ, where µ = t +t an λ = t σ, an t is a real root of the equation r L t (σ t) = r L (+t ). (4) Our main objective in this paper is to show the existence of an equilibrium with a near piecewise-linear strategy for the leaer in the regime where there is strong complementarity between the leaer an the follower (when r L is small) an the prior s precision is poor (or large σ). To this en, an motivate mainly by [], we focus on regime σ r Lσ, an aim to prove the existence of such an equilibrium for sufficiently large values of σ (an hence small r L ). III. NONLINEAR EQUILIBRIA Our approach for proving the existence of an equilibrium with a near piecewise-linear strategy for the leaer is to ientify a set of such strategies for the leaer that is invariant uner the best response operator. We characterize such a set in the next section. A. An Invariant Set of Near Piecewise-Linear Strategies for the Leaer Given m N, consier a partition of the normal istribution N(0,σ ) into m + segments m k= m B0 k, with Bk 0 = [b0 k,b0 k+ ) for k N m, B0 0 = (b 0,b 0 ), an B k 0 = (b 0 k,b0 k ], with b0 k = b0 k an b0 m+ = b0 m = +. Denote with c 0 k the expecte value of θ N(0,σ ) in segment Bk 0, that is, c0 k = E N(0,σ )[θ θ Bk 0 ]. Clearly, c 0 0 = 0 an c0 k = c0 k for k N m. We are in particular intereste in a partition where the interval enpoints b 0 k are the mipoints of [c0 k,c0 k ], i.e., Proofs are not inclue in this manuscript ue to space limitations. See [0] for the proofs.
4 b 0 k = c0 k +c0 k for k N m. We can show that such a partition exists an is unique. Next, we construct a set of (m+)- segmente increasing o functions, enote by A m L (r L,σ) satisfying the following properties. Property : For every a L (θ) A m L (r L,σ), there exist m + segments B k = [b k,b k+ ), for k N m, B 0 = ( b,b ), an B k = (b k,b k ], with b m+ = b m = + such that: a L (θ) is increasing an o (i.e., a L ( θ) = a L (θ)), an is smooth over each interval. a L (θ) has a unique fixe point in each segment. That is, for each interval B k, ( m k m), there exists a unique c k B k such that a L (c k ) = c k, with c 0 = 0. We also impose a constraint on the slope of a L (θ) in each interval, keeping the slope very close tor L, as well as a linear boun on a L (θ) in the tail. More precisely, we impose the following property: Property : For every m < k < m an θ B k, r θ a L(θ) r, where r = r L ( 0.5r L σ ) an r = r L (+.5r L σ ). For the tail interval B m, r θ a L(θ) r for b m < θ < c m + σ. For θ > c m + σ we have a L (θ) c m +5r L (θ c m +σ). The largerσ, the closer r an r to r L. For instance, choosing σ 6 ensures r <.0r L an r > 0.998r L. Finally, we impose the constraint that interval enpoints b k remain close to mipoints of [c k,c k ] an that fixe points c k remain close to c 0 k s. Property 3: For every k N m, Moreover, b k c k +c k 0.r L σ. (5) c k c 0 k k(m k)ζ r L, (6) where ζ = 0.44r L σ +(m+3.4)r L σ. Our proof strategy is then to show that for any m N, there exists σ m > 0 such that, for every σ σ m in regime σ r Lσ, the set of strategies A m L (r L,σ) characterize by Property -3 is invariant uner the best response operator. B. Best Response Analysis The first step in verifying the invariance of A m L (r L,σ) is to characterize the best response of the follower a F (s) to the leaer s strategy a L (θ) A m L (r L,σ). We can then use these properties to fin the upate best response of the leaer to a F (s), enote by ã(θ) an enforce its inclusion in A m L (r L,σ). Choosing σ sufficiently large, we can ensure several useful properties fora m L (r L,σ) that can facilitate this process. We state these properties in the lemma below. Lemma : There exists σ m max(6,7m ) such that for any σ σ m in regime σ r Lσ we have the following: The lengths of the half intervals in any strategya L (θ) A m L (r L,σ) are upper-boune by σ. That is, c k b k σ an c k b k σ for k N m. We only state the properties (an in many cases the analysis) only for θ 0. The counterpart for θ 0 is immeiate since the function is o. There exists a C > 3lnσ such that the lengths of the half intervals in any strategy a L (θ) A m L (r L,σ) are lower-boune by C. That is, c k b k C an c k b k C for k N m. Moreover, c m σ an b m 0.5σ. The lengths of the first half (secon half) of the intervals in any strategy a L (θ) A m L (r L,σ) are in increasing orer. That is, c k b k < c k+ b k+ an c k b k < c k b k+, for k N m. Moreover, b b > b ensuring an increasing orer on the lengths of the intervals as well. Let e k, 0 k m, be the expecte value of θ in segment B k, i.e., e k = E N(0,σ )[θ θ B k ]. Then, the istances from e k to the enpoints b k an b k+ also satisfies the lower an upper bouns C an σ. Moreover, e m 0.5σ. By choosing σ σ m, we can exploit the properties state for A m L (r L,σ) in the above lemma. In what follows, we use these properties to prove the invariance of the set of strategies A m L (r L,σ) uner the best response. The follower s best response to the strategy of the leaer a L (θ) is the expecte action of the leaer given the observations = a L +δ an can be written as a F (s) = E δ [a L s] = a L(θ)φ(s a L (θ))φ( θ σ )θ φ(s a L(θ))φ( θ σ )θ. (7) Using this, we can easily show that a F (s) is analytic an increasing, with s a F(s) = Var[a L s] (see [] for a proof). In orer to characterize a F (s), we start by estimating the expecte action of the leaer an its variance conitione on the interval to which θ belongs. Actions of the leaer in interval B k (k ±m) are well-concentrate aroun c k. In fact a L (θ) c k rσ for θ B k, from which the lemma below immeiately follows. Lemma : For 0 k < m, E[a L (θ) s,θ B k ] c k rσ an Var[a L (θ) s,θ B k ] r σ. The analysis is a bit involve in the tail, since for θ > c m the leaer s actions are not in a boune vicinity of c m anymore. However, we can erive several useful properties for the tail as well. Lemma 3: Consier a tail observation by the leaer (i.e., θ B m ). Then, for s c m +σ, an E[a L (θ) s,θ B m ] c m rσ, (8) E[a L (θ) s,θ B m ] c m 5r L σ(s c m ), (9) σ for s > c m +σ. Also, E[a L (θ) s,θ B m ] c m rσ. As for the variance, 3, for s < c m Var[a L (θ) s,θ B m ] 0.64 r σ, for c m s c m +σ 8.8rL σ (s c m ), for s > c m +σ. (0) Let the signal observe by the follower be between c k an c k+, i.e., s = c k +δ with0 δ c k+ c k. Then, we claim
5 that the follower s posterior on θ given s has a negligible probability out of the neighboring intervals B k B k+. We first erive the following property for the relative prior of θ in B k s by relating it to e k s an using the bouns on the istance from e k to the enpoints of the intervals, as well as the increasing orer of the lengths of the intervals given by Lemma. Lemma 4: For any m k,k m, we have Prob[θ B k ] Prob[θ B k ] e (ck c k ) 64. () This lemma implies that the posterior on θ is more affecte by the likelihoos rather than relative priors. Using this, we can boun the posterior of θ outsie the neighboring intervals to s (i.e., out of B k B k+ ). Lemma 5: Let the observe signal by the follower be s = c k +δ, where 0 δ c k+ c k. Then, for any r, Similarly, Prob[θ B k r s] Prob[θ B k s] e 45(c k c k r ) 5. () Prob[θ B k+r+ s] e 45(c k+r+ c k+ ) 5. (3) Prob[θ B k+ s] Using this lemma an the fact that the fixe points c k are well-space, we can show that the effect of the intervals other than B k an B k+ on a F (s) are negligible. In orer to characterize the follower s best response a F (s), we then nee to focus only on the segments ajacent to the observe signal, an in particular figure out the weight of each of these two neighboring intervals in the follower s posterior on θ. We o this in the following lemma. Lemma 6: Define m k+ = c k +c k+ + ( ) Prob[θ Bk ] ln, (4) k+ Prob[θ B k+ ] where k+ = c k+ c k. Also, write the signal observe by the follower as s = m k+ +δ. Then, for 0 k < m, e k+(δ+ rσ) r σ Prob[θ B k s] Prob[θ B k+ s] e k+(δ rσ)+ r σ. For the case involving the tail segment B m, e m(δ+ rσ) r σ Prob[θ B m s].68e m(δ rσ)+ r σ. ũ L (θ,a L ) = r L (θ a L ) Prob[θ B m s] (6) ( r L ) It is worth mentioning that m k+ efine in the above lemma is quite close to the mipoint of c k an c k+. In fact, it follows from Lemma 4 that m k+ c k+c k+ < k+ 64. We can now characterize the best response of the follower a F (s) to the leaer s strategy a L (θ) A m L (r L,σ) up to the first orer. Lemma 7: Let s = m k+ +δ, with c k s c k+. Then a F (s) c k + a F (s) c k + k+ +.68e k+(δ rσ)+ r σ k+ +e k+(δ+ rσ) r σ.0 rσ (5) +.0 rσ. (7) Also, 0 s a F(s).7e k+( δ rσ) ( k+ + rσ) +.0 r σ. (8) Corollary : A useful consequence of Lemma 7 is that a F (s) c k+.7e k+(δ rσ) k+.0 rσ a F (s) c k +.7e k+(δ+ rσ) k+ +.0 rσ, (9) where s = m k+ +δ, with c k s c k+. Note that the exponential terms in the above bouns vanish quite fast for large C an δ. for small δ, another useful upper boun on the erivative of a F (s) is s a F(s) 4 ( k+ + rσ) +.0 r σ. (0) Corollary : Let s = m k+ + δ, with c k s c k+. Then, c k.5 rσ a F (s) c k +.5 rσ for δ < 0.65 c k+.5 rσ a F (s) c k+ +.5 rσ for δ > () Roughly speaking, the above corollary says that, if the observe signal by the follower is far enough from the mipoint of c k an c k+, then the optimal action of the follower is well-concentrate aroun c k or c k+ (whichever that is closer), an changes very slowly accoring to Lemma 7. However, a F (s) may have very high variations for s close to m k+ as can be seen from Lemma 7. The following lemma characterizes a F (s) when follower makes a tail observation. Lemma 8: Let s = c m +δ, where δ > 0. Then, i) for δ σ, c m.0 rσ a F (s) c m + rσ, an 0 s a F(s) 0.65 r σ. ii) for δ > σ, c m.0 rσ a F (s) c m +5r L σ(δ σ ), an 0 s a F(s) 9r L σ δ. Lemma 7 an 8 provie the first orer characteristics of the best response of the follower to a leaer s strategy a L (θ) A m L (r L,σ). We are now reay to analyze the leaer s best response ã L (θ) to a F (s) an see if it stays in A m L (r L,σ). We have ã L (θ) = argmax al ũ L (θ,a L ), where (a F (s) a L ) φ(s a L )s. () Lemma 9: Consier θ [c k,c k+ ], 0 k < m. Then, there exists a unique b k+ [c k,c k+ ] such that ã L (θ) c k < 5 rσ for θ < b k+, ã L (θ) c k+ < 5 rσ for θ b k+. (3) The points b k+ etermine the segments of the best response strategy ã L (θ). We can boun the erivative of ã L (θ) over these segments by incorporating Lemma 7 an Corollary an into the above boun.
6 Lemma 0: Consier θ [c k,c k+ ], 0 k < m, with θ b k+. Then, r L θãl(θ) r L +( r L )(+0.3 r σ ) r L θãl(θ) r L +( r L )(.4 r σ ). (4) Using this lemma an the values = r L ( 0.5r r L σ ) an r = r L ( +.5rL σ ), we can easily verify that r θãl(θ) r. This means that Property is preserve by the best response for θ [ c m,c m ]. We stuy the tail case later in Lemma. Next, we characterize the fixe points of the best response strategy ã L (θ). Lemma : Define J L (a L ) = (a F (s) a L ) φ(s a L )s. (5) Then, JL (a L ) is strongly convex over [c k 5 rσ,c k +5 rσ], with J a L (a L ) (.4 r σ ). Let c k be the unique L solution of c k = argmin J L (a L ). (6) a L [c k 5 rσ,c k +5 rσ] Then, ã L ( c k ) = c k. The above lemma implies that Property is also preserve uner the best response. Next lemma escribes the tail properties of ã L (θ). Lemma : If b m < θ < c m +σ, then r θãl(θ) r. For θ > c m +σ, we have ã L (θ) c m +5r L (θ +σ c m ). (7) Now, in orer to verify that the upate strategy ã L (θ) satisfies Property 3, we nee to boun the isplacements in the fixe points c k an enpoints b k. Lemma 3: For the enpoints of the intervals corresponing to ã L (θ), we have b k+ c k + c k+ 0.r L σ. (8) Bouning the isplacement in c k has multiple steps: it involves relating the fixe point of the leaer s best response ã L (θ) in interval Bk to the fixe point of a F (s) in B k (i.e., s k ), followe by estimating s k in terms of c k an e k (recall that e k = E N(0,σ )[θ θ B k ], i.e., the expecte value of θ over B k ). Finally we boun the isplacement in e k with the isplacement of the interval enpoints using several properties of truncate normal istribution. Lemma 4: Let s k be the fixe point of a F (s) in the interval [c k 5 rσ,c k +5 rσ], i.e., a F (s k ) = s k. Then, c k s k < 0.44r L σ. (9) Lemma 5: s k can be locate base on c k an e k as s k ( r L )c k r L e k < (m+3.3)r Lσ. (30) Using Lemma 4 an 5, we can reach at c k ( r L )c k r L e k < 0.44r Lσ +(m+3.3)r Lσ. (3) We can now use (3) an Lemma 3 to verify that Property 3 is also preserve by the best response, completing the proof of the invariance of A m L (r L,σ) for σ σ m given by Lemma. Theorem : Consier the regime σ r Lσ an a given m N. Then, there exists σ m > 0 such that for any σ σ m, the set of (m+)-segmente strategies A m L (r L,σ) for the leaer, characterize by Property -3, is invariant uner the best response. Moreover, the game escribe in Section II has an equilibrium for which a L (θ,r L,σ) A m L (r L,σ). Given m N, the maximum eviation of fixe points c k from their counterparts c 0 k for strategies in Am L (r L,σ) is upper-boune by m (0.44r L σ +(m+3.4)r L σ), accoring to (6). This upper boun oes not grow unbounely with σ in the regime σ r Lσ. Furthermore, if σ + along a path where r L σ 0, this upper boun approaches zero, hence asymptotically ientifying the equilibrium strategy. Proposition : Let a 0 L (θ,r L,σ) be the (m+)-segmente piecewise-linear strategy with B 0 k s as segments an c0 k s as fixe points an fixe common slope r L, that is, a 0 L (θ,r L,σ) = c 0 k +r L(θ c 0 k ) for θ B0 k. Then, lim E N(0,σ )[ a L(θ,r L,σ) a 0 L(θ,r L,σ) ] 0. (3) r L σ 0 σ + IV. NUMERICAL EXAMPLES In [], Witsenhausen proves the existence of a nonlinear controller which outperforms the optimal linear strategy for a simple two-stage LQG ecentralize control problem. The equivalent regime uner our setup is k σ =, where k = rl r L. Witsenhausen shows that for large enough values of σ the optimal controller in this regime is nonlinear. It has been a long-staning conjecture that the optimal controller is a near piecewise-linear controller ( [4]). Theorem proves the existence of an equilibrium for the game of Section II with a near piecewise-linear strategy for the leaer for sufficiently large σ in the regime σ r Lσ ; This implies the existence of a slopey quantize local optimum 3 for Witsenhausen s counterexample in this regime (it is easy to verify that k σ = falls in this regime, since k σ = yiels σ < r Lσ = r L < for σ > ). The aim of this section is to illustrate Theorem for the special cases of m =, by specifying explicit values for σ m which guarantee the existence of 3-segmente an 5- segmente near piecewise-linear equilibria, respectively. Proposition (3-Segmente Equilibria): Suppose that σ r Lσ an σ 6. Then, the game escribe in Section II has an equilibrium with a L (θ,r L,σ) A L (r L,σ); a L (θ,r L,σ) is a 3-segmente near piecewise-linear strategy possessing Property -3. The strip containing this nonlinear strategy for the leaer for the caseσ = 6 anr L σ = r L is epicte in Figure (the plot only shows the region θ 0; a L ( θ) = a L (θ)). 3 This is inee stronger than a local optimum since, at an equilibrium, fixing one player s strategy the eviation in the other player s strategy oes not have to be local.
7 al(θ) θ Fig.. The strip containing the nonlinear equilibrium strategy for the leaer for the case σ = 6 an r L σ = r L. al(θ) θ Fig.. The strip containing the nonlinear equilibrium strategy for the leaer for the case σ = 60 an r L σ = r L. Proposition 3 (5-Segmente Equilibria): Suppose that σ r Lσ an σ Then, the game escribe in Section II has an equilibrium with a L (θ,r L,σ) A L (r L,σ); a L (θ,r L,σ) is a 5-segmente near piecewise-linear strategy possessing Property -3. The strip containing this nonlinear strategy for the leaer for the case σ = 60 an r L σ = r L is epicte in Figure. V. CONCLUSIONS We stuie Witsenhausen s counterexample in a leaerfollower game setup where the follower makes noisy observations from the leaer s action an aims to choose her action as close as possible to that of the leaer. Leaer who moves first an can see the realization of the state of the worl chooses her action to minimize her ex-ante istance from the follower s action as well as the state of the worl. We showe the existence of nonlinear perfect Bayesian equilibria in the regime where there is strong complementarity between the leaer an the follower when the prior has very poor precision. Our results provie the first analytical proof for the local optimality of near piecewise-linear controllers for the well-known Witsenhausen s counterexample, where the optimal controller is conjecture to be a slopey quantizer. REFERENCES [] H. S. Witsenhausen, A counterexample in stochastic optimum control, SIAM J. Control, vol. 6, pp. 3 47, 968. [] T. Başar, On the optimality of nonlinear esigns in the control of linear ecentralize systems, IEEE Transactions on Automatic Control, vol., p. 797, 976. [3] Y. Ho an T. Chang, Another look at the nonclassical information structure problem, IEEE Transactions on Automatic Control, vol. 5, pp , 980. [4] R. Bansal an T. Başar, Stochastic teams with nonclassical information revisite: When is an affine law optimal?, IEEE Transactions on Automatic Control, vol. 3, pp , 987. [5] S. Mitter an A. Sahai, Information an control: Witsenhausen revisite, Lecture Notes in Control an Information Sciences, vol. 4, pp. 8 93, 999. [6] Y. Wu an S. Verú, Witsenhausen s counterexample: A view from optimal transport theory, in Proceeings of the 50th IEEE Conf. Decision Control (CDC), pp , 0. [7] P. Grover, A. B. Wagner, an A. Sahai, Information embeing an the triple role of control, IEEE Transactions On Information Theory, vol. 6, pp , 05. [8] A. Gupta, S. Yüksel, T. Başar, an C. Langbort, On the existence of optimal policies for a class of static an sequential ynamic teams, SIAM J. Control Optim., vol. 53, pp. 68 7, 05. [9] S. Yüksel an T. Başar, Stochastic networke control systems: Stabilization an optimization uner information constraints, Birkhäuser, 03. [0] T. Başar, Variations on the theme of the Witsenhausen counterexample, in Proceeings of the 47th IEEE Conf. Decision Control (CDC), pp , 008. [] M. Rotkowitz, Linear controllers are uniformly optimal for the Witsenhausen counterexample, in Proceeings of the 45th IEEE Conf. Decision Control (CDC), pp , 006. [] C. Villani, Optimal Transport: Ol an New. Springer-Verlag, 009. [3] P. Grover an A. Sahai, A vector version of Witsenhausen s counterexample: Towars convergence of control, communication an computation, in Proceeings of the 47th IEEE Conf. Decision Control (CDC), pp , 008. [4] P. Grover an A. Sahai, Vector Witsenhausen counterexample as assiste interference suppression, Int. J. Syst., Control Commun (IJSCC) Spec. iss. Inf Process. Decision Making in Distribute Control Syst., vol., pp , 00. [5] P. Grover, S. Y. Park, an A. Sahai, Approximately optimal solutions to the finite-imensional Witsenhausen counterexample, IEEE Transactions on Automatic Control, vol. 58, pp , 03. [6] N. Li, J. R. Maren, an J. S. Shamma, Learning approaches to the Witsenhausen counterexample from a view of potential games, in Proceeings of the 48th IEEE Conf. Decision Control (CDC), 009. [7] M. Baglietto, T. Parisini, an R. Zoppoli, Numerical solutions to the Witsenhausen counterexample by approximating networks, IEEE Transactions on Automatic Control, vol. 46, pp , 00. [8] J. T. Lee, E. Lau,, an Y.-C. L.Ho, The Witsenhausen counterexample: A hierarchical search approach for nonconvex optimization problems, IEEE Transactions on Automatic Control, vol. 46, pp , 00. [9] M. Mehmetoglu, E. Akyol, an K. Rose, A eterministic annealing approach to Witsenhausen s counterexample, in ISIT, 04. [0] A. Ajorlou an A. Jababaie, Slopey quantizers are locally optimal for witsenhausen s counterexample, available at: org/abs/ , It is to be note that smaller values for σ m may work here (an similarly in Proposition ). These values are obtaine using the bouns erive for generic m. Of course, given a specific value of m, these bouns can be tightene much further which may result in smaller values for σ m.
arxiv: v4 [math.oc] 2 Jun 2017
Local Optimality of Almost Piecewise-Linear Quantizers for Witsenhausen s Problem Amir Ajorlou Ali Jababaie arxiv:1604.03806v4 [math.oc] Jun 017 Abstract We pose Witsenhausen s problem as a leaer-follower
More informationInformation Structures, the Witsenhausen Counterexample, and Communicating Using Actions
Information Structures, the Witsenhausen Counterexample, and Communicating Using Actions Pulkit Grover, Carnegie Mellon University Abstract The concept of information-structures in decentralized control
More informationTime-of-Arrival Estimation in Non-Line-Of-Sight Environments
2 Conference on Information Sciences an Systems, The Johns Hopkins University, March 2, 2 Time-of-Arrival Estimation in Non-Line-Of-Sight Environments Sinan Gezici, Hisashi Kobayashi an H. Vincent Poor
More informationLeast-Squares Regression on Sparse Spaces
Least-Squares Regression on Sparse Spaces Yuri Grinberg, Mahi Milani Far, Joelle Pineau School of Computer Science McGill University Montreal, Canaa {ygrinb,mmilan1,jpineau}@cs.mcgill.ca 1 Introuction
More informationA Deterministic Annealing Approach to Witsenhausen s Counterexample
A Deterministic Annealing Approach to Witsenhausen s Counterexample Mustafa Mehmetoglu Dep. of Electrical-Computer Eng. UC Santa Barbara, CA, US Email: mehmetoglu@ece.ucsb.edu Emrah Akyol Dep. of Electrical
More informationEquilibrium in Queues Under Unknown Service Times and Service Value
University of Pennsylvania ScholarlyCommons Finance Papers Wharton Faculty Research 1-2014 Equilibrium in Queues Uner Unknown Service Times an Service Value Laurens Debo Senthil K. Veeraraghavan University
More informationLecture 2 Lagrangian formulation of classical mechanics Mechanics
Lecture Lagrangian formulation of classical mechanics 70.00 Mechanics Principle of stationary action MATH-GA To specify a motion uniquely in classical mechanics, it suffices to give, at some time t 0,
More informationLeaving Randomness to Nature: d-dimensional Product Codes through the lens of Generalized-LDPC codes
Leaving Ranomness to Nature: -Dimensional Prouct Coes through the lens of Generalize-LDPC coes Tavor Baharav, Kannan Ramchanran Dept. of Electrical Engineering an Computer Sciences, U.C. Berkeley {tavorb,
More informationOn Decentralized Optimal Control and Information Structures
2008 American Control Conference Westin Seattle Hotel, Seattle, Washington, USA June 11-13, 2008 FrC053 On Decentralize Optimal Control an Information Structures Naer Motee 1, Ali Jababaie 1 an Bassam
More informationPDE Notes, Lecture #11
PDE Notes, Lecture # from Professor Jalal Shatah s Lectures Febuary 9th, 2009 Sobolev Spaces Recall that for u L loc we can efine the weak erivative Du by Du, φ := udφ φ C0 If v L loc such that Du, φ =
More informationA PAC-Bayesian Approach to Spectrally-Normalized Margin Bounds for Neural Networks
A PAC-Bayesian Approach to Spectrally-Normalize Margin Bouns for Neural Networks Behnam Neyshabur, Srinah Bhojanapalli, Davi McAllester, Nathan Srebro Toyota Technological Institute at Chicago {bneyshabur,
More informationConvergence of Random Walks
Chapter 16 Convergence of Ranom Walks This lecture examines the convergence of ranom walks to the Wiener process. This is very important both physically an statistically, an illustrates the utility of
More informationLearning Approaches to the Witsenhausen Counterexample From a View of Potential Games
Learning Approaches to the Witsenhausen Counterexample From a View of Potential Games Na Li, Jason R. Marden and Jeff S. Shamma Abstract Since Witsenhausen put forward his remarkable counterexample in
More informationComputing Exact Confidence Coefficients of Simultaneous Confidence Intervals for Multinomial Proportions and their Functions
Working Paper 2013:5 Department of Statistics Computing Exact Confience Coefficients of Simultaneous Confience Intervals for Multinomial Proportions an their Functions Shaobo Jin Working Paper 2013:5
More informationSome Examples. Uniform motion. Poisson processes on the real line
Some Examples Our immeiate goal is to see some examples of Lévy processes, an/or infinitely-ivisible laws on. Uniform motion Choose an fix a nonranom an efine X := for all (1) Then, {X } is a [nonranom]
More informationRelative Entropy and Score Function: New Information Estimation Relationships through Arbitrary Additive Perturbation
Relative Entropy an Score Function: New Information Estimation Relationships through Arbitrary Aitive Perturbation Dongning Guo Department of Electrical Engineering & Computer Science Northwestern University
More informationLectures - Week 10 Introduction to Ordinary Differential Equations (ODES) First Order Linear ODEs
Lectures - Week 10 Introuction to Orinary Differential Equations (ODES) First Orer Linear ODEs When stuying ODEs we are consiering functions of one inepenent variable, e.g., f(x), where x is the inepenent
More informationPrep 1. Oregon State University PH 213 Spring Term Suggested finish date: Monday, April 9
Oregon State University PH 213 Spring Term 2018 Prep 1 Suggeste finish ate: Monay, April 9 The formats (type, length, scope) of these Prep problems have been purposely create to closely parallel those
More informationLower bounds on Locality Sensitive Hashing
Lower bouns on Locality Sensitive Hashing Rajeev Motwani Assaf Naor Rina Panigrahy Abstract Given a metric space (X, X ), c 1, r > 0, an p, q [0, 1], a istribution over mappings H : X N is calle a (r,
More informationMulti-agent Systems Reaching Optimal Consensus with Time-varying Communication Graphs
Preprints of the 8th IFAC Worl Congress Multi-agent Systems Reaching Optimal Consensus with Time-varying Communication Graphs Guoong Shi ACCESS Linnaeus Centre, School of Electrical Engineering, Royal
More informationTopic 7: Convergence of Random Variables
Topic 7: Convergence of Ranom Variables Course 003, 2016 Page 0 The Inference Problem So far, our starting point has been a given probability space (S, F, P). We now look at how to generate information
More informationSurvey Sampling. 1 Design-based Inference. Kosuke Imai Department of Politics, Princeton University. February 19, 2013
Survey Sampling Kosuke Imai Department of Politics, Princeton University February 19, 2013 Survey sampling is one of the most commonly use ata collection methos for social scientists. We begin by escribing
More informationQuantum mechanical approaches to the virial
Quantum mechanical approaches to the virial S.LeBohec Department of Physics an Astronomy, University of Utah, Salt Lae City, UT 84112, USA Date: June 30 th 2015 In this note, we approach the virial from
More informationAgmon Kolmogorov Inequalities on l 2 (Z d )
Journal of Mathematics Research; Vol. 6, No. ; 04 ISSN 96-9795 E-ISSN 96-9809 Publishe by Canaian Center of Science an Eucation Agmon Kolmogorov Inequalities on l (Z ) Arman Sahovic Mathematics Department,
More informationQuantum Mechanics in Three Dimensions
Physics 342 Lecture 20 Quantum Mechanics in Three Dimensions Lecture 20 Physics 342 Quantum Mechanics I Monay, March 24th, 2008 We begin our spherical solutions with the simplest possible case zero potential.
More informationBEYOND THE CONSTRUCTION OF OPTIMAL SWITCHING SURFACES FOR AUTONOMOUS HYBRID SYSTEMS. Mauro Boccadoro Magnus Egerstedt Paolo Valigi Yorai Wardi
BEYOND THE CONSTRUCTION OF OPTIMAL SWITCHING SURFACES FOR AUTONOMOUS HYBRID SYSTEMS Mauro Boccaoro Magnus Egerstet Paolo Valigi Yorai Wari {boccaoro,valigi}@iei.unipg.it Dipartimento i Ingegneria Elettronica
More informationParameter estimation: A new approach to weighting a priori information
Parameter estimation: A new approach to weighting a priori information J.L. Mea Department of Mathematics, Boise State University, Boise, ID 83725-555 E-mail: jmea@boisestate.eu Abstract. We propose a
More informationA Course in Machine Learning
A Course in Machine Learning Hal Daumé III 12 EFFICIENT LEARNING So far, our focus has been on moels of learning an basic algorithms for those moels. We have not place much emphasis on how to learn quickly.
More informationGeneralizing Kronecker Graphs in order to Model Searchable Networks
Generalizing Kronecker Graphs in orer to Moel Searchable Networks Elizabeth Boine, Babak Hassibi, Aam Wierman California Institute of Technology Pasaena, CA 925 Email: {eaboine, hassibi, aamw}@caltecheu
More informationPower Generation and Distribution via Distributed Coordination Control
Power Generation an Distribution via Distribute Coorination Control Byeong-Yeon Kim, Kwang-Kyo Oh, an Hyo-Sung Ahn arxiv:407.4870v [math.oc] 8 Jul 204 Abstract This paper presents power coorination, power
More informationLecture Introduction. 2 Examples of Measure Concentration. 3 The Johnson-Lindenstrauss Lemma. CS-621 Theory Gems November 28, 2012
CS-6 Theory Gems November 8, 0 Lecture Lecturer: Alesaner Mąry Scribes: Alhussein Fawzi, Dorina Thanou Introuction Toay, we will briefly iscuss an important technique in probability theory measure concentration
More informationError Floors in LDPC Codes: Fast Simulation, Bounds and Hardware Emulation
Error Floors in LDPC Coes: Fast Simulation, Bouns an Harware Emulation Pamela Lee, Lara Dolecek, Zhengya Zhang, Venkat Anantharam, Borivoje Nikolic, an Martin J. Wainwright EECS Department University of
More informationMath 342 Partial Differential Equations «Viktor Grigoryan
Math 342 Partial Differential Equations «Viktor Grigoryan 6 Wave equation: solution In this lecture we will solve the wave equation on the entire real line x R. This correspons to a string of infinite
More informationLower Bounds for the Smoothed Number of Pareto optimal Solutions
Lower Bouns for the Smoothe Number of Pareto optimal Solutions Tobias Brunsch an Heiko Röglin Department of Computer Science, University of Bonn, Germany brunsch@cs.uni-bonn.e, heiko@roeglin.org Abstract.
More informationarxiv: v4 [math.pr] 27 Jul 2016
The Asymptotic Distribution of the Determinant of a Ranom Correlation Matrix arxiv:309768v4 mathpr] 7 Jul 06 AM Hanea a, & GF Nane b a Centre of xcellence for Biosecurity Risk Analysis, University of Melbourne,
More informationOptimal Control of Spatially Distributed Systems
Optimal Control of Spatially Distribute Systems Naer Motee an Ali Jababaie Abstract In this paper, we stuy the structural properties of optimal control of spatially istribute systems. Such systems consist
More informationHow to Minimize Maximum Regret in Repeated Decision-Making
How to Minimize Maximum Regret in Repeate Decision-Making Karl H. Schlag July 3 2003 Economics Department, European University Institute, Via ella Piazzuola 43, 033 Florence, Italy, Tel: 0039-0-4689, email:
More informationu!i = a T u = 0. Then S satisfies
Deterministic Conitions for Subspace Ientifiability from Incomplete Sampling Daniel L Pimentel-Alarcón, Nigel Boston, Robert D Nowak University of Wisconsin-Maison Abstract Consier an r-imensional subspace
More informationExponential Tracking Control of Nonlinear Systems with Actuator Nonlinearity
Preprints of the 9th Worl Congress The International Feeration of Automatic Control Cape Town, South Africa. August -9, Exponential Tracking Control of Nonlinear Systems with Actuator Nonlinearity Zhengqiang
More informationOptimal Control of Spatially Distributed Systems
Optimal Control of Spatially Distribute Systems Naer Motee an Ali Jababaie Abstract In this paper, we stuy the structural properties of optimal control of spatially istribute systems. Such systems consist
More informationRamsey numbers of some bipartite graphs versus complete graphs
Ramsey numbers of some bipartite graphs versus complete graphs Tao Jiang, Michael Salerno Miami University, Oxfor, OH 45056, USA Abstract. The Ramsey number r(h, K n ) is the smallest positive integer
More informationSwitching Time Optimization in Discretized Hybrid Dynamical Systems
Switching Time Optimization in Discretize Hybri Dynamical Systems Kathrin Flaßkamp, To Murphey, an Sina Ober-Blöbaum Abstract Switching time optimization (STO) arises in systems that have a finite set
More informationThis module is part of the. Memobust Handbook. on Methodology of Modern Business Statistics
This moule is part of the Memobust Hanbook on Methoology of Moern Business Statistics 26 March 2014 Metho: Balance Sampling for Multi-Way Stratification Contents General section... 3 1. Summary... 3 2.
More informationLecture 10: Logistic growth models #2
Lecture 1: Logistic growth moels #2 Fugo Takasu Dept. Information an Computer Sciences Nara Women s University takasu@ics.nara-wu.ac.jp 6 July 29 1 Analysis of the stochastic process of logistic growth
More informationLATTICE-BASED D-OPTIMUM DESIGN FOR FOURIER REGRESSION
The Annals of Statistics 1997, Vol. 25, No. 6, 2313 2327 LATTICE-BASED D-OPTIMUM DESIGN FOR FOURIER REGRESSION By Eva Riccomagno, 1 Rainer Schwabe 2 an Henry P. Wynn 1 University of Warwick, Technische
More information26.1 Metropolis method
CS880: Approximations Algorithms Scribe: Dave Anrzejewski Lecturer: Shuchi Chawla Topic: Metropolis metho, volume estimation Date: 4/26/07 The previous lecture iscusse they some of the key concepts of
More informationPerfect Matchings in Õ(n1.5 ) Time in Regular Bipartite Graphs
Perfect Matchings in Õ(n1.5 ) Time in Regular Bipartite Graphs Ashish Goel Michael Kapralov Sanjeev Khanna Abstract We consier the well-stuie problem of fining a perfect matching in -regular bipartite
More informationUnit #6 - Families of Functions, Taylor Polynomials, l Hopital s Rule
Unit # - Families of Functions, Taylor Polynomials, l Hopital s Rule Some problems an solutions selecte or aapte from Hughes-Hallett Calculus. Critical Points. Consier the function f) = 54 +. b) a) Fin
More informationOnline Appendix for Trade Policy under Monopolistic Competition with Firm Selection
Online Appenix for Trae Policy uner Monopolistic Competition with Firm Selection Kyle Bagwell Stanfor University an NBER Seung Hoon Lee Georgia Institute of Technology September 6, 2018 In this Online
More informationAn Analytical Expression of the Probability of Error for Relaying with Decode-and-forward
An Analytical Expression of the Probability of Error for Relaying with Decoe-an-forwar Alexanre Graell i Amat an Ingmar Lan Department of Electronics, Institut TELECOM-TELECOM Bretagne, Brest, France Email:
More informationEvolutionary Stability of Pure-Strategy Equilibria in Finite Games
GAMES AND ECONOMIC BEHAVIOR 2, 253265 997 ARTICLE NO GA970533 Evolutionary Stability of Pure-Strategy Equilibria in Finite Games E Somanathan* Emory Uniersity, Department of Economics, Atlanta, Georgia
More informationDiophantine Approximations: Examining the Farey Process and its Method on Producing Best Approximations
Diophantine Approximations: Examining the Farey Process an its Metho on Proucing Best Approximations Kelly Bowen Introuction When a person hears the phrase irrational number, one oes not think of anything
More informationKNN Particle Filters for Dynamic Hybrid Bayesian Networks
KNN Particle Filters for Dynamic Hybri Bayesian Networs H. D. Chen an K. C. Chang Dept. of Systems Engineering an Operations Research George Mason University MS 4A6, 4400 University Dr. Fairfax, VA 22030
More informationSlide10 Haykin Chapter 14: Neurodynamics (3rd Ed. Chapter 13)
Slie10 Haykin Chapter 14: Neuroynamics (3r E. Chapter 13) CPSC 636-600 Instructor: Yoonsuck Choe Spring 2012 Neural Networks with Temporal Behavior Inclusion of feeback gives temporal characteristics to
More informationIntroduction to the Vlasov-Poisson system
Introuction to the Vlasov-Poisson system Simone Calogero 1 The Vlasov equation Consier a particle with mass m > 0. Let x(t) R 3 enote the position of the particle at time t R an v(t) = ẋ(t) = x(t)/t its
More informationAdvanced Partial Differential Equations with Applications
MIT OpenCourseWare http://ocw.mit.eu 18.306 Avance Partial Differential Equations with Applications Fall 2009 For information about citing these materials or our Terms of Use, visit: http://ocw.mit.eu/terms.
More information1 Math 285 Homework Problem List for S2016
1 Math 85 Homework Problem List for S016 Note: solutions to Lawler Problems will appear after all of the Lecture Note Solutions. 1.1 Homework 1. Due Friay, April 8, 016 Look at from lecture note exercises:
More informationIterated Point-Line Configurations Grow Doubly-Exponentially
Iterate Point-Line Configurations Grow Doubly-Exponentially Joshua Cooper an Mark Walters July 9, 008 Abstract Begin with a set of four points in the real plane in general position. A to this collection
More informationCalculus in the AP Physics C Course The Derivative
Limits an Derivatives Calculus in the AP Physics C Course The Derivative In physics, the ieas of the rate change of a quantity (along with the slope of a tangent line) an the area uner a curve are essential.
More informationRobust Forward Algorithms via PAC-Bayes and Laplace Distributions. ω Q. Pr (y(ω x) < 0) = Pr A k
A Proof of Lemma 2 B Proof of Lemma 3 Proof: Since the support of LL istributions is R, two such istributions are equivalent absolutely continuous with respect to each other an the ivergence is well-efine
More informationSituation awareness of power system based on static voltage security region
The 6th International Conference on Renewable Power Generation (RPG) 19 20 October 2017 Situation awareness of power system base on static voltage security region Fei Xiao, Zi-Qing Jiang, Qian Ai, Ran
More informationNested Saturation with Guaranteed Real Poles 1
Neste Saturation with Guarantee Real Poles Eric N Johnson 2 an Suresh K Kannan 3 School of Aerospace Engineering Georgia Institute of Technology, Atlanta, GA 3332 Abstract The global stabilization of asymptotically
More informationDEGREE DISTRIBUTION OF SHORTEST PATH TREES AND BIAS OF NETWORK SAMPLING ALGORITHMS
DEGREE DISTRIBUTION OF SHORTEST PATH TREES AND BIAS OF NETWORK SAMPLING ALGORITHMS SHANKAR BHAMIDI 1, JESSE GOODMAN 2, REMCO VAN DER HOFSTAD 3, AND JÚLIA KOMJÁTHY3 Abstract. In this article, we explicitly
More informationLinear First-Order Equations
5 Linear First-Orer Equations Linear first-orer ifferential equations make up another important class of ifferential equations that commonly arise in applications an are relatively easy to solve (in theory)
More informationThermal conductivity of graded composites: Numerical simulations and an effective medium approximation
JOURNAL OF MATERIALS SCIENCE 34 (999)5497 5503 Thermal conuctivity of grae composites: Numerical simulations an an effective meium approximation P. M. HUI Department of Physics, The Chinese University
More informationLyapunov Functions. V. J. Venkataramanan and Xiaojun Lin. Center for Wireless Systems and Applications. School of Electrical and Computer Engineering,
On the Queue-Overflow Probability of Wireless Systems : A New Approach Combining Large Deviations with Lyapunov Functions V. J. Venkataramanan an Xiaojun Lin Center for Wireless Systems an Applications
More informationCalculus of Variations
16.323 Lecture 5 Calculus of Variations Calculus of Variations Most books cover this material well, but Kirk Chapter 4 oes a particularly nice job. x(t) x* x*+ αδx (1) x*- αδx (1) αδx (1) αδx (1) t f t
More information05 The Continuum Limit and the Wave Equation
Utah State University DigitalCommons@USU Founations of Wave Phenomena Physics, Department of 1-1-2004 05 The Continuum Limit an the Wave Equation Charles G. Torre Department of Physics, Utah State University,
More informationMATH 205 Practice Final Exam Name:
MATH 205 Practice Final Eam Name:. (2 points) Consier the function g() = e. (a) (5 points) Ientify the zeroes, vertical asymptotes, an long-term behavior on both sies of this function. Clearly label which
More informationThe chromatic number of graph powers
Combinatorics, Probability an Computing (19XX) 00, 000 000. c 19XX Cambrige University Press Printe in the Unite Kingom The chromatic number of graph powers N O G A A L O N 1 an B O J A N M O H A R 1 Department
More information7.1 Support Vector Machine
67577 Intro. to Machine Learning Fall semester, 006/7 Lecture 7: Support Vector Machines an Kernel Functions II Lecturer: Amnon Shashua Scribe: Amnon Shashua 7. Support Vector Machine We return now to
More informationAnalytic Scaling Formulas for Crossed Laser Acceleration in Vacuum
October 6, 4 ARDB Note Analytic Scaling Formulas for Crosse Laser Acceleration in Vacuum Robert J. Noble Stanfor Linear Accelerator Center, Stanfor University 575 San Hill Roa, Menlo Park, California 945
More informationDistributed coordination control for multi-robot networks using Lyapunov-like barrier functions
IEEE TRANSACTIONS ON 1 Distribute coorination control for multi-robot networks using Lyapunov-like barrier functions Dimitra Panagou, Dušan M. Stipanović an Petros G. Voulgaris Abstract This paper aresses
More informationFLUCTUATIONS IN THE NUMBER OF POINTS ON SMOOTH PLANE CURVES OVER FINITE FIELDS. 1. Introduction
FLUCTUATIONS IN THE NUMBER OF POINTS ON SMOOTH PLANE CURVES OVER FINITE FIELDS ALINA BUCUR, CHANTAL DAVID, BROOKE FEIGON, MATILDE LALÍN 1 Introuction In this note, we stuy the fluctuations in the number
More informationText S1: Simulation models and detailed method for early warning signal calculation
1 Text S1: Simulation moels an etaile metho for early warning signal calculation Steven J. Lae, Thilo Gross Max Planck Institute for the Physics of Complex Systems, Nöthnitzer Str. 38, 01187 Dresen, Germany
More informationPermanent vs. Determinant
Permanent vs. Determinant Frank Ban Introuction A major problem in theoretical computer science is the Permanent vs. Determinant problem. It asks: given an n by n matrix of ineterminates A = (a i,j ) an
More informationA new approach to explicit MPC using self-optimizing control
28 American Control Conference Westin Seattle Hotel, Seattle, Washington, USA June -3, 28 WeA3.2 A new approach to explicit MPC using self-optimizing control Henrik Manum, Sriharakumar Narasimhan an Sigur
More informationOptimal Decentralized Control of Coupled Subsystems With Control Sharing
IEEE TRANSACTIONS ON AUTOMATIC CONTROL, VOL. 58, NO. 9, SEPTEMBER 2013 2377 Optimal Decentralized Control of Coupled Subsystems With Control Sharing Aditya Mahajan, Member, IEEE Abstract Subsystems that
More informationGames and Economic Behavior
Games an Economic Behavior 80 013 39 67 Contents lists available at SciVerse ScienceDirect Games an Economic Behavior www.elsevier.com/locate/geb Fast convergence in evolutionary equilibrium selection
More informationSelf-normalized Martingale Tail Inequality
Online-to-Confience-Set Conversions an Application to Sparse Stochastic Banits A Self-normalize Martingale Tail Inequality The self-normalize martingale tail inequality that we present here is the scalar-value
More informationOn the Surprising Behavior of Distance Metrics in High Dimensional Space
On the Surprising Behavior of Distance Metrics in High Dimensional Space Charu C. Aggarwal, Alexaner Hinneburg 2, an Daniel A. Keim 2 IBM T. J. Watson Research Center Yortown Heights, NY 0598, USA. charu@watson.ibm.com
More informationCMSC 858F: Algorithmic Game Theory Fall 2010 BGP and Interdomain Routing
CMSC 858F: Algorithmic Game Theory Fall 2010 BGP an Interomain Routing Instructor: Mohamma T. Hajiaghayi Scribe: Yuk Hei Chan November 3, 2010 1 Overview In this lecture, we cover BGP (Borer Gateway Protocol)
More informationIPA Derivatives for Make-to-Stock Production-Inventory Systems With Backorders Under the (R,r) Policy
IPA Derivatives for Make-to-Stock Prouction-Inventory Systems With Backorers Uner the (Rr) Policy Yihong Fan a Benamin Melame b Yao Zhao c Yorai Wari Abstract This paper aresses Infinitesimal Perturbation
More informationRate of Convergence of Learning in Social Networks
Rate of Convergence of Learning in Social Networks Ilan Lobel, Daron Acemoglu, Munther Dahleh and Asuman Ozdaglar Massachusetts Institute of Technology Cambridge, MA Abstract We study the rate of convergence
More informationThroughput Optimal Control of Cooperative Relay Networks
hroughput Optimal Control of Cooperative Relay Networks Emun Yeh Dept. of Electrical Engineering Yale University New Haven, C 06520, USA E-mail: emun.yeh@yale.eu Ranall Berry Dept. of Electrical an Computer
More informationFORMATION INPUT-TO-STATE STABILITY. Herbert G. Tanner and George J. Pappas
Copyright 2002 IFAC 5th Triennial Worl Congress, Barcelona, Spain FORMATION INPUT-TO-STATE STABILITY Herbert G. Tanner an George J. Pappas Department of Electrical Engineering University of Pennsylvania
More informationNotes on Lie Groups, Lie algebras, and the Exponentiation Map Mitchell Faulk
Notes on Lie Groups, Lie algebras, an the Exponentiation Map Mitchell Faulk 1. Preliminaries. In these notes, we concern ourselves with special objects calle matrix Lie groups an their corresponing Lie
More informationA note on asymptotic formulae for one-dimensional network flow problems Carlos F. Daganzo and Karen R. Smilowitz
A note on asymptotic formulae for one-imensional network flow problems Carlos F. Daganzo an Karen R. Smilowitz (to appear in Annals of Operations Research) Abstract This note evelops asymptotic formulae
More information3.6. Let s write out the sample space for this random experiment:
STAT 5 3 Let s write out the sample space for this ranom experiment: S = {(, 2), (, 3), (, 4), (, 5), (2, 3), (2, 4), (2, 5), (3, 4), (3, 5), (4, 5)} This sample space assumes the orering of the balls
More informationA study on ant colony systems with fuzzy pheromone dispersion
A stuy on ant colony systems with fuzzy pheromone ispersion Louis Gacogne LIP6 104, Av. Kenney, 75016 Paris, France gacogne@lip6.fr Sanra Sanri IIIA/CSIC Campus UAB, 08193 Bellaterra, Spain sanri@iiia.csic.es
More informationLaplacian Cooperative Attitude Control of Multiple Rigid Bodies
Laplacian Cooperative Attitue Control of Multiple Rigi Boies Dimos V. Dimarogonas, Panagiotis Tsiotras an Kostas J. Kyriakopoulos Abstract Motivate by the fact that linear controllers can stabilize the
More informationHybrid Centralized-Distributed Resource Allocation for Device-to-Device Communication Underlaying Cellular Networks
Hybri Centralize-Distribute Resource Allocation for Device-to-Device Communication Unerlaying Cellular Networks 1 arxiv:1502.04539v1 [cs.gt] 16 Feb 2015 Setareh Maghsui an Sławomir Stańczak, Senior Member,
More informationLecture 6 : Dimensionality Reduction
CPS290: Algorithmic Founations of Data Science February 3, 207 Lecture 6 : Dimensionality Reuction Lecturer: Kamesh Munagala Scribe: Kamesh Munagala In this lecture, we will consier the roblem of maing
More informationConvergence rates of moment-sum-of-squares hierarchies for optimal control problems
Convergence rates of moment-sum-of-squares hierarchies for optimal control problems Milan Kora 1, Diier Henrion 2,3,4, Colin N. Jones 1 Draft of September 8, 2016 Abstract We stuy the convergence rate
More informationTIME-DELAY ESTIMATION USING FARROW-BASED FRACTIONAL-DELAY FIR FILTERS: FILTER APPROXIMATION VS. ESTIMATION ERRORS
TIME-DEAY ESTIMATION USING FARROW-BASED FRACTIONA-DEAY FIR FITERS: FITER APPROXIMATION VS. ESTIMATION ERRORS Mattias Olsson, Håkan Johansson, an Per öwenborg Div. of Electronic Systems, Dept. of Electrical
More informationLecture 6: Calculus. In Song Kim. September 7, 2011
Lecture 6: Calculus In Song Kim September 7, 20 Introuction to Differential Calculus In our previous lecture we came up with several ways to analyze functions. We saw previously that the slope of a linear
More informationVIRTUAL STRUCTURE BASED SPACECRAFT FORMATION CONTROL WITH FORMATION FEEDBACK
AIAA Guiance, Navigation, an Control Conference an Exhibit 5-8 August, Monterey, California AIAA -9 VIRTUAL STRUCTURE BASED SPACECRAT ORMATION CONTROL WITH ORMATION EEDBACK Wei Ren Ranal W. Bear Department
More informationConservation Laws. Chapter Conservation of Energy
20 Chapter 3 Conservation Laws In orer to check the physical consistency of the above set of equations governing Maxwell-Lorentz electroynamics [(2.10) an (2.12) or (1.65) an (1.68)], we examine the action
More information1. Aufgabenblatt zur Vorlesung Probability Theory
24.10.17 1. Aufgabenblatt zur Vorlesung By (Ω, A, P ) we always enote the unerlying probability space, unless state otherwise. 1. Let r > 0, an efine f(x) = 1 [0, [ (x) exp( r x), x R. a) Show that p f
More informationFinal Exam Study Guide and Practice Problems Solutions
Final Exam Stuy Guie an Practice Problems Solutions Note: These problems are just some of the types of problems that might appear on the exam. However, to fully prepare for the exam, in aition to making
More information