We play a two period game in which we choose a time t1 and then, after Yt1 has been revealed to us (or equivalently Xt1) we choose a second time t2. We seek to maximize a utility function U=cYt1+Yt2
A time coordinate is used merely to make the mathematical representation more familiar. It does not represent a temporal choice, necessarily, but rather an abstraction of a more general search space (such as a location to drill for oil, a choice of marketing strategy, or a technology product). The process Yt, unknown to us, represent the yet to be discovered variation in revenue as we move across the search space.
We seek to analyze how much exploration one should perform, versus sticking to what we know. Intuitively, if the initial point X(0)=b (or Y(0)=eb) is very high we might not want to risk any departure. Whereas if b is less than zero we're better off forgetting it altogether (that is, choosing t1→∞). In what follows, we sharpen this intuition.
Lemma A: The single period game.
Conditioned on X0=b the mean and variance of Xt are given by μ(t)=be−κtν(t)=σ22κ(1−e−2κt)
Region | λ∗t | Optimal t | logE[eXt] | Strategy |
b<0 | 0 | ∞ | 12 | "Reset" |
0<b<1 | b | −1κlog(b) | 12(b2+1) | "Explore" |
b>1 | 1 | 0 | b | "Stay" |
Thus the one period problem has utility ζ(b) where ζ(x)={e12x<0e12(x2+1)0≤x≤1exx>1
Lemma B: Optimizing over "outside" strategies.
For brevity we denote two period strategies by a decision function π(x;t,b) that returns the second time choice t2=π(X(t1);t,b) after X(t1) is revealed. A simple one parameter family of strategies, indexed by the choice t1, is given by t2=π(2)(x;t1,b)={−π(1)(b)x<bt1+π(1)(b)x>b
The evaluation of this strategy amounts to integration of the one period utility against the (gaussian) distribution of X(t1). For instance if 0<b<1. L(π(2))=cE[eXt1]+E[eXt2]=cE[eXt1]+P(Xt1<b)ζ(b)+P(Xt1>b)E[ζ(Xt1)|Xt1>b]
Lemma C: If inside strategies are never optimal in the symmetric case, they are never optimal.
For simplicity we'd like to assume what would seem to be the critical case, X(t1)=b. And we shall indeed show that irrespective of b we never want to choose t2∈(0,t1). Intuitively it should also be true that we never wish to choose an inside strategy in the asymmetric case either. To tidy up this dangling thread and establish some formulas we'll need, we set X(t1)=d. We may assume d<b without loss of generality (otherwise exchange the roles, remembering that we shall establish our coming result for all values of b ). Now suppose there is a point t2∈(0,t1). Using the unconditional means and variances used in the one period problem we apply Bayes Rule to find the conditional density on the Bridge: ρ(x;t2)∝e−12(x−be−κt2√1−e−2κt2)2e−12(xe−κ(t1−t2)−d√1−e−2κ(t1−t2))2=e−12(x−bλ2)21−λ22e−12(xλ−d)21−λ2=e−12(g2x2−2g1x+…)
Lemma D: The "outside" strategy is no worse than backtracking to the middle of the bridge
From the one period problem and the additive nature of the payoff we know that all other strategies with t2≥t1 or t2<0 are worse. So specializing the formula for the conditional mean and precision given above to the case d=b we write the conditional mean and variance as μc(t)=bλ21−λ22+bλ1−λ211−λ22+λ21−λ2=bλ2(1−λ2)+λ(1−λ22)1−λ22λ2=bλ2+λ1+λλ2νc(t)=(11−λ22+λ21−λ2)−2=(1−λ22)2(1−λ2)2(1−λ22λ2)2
Exhibit E: Pictures looking for proofs.
Returning to the symmetric case X(t1)=b we ask is there any value for t2 inside the interval (0,t1) that is a better choice that going outside the bridge (and using the optimal one period solution). To put it another way, is there any value for λ for which there is any choice of λ2 such that D(λ2,λ,b)=logξ(b)−ψ(b)<0
Lemma F: For b∈(0,1) the function S(u)=D(λ2=u,λ=u;b) satisfies S(u)≥0 for u∈(0,1) with a single zero at u=1−√1+bb
We consider the middle of the symmetric bridge once more, this time varying the width of the bridge. We claim that for b∈(0,1) there is a particular width bridge for which we are indifferent as to whether we choose the middle of the bridge (i.e. t2=12t1 or the optimal outside solution. Specializing to this case implies λ2=λ so we write S(u)=D(λ2=u,λ=u;b). From the formula for D given above we have S(u)=12(1+b2)−(b2u1+u2+12(1−u2)4(1−u4)2)=12(1+b2)−ρ(u;b)
Lemma G: For b>1 the function S(u)=D(λ2=u,λ=u;b) satisfies S(u)>0 for u∈(0,1). It approaches value zero as u→1, corresponding to the case of a very short bridge.
The limiting case is obvious algebraically and geometrically, since for b>1 we have S(u)=b−(b2u1+u2+12(1−u21+u2)2)→0
No comments:
Post a Comment