Real option valuation for reserve capacity

Similar documents
" $ CALCULUS 2 WORKSHEET #21. t, y = t + 1. are A) x = 0, y = 0 B) x = 0 only C) x = 1, y = 0 D) x = 1 only E) x= 0, y = 1

Convex Analysis and Economic Theory AY Elementary properties of convex functions

SUPPLEMENTARY MATERIAL TO IRONING WITHOUT CONTROL

GEOMETRY FINAL CLAY SHONKWILER

Static Problem Set 2 Solutions

Homework 3 Solutions(Part 2) Due Friday Sept. 8

Convex Functions and Optimization

Weak bidders prefer first-price (sealed-bid) auctions. (This holds both ex-ante, and once the bidders have learned their types)

SOLUTIONS TO ADDITIONAL EXERCISES FOR II.1 AND II.2

Convexity in R n. The following lemma will be needed in a while. Lemma 1 Let x E, u R n. If τ I(x, u), τ 0, define. f(x + τu) f(x). τ.

Minimizing a convex separable exponential function subject to linear equality constraint and bounded variables

CHAPTER 2: CONVEX SETS AND CONCAVE FUNCTIONS. W. Erwin Diewert January 31, 2008.

Upper Bounds for Stern s Diatomic Sequence and Related Sequences

Homework 4 Solutions, 2/2/7

Online Supplementary Appendix B

Chapter 2 Convex Analysis

Course 212: Academic Year Section 1: Metric Spaces

Proof. We indicate by α, β (finite or not) the end-points of I and call

Optimization and Optimal Control in Banach Spaces

Division of the Humanities and Social Sciences. Supergradients. KC Border Fall 2001 v ::15.45

2019 Spring MATH2060A Mathematical Analysis II 1

Summary Notes on Maximization

Continuity. Chapter 4

Concave and Convex Functions 1

Section 4.2: The Mean Value Theorem

1 Directional Derivatives and Differentiability

UNDERGROUND LECTURE NOTES 1: Optimality Conditions for Constrained Optimization Problems

Generalized Geometric Series, The Ratio Comparison Test and Raabe s Test

1. Introduction. 2. Outlines

EconS 301. Math Review. Math Concepts

L p Spaces and Convexity

f(x) f(z) c x z > 0 1

Concave and Convex Functions 1

1 Convexity explains SVMs

Test 3 Review. y f(a) = f (a)(x a) y = f (a)(x a) + f(a) L(x) = f (a)(x a) + f(a)

Homework 6. (x 3) 2 + (y 1) 2 = 25. (x 5) 2 + (y + 2) 2 = 49

8.7 Taylor s Inequality Math 2300 Section 005 Calculus II. f(x) = ln(1 + x) f(0) = 0

Sharp estimates of bounded solutions to some semilinear second order dissipative equations

Notes: 1. Regard as the maximal output error and as the corresponding maximal input error

Continuity. Chapter 4

MATH 215/255 Solutions to Additional Practice Problems April dy dt

November 13, 2018 MAT186 Week 8 Justin Ko

MA 137 Calculus 1 with Life Science Applications Monotonicity and Concavity (Section 5.2) Extrema, Inflection Points, and Graphing (Section 5.

Solutions to Exam 2, Math 10560

The optimal partial transport problem

C) 2 D) 4 E) 6. ? A) 0 B) 1 C) 1 D) The limit does not exist.

FinQuiz Notes

g 2 (x) (1/3)M 1 = (1/3)(2/3)M.

Math 541 Fall 2008 Connectivity Transition from Math 453/503 to Math 541 Ross E. Staffeldt-August 2008

MAXIMA AND MINIMA CHAPTER 7.1 INTRODUCTION 7.2 CONCEPT OF LOCAL MAXIMA AND LOCAL MINIMA

MTH 241: Business and Social Sciences Calculus

Math 117: Honours Calculus I Fall, 2002 List of Theorems. a n k b k. k. Theorem 2.1 (Convergent Bounded) A convergent sequence is bounded.

NOTES ON VECTOR-VALUED INTEGRATION MATH 581, SPRING 2017

Signed Measures. Chapter Basic Properties of Signed Measures. 4.2 Jordan and Hahn Decompositions

Introduction to Real Analysis Alternative Chapter 1

1.5 F15 O Brien. 1.5: Linear Equations and Inequalities

Consequences of Continuity and Differentiability

Iowa State University. Instructor: Alex Roitershtein Summer Homework #5. Solutions

Real Analysis Math 131AH Rudin, Chapter #1. Dominique Abdi

Chapter 2 Invertible Mappings

MATH 131P: PRACTICE FINAL SOLUTIONS DECEMBER 12, 2012

NAME: Mathematics 205A, Fall 2008, Final Examination. Answer Key

Induction, sequences, limits and continuity

Convex analysis and profit/cost/support functions

Expansion formula using properties of dot product (analogous to FOIL in algebra): u v 2 u v u v u u 2u v v v u 2 2u v v 2

Essential Maths 1. Macquarie University MAFC_Essential_Maths Page 1 of These notes were prepared by Anne Cooper and Catriona March.

BASICS OF CONVEX ANALYSIS

4 3A : Increasing and Decreasing Functions and the First Derivative. Increasing and Decreasing. then

Concavity and Lines. By Ng Tze Beng

CH 2: Limits and Derivatives

Division of the Humanities and Social Sciences. Sums of sets, etc.

When are Sums Closed?

1Number ONLINE PAGE PROOFS. systems: real and complex. 1.1 Kick off with CAS

September Math Course: First Order Derivative

ERASMUS UNIVERSITY ROTTERDAM

arxiv: v2 [math.ag] 24 Jun 2015

Design and Analysis of Algorithms Lecture Notes on Convex Optimization CS 6820, Fall Nov 2 Dec 2016

Systems of Equations and Inequalities. College Algebra

MTH4100 Calculus I. Bill Jackson School of Mathematical Sciences QMUL. Week 9, Semester 1, 2013

Calculus 221 worksheet

ROOT FINDING REVIEW MICHELLE FENG

Centre for Mathematics and Its Applications The Australian National University Canberra, ACT 0200 Australia. 1. Introduction

Near-Potential Games: Geometry and Dynamics

APPLICATIONS OF DIFFERENTIATION

#A50 INTEGERS 14 (2014) ON RATS SEQUENCES IN GENERAL BASES

4. We accept without proofs that the following functions are differentiable: (e x ) = e x, sin x = cos x, cos x = sin x, log (x) = 1 sin x

CONSTRAINT QUALIFICATIONS, LAGRANGIAN DUALITY & SADDLE POINT OPTIMALITY CONDITIONS

RED. Name: Math 290 Fall 2016 Sample Exam 3

Chaos and Dynamical Systems

Economics 204. The Transversality Theorem is a particularly convenient formulation of Sard s Theorem for our purposes: with r 1+max{0,n m}

A SET OF LECTURE NOTES ON CONVEX OPTIMIZATION WITH SOME APPLICATIONS TO PROBABILITY THEORY INCOMPLETE DRAFT. MAY 06

Minimizing Cubic and Homogeneous Polynomials over Integers in the Plane

Polynomial Degree and Finite Differences

Polynomial and Rational Functions. Chapter 3

Section 3.1 Extreme Values

Calculus and Maximization I

KEMATH1 Calculus for Chemistry and Biochemistry Students. Francis Joseph H. Campeña, De La Salle University Manila

Review Sheet 2 Solutions

Introductory Analysis I Fall 2014 Homework #9 Due: Wednesday, November 19

The Mean Value Theorem and the Extended Mean Value Theorem

Transcription:

Real option valuation for reserve capacity MORIARTY, JM; Palczewski, J doi:10.1016/j.ejor.2016.07.003 For additional information aout this pulication click this link. http://qmro.qmul.ac.uk/xmlui/handle/123456789/13838 Information aout this research oject was correct at the time of download; we occasionally make corrections to records, please therefore check the pulished record when citing. For more information contact scholarlycommunications@qmul.ac.uk

Supplementary materials for Real option valuation of reserve capacity y J. Moriarty and J. Palczewski 30 June 2016 Appendix A Plots of UK system prices Figure A.1 provides a histogram of the UK main system price, which is used in the imalance mechanism, etween 2nd June 2013 and 12th January 2016. The oxplot is displayed in Figure A.2. The data was otained from the ELEXON Portal. Figure A.1: Histogram of main UK system price, 2nd June 2013 to 12th January 2016. Appendix B Auxiliary results for smooth fit This appendix provides several results concerning the existence of points of smooth fit. Lemma B.1. Let h : [x, z] R for some x > 0 and z (x, ] satisfy h(x) = 0 and h (y) h(y)/y for y (x, z). Then h 0. 1

0 100 200 300 400 Figure A.2: Boxplot of main UK system price, 2nd June 2013 to 12th January 2016. Proof. Let g = h. Then g (y) g(y)/y and Gronwall s lemma yields g(y) g(x)e y x u 1du = 0. Lemma B.2. Let f e a continuously differentiale function on [0, A) for A (0, ]. Assume that f(y) = 0 for some 0 < y < A, lim y A f(y) > 0 and lim y A f (y) 0. Then there is a point z [y, A) such that f(z)/z = f (z) 0. Moreover, there is at most one such point on each interval of strict concavity of f (concavity is sufficient at the ends of the interval). Proof. Let y 1 < A e the largest root of f (its existence is guaranteed y lim y A f(y) > 0). Then y 1 > 0 and f(y) > 0 on (y 1, A). Define ξ(y) = f(y) f (y)y. Clearly, ξ(y 1 ) 0. If there is y 2 > y 1 such that ξ(y 2 ) > 0 then y continuity ξ must have a root z etween y 1 and y 2. Since f(z) 0 then f (z) 0. Assume, for a contradiction, that ξ(y) 0 on [y 1, A) and take any x (y 1, A). Let g e the solution to the ODE: g(y) g (y)y = 0 for y [x, A), g(x) = f(x), i.e., g(y) = yf(x)/x f(x). Let h = f g. By Lemma B.1, h 0, i.e., f g on [x, A). When A < then since lim y A f (y) 0 we have lim y A ξ(y) lim y A f(y) lim y A g(y) f(x) > 0, a contradiction. Otherwise A = and lim y h (y) f(x)/x < 0, which contradicts the positivity of h. Assume further that f is concave on [a, ] and strictly concave inside of this interval. Roots of ξ define tangents to f of the form x x f(y)/y. Due to concavity the function f is majorised y its tangents. Hence, if there are two roots y 1, y 2 of ξ then these tangents have to coincide. This is impossile due to strict concavity. Corollary B.3. Point z in the aove lemma can e chosen such that f is not strictly convex in its neighourhood. Proof. Assume that f is strictly convex on (l, r). This implies f(y 1 ) > f(y 2 )+ f (y 2 )(y 1 y 2 ) for any y 1, y 2 (l, r) and y 1 < y 2. Rearranging the terms yields ξ(y 2 ) = f(y 2 ) f (y 2 )y 2 < f(y 1 ) f (y 2 )y 1 < f(y 1 ) f (y 1 )y 1 = ξ(y 1 ), where we used the fact that f (y 1 ) < f (y 2 ) following from strict convexity. Hence, ξ is strictly decreasing on intervals of strict convexity of f. Similarly, 2

ξ is non-increasing on intervals of convexity of f and non-decreasing on the intervals of concavity of f. Let z e the point constructed in the proof of Lemma B.2. Assume that f is strictly convex in the neighourhood (l, r) of z. Then ξ(y) < 0 on (z, r]. This implies that there is a root of ξ on (r, A). Let ẑ e the root on (r, A) closest to r. Then ξ < 0 on (z, ẑ) and if f were strictly convex around ẑ then f would decrease to 0 at ẑ, a contradiction. This implies that f is not stricty convex around ẑ. Corollary B.4. Assume that f is continuously differentiale on [0, ) and strictly convex on (0, r). If f(0) = 0, lim y f(y) > 0 and lim y f (y) 0 then there exists z > 0 such that f(z)/z = f (z) 0. Proof. If there is y > 0 such that f(y) = 0 then the result follows from Lemma B.2. Otherwise, assume that f > 0 on (0, ). Define ξ(y) = f(y) f (y)y. Then ξ(0) = 0 and ξ is decreasing on the interval of strict convexity (0, r). Hence ξ(r) < 0. Arguments from the proof of Lemma B.2 imply that there is y 2 > r such that ξ(y 2 ) > 0. This comined with the continuity of ξ yields that there is a root z of ξ on (r, y 2 ). Recalling that f(z) > 0 we otain f (z) > 0. Lemma B.5. Assume that function f is continuously differentiale on [0, ), convex on [0, ȳ] and increasing on [ȳ, ) for some ȳ > 0 and that the following hold: f(0) = 0, lim f(y) > 0, y lim f (y) = 0. y Then there is a point y [ȳ, ) such that f(y)/y = f (y). Moreover, if f is strictly concave on (ȳ, ) then this point is unique. Proof. If there is y ȳ such that f(y) 0, then the result follows from Lemma B.2. Otherwise, f > 0 on [ȳ, ). Define ξ(y) = f(y) f (y)y. By convexity of f, f(0) f(ȳ)+f (ȳ)(0 ȳ). Hence, ξ(ȳ) 0. Existence of y such that ξ(y) > 0 completes the proof due to continuity of ξ. Assume, y contradiction, that ξ 0 on [ȳ, ). Let g e the solution to the ODE: g(y) g (y)y = 0, g(ȳ) = f(ȳ), i.e., g(y) = yf(ȳ)/ȳ. Let h = f g. By Lemma B.1, h 0, i.e., f g on [ȳ, ). But then lim y f (y) f(ȳ)/ȳ > 0, a contradiction. Uniqueness is proved identically as in Lemma B.2. Appendix C Single option: case-y-case analysis Notice that g(y ) = y ( p c + K c f(x ) ), hence its sign is determined y the relation etween p c + K c and f(x ). This will e useful in interpreting the conditions arising in the analysis elow. 3

Tale C.1: Stopping regions for the single option when < a. Whenever the stopping region is trivial we write V c = 0. p c D p c > D Stopping regions in the case < a. Parameter range Stopping region Figure C.2 K c + p c D V c = 0 K c + p c > D K c + p c f(x ) V c = 0 K c + p c > f(x ) ˆΓ = [min{ŷ, y }, y ] a K c + p c f(x ) ˆΓ = [y, ) d K c + p c > f(x ) Case A y Y c ˆΓ = [min(ŷ, y ), ) e y < Y c ˆΓ = [min(ŷ, y ), y ] [y (1), ) f & Fig. 2 Case A c ˆΓ = [y, ) d For the convenience of the reader we state the derivatives of g, ĝ and η: η (y) = 1 [ ) ] 2 y 1 2 p c D d (1 2 a 2 y 2a, g (y) = 1 [ ( 2 y 1 2 p c D d 1 ) ] y 2a, a ĝ (y) = 1 [ ( 2 y 1 2 K c + p c D d 1 ) ] y 2a, a (1 2 g (y) = 1 4 y 3 2 ĝ (y) = 1 4 y 3 2 [ D p c + d [ D K c p c + d a 2 ) ] y 2a, (1 2 a 2 ) ] y 2a. (C.1) A summary of the results for each case is collected in Tales C.1-C.3. Graphs showing the shape of the ostacle and related stopping regions are located in Figures C.1 and C.2 with links in the last column of the aforementioned tales for guidance. For futher clarity, the graphs in Figure C.1 display the smallest concave majorant of the ostacle in red and lue. The lue region, which is where the majorant coincides with the ostacle, defines the stopping region. C.1 Solutions in the case < a A summary of the results of this susection is presented in Tale C.1. C.1.1 Case p c D When K c + p c D: Each of Y m, Y c, Ŷm, Ŷc are equal to positive infinity, hence g and ĝ are decreasing on (0, ). Comining this with ĝ(0) = 0 makes H nonpositive and W zero everywhere, giving V c = 0. When K c + p c > D: ĝ is 0 at 0, then decreases and, if Ŷm < y, later increases, to meet g at y. Also g is decreasing everywhere as Y m =. Hence, g(y ) 0 4

Figure C.1: Illustrative plots for the single option ostacle and stopping region (thick horizontal line). The dashed vertical lines mark y. The least nonnegative concave majorant W is shown in lue (where W coincides with H) and red (otherwise). a) ) 5

Figure C.2: Illustrative plots for the single option ostacle and stopping region (thick horizontal line). The dashed vertical lines mark y. a) ) c) d) e) f) 6

makes H non-positive and W zero everywhere, giving V c = 0. When g(y ) > 0 we have V c 0, the stopping region ˆΓ has right endpoint y and exercise is profitale at y. We have ˆΓ = [min{y, ŷ }, y ] (see panel (a) in Figure C.1). Note that the smooth fit condition never holds at the right end of the stopping region, and holds at the left end only if ŷ < y. C.1.2 Case p c > D Both functions g and ĝ are convex close to 0 (decreasing then increasing) and then concave, increasing without ound, and so the majorant W is nonzero and V c 0. g(y ) 0: There exists y 0 y such that g is nonpositive on (0, y 0 ] and positive on (y 0, ). Since g(y) grows to infinity as y and lim y g (y) = 0, y Lemma B.2 in the Appendix there exists a point y y 0 such that the tangent to g at y crosses the origin, i.e., g (y ) = g(y )/y and g (y ) > 0 since g(y ) > 0. This point can e taken on the concave part of g (so that y Y c ) y Corollary B.3. Then it is unique y Lemma 2.2 and we conclude that ˆΓ = [y, ). When g(y ) > 0 let y := min(ŷ, y ). We distinguish etween the following two cases: Case A: g(y)/y ĝ(y )/y for all y > y and hence the majorant coincides with H at y (note that ĝ is concave at ŷ ) Case A C : there exists ỹ > y with g(ỹ)/ỹ > ĝ(y )/y and so the majorant does not coincide with H anywhere on [0, y ]. If the majorant touches H then it must do so to the right of y and then smooth fit holds. Lemma C.1. Case A C holds if and only if oth of the following conditions hold: 1. η has a root y > max(y, Y c ), 2. g (y ) > ĝ(y )/y. Proof. Suppose first that case A C holds. For condition 1, apply Lemma B.5 to the function g (1) (y) = g(y +y) g(y ) on [0, ) (taking ȳ = max(0, Y c y )) to estalish the existence of a smooth fit point ỹ (1). Let y (1) = ỹ (1) + y. Since we are in case A C, it is easy to see that the tangent to g at y (1) has a negative intercept at the vertical axis, i.e., η(y (1) ) < 0 and since η as y it follows that η has a root y in [y (1), ). Since the tangent at y must strictly dominate H on [0, y ], condition 2 follows. Conversely, if conditions 1 and 2 hold then the conclusion follows y the definition of η. Case A and y Y c : H is concave at every point in [y, ) (ecause ĝ is steeper at y than g and oth are concave there) so ˆΓ = [y, ). Case A and y < Y c : Then H is convex on (y, Y c ). The prolem decomposes into (i) finding the smallest non-negative concave majorant of ĝ on [0, y ] and (ii) finding the smallest non-negative concave majorant of the function g (1) (y) = g(y + y) g(y ) on [0, ). The majorant in (i) coincides with ĝ on [y, y ] and 7

Tale C.2: Stopping regions for the single option when > a. When the stopping region is trivial we simply write V c = 0. p c D p c < D Stopping regions in the case > a. Parameter range Stopping region Figure C.2 ŷ y ˆΓ = [ŷ, ) e ŷ > y ˆΓ = [max(y, y ), ) d K c + p c < D V c = 0 K c + p c f(x ) K c + p c D K c + p c > f(x ) Y m y or g(y m) 0 V c = 0 Y m > y and g(y m) > 0 ˆΓ = [y, Y m] c g (y ) > g(y )/y ˆΓ = [y, Y m] c g (y ) g(y )/y ˆΓ = [min(ŷ, y ), max(y m, y )] is linear on (0, y ). Since lim y g (1) (y) = and the derivative converges to 0 as y, there exists a unique point z such that g (1) and its smallest nonnegative concave majorant coincide exactly on [z, ) (apply Corollaries B.3 and B.4 in the Appendix and recall that Y c > y ). Note that z > 0 since g (1) is strictly convex on (0, Y c y ). Clearly, y (1) := y + z is a unique solution of g(y) g(y ) y y = g (y) > 0. We will show that the smallest nonnegative concave majorant of H is given y ĝ(y ) y y, y < y, ĝ(y), y y y, W (y) = g(y ) + g (y (1) )(y y ), y < y < y (1), g(y), y (1) < y. If y < y, then ĝ is concave on [y, y ] and lies elow the tangent at y. We infer the concavity of W at y from this and the fact that ĝ majorises H. When y = y the concavity at y follows from the condition A; concavity at other points is trivial. Finally, we conclude that ˆΓ = [y, y ] [y (1), ), see panel () in Figure C.1. The principle of smooth fit fails at y. Case A C : By Lemma C.1 y lies in (max(y, Y c ), ), a region in which H is equal to g, concave, and increasing. We conclude that Γ = [y, ). C.2 Solutions in the case > a A summary of the results of this susection is presented in Tale C.2. C.2.1 Case p c D In this case each of Y m, Y c, Ŷm, Ŷc are equal to positive infinity. Noting that ĝ (y ) > g (y ), H is concave and increasing without ound so that V c 0. The tangency points ŷ and y are uniquely defined. Then ˆΓ = [A, ) where A = ŷ if ŷ y and A = max(y, y ) otherwise. Note that there is no smooth fit at A when y y ŷ. 8

C.2.2 Case p c < D When K c + p c D: Ŷ c, Ym ˆ are equal to + while Y c, Y m lie in (0, ) so that ĝ is increasing and concave, making H concave on (0, max(y, Y c )) and oth convex and decreasing on (max(y, Y c ), ). Notice that if Y m y then the stopping region ˆΓ has an empty intersection with (y, ) and the value function W is constant on [y, ). If ĝ(y ) = g(y ) 0 then the prolem reduces to finding a non-negative concave majorant of g. In this case, if Y m y or g(y m ) 0 then V c = 0. Otherwise, V c > 0 and there exists a unique solution y of η(y) = 0 on (y, Y m ) such that g (y ) > 0 (uniqueness follows from Lemma 2.2, existence is easy). The stopping region has the form ˆΓ = [y, Y m ]. If ĝ(y ) = g(y ) > 0 and g (y ) > g(y )/y then Y m > y. Since η(y) = 2(g(y) g (y)y) we have η(y ) < 0 and η(y m ) > 0, so y the continuity and monotonicity of η(recall that Y c > Y m ) there exists a unique solution y of η(y) = 0 on (y, Y m ), and we have g (y ) > 0. It follows also that the tangent at y goes through 0 (has a null vertical intercept). By concavity of H on (0, y ) it majorises H there. Hence, the stopping region is ˆΓ = [y, Y m ]. Alternatively, suppose that oth g(y ) > 0 and g (y ) g(y )/y. Then since ĝ (y ) > g (y ), the prolem decomposes into (i) finding the smallest non-negative concave majorant of ĝ on [0, y ] and (ii) finding the smallest non-negative concave majorant of the function g (1) (y) = g(y + y) g(y ) on [0, ). The majorant in (i) coincides with ĝ on [min(ŷ, y ), y ], whereas the majorant in (ii) coincides with g (1) on [0, max(y m y, 0)]. The overall stopping region and majorant are then recovered y adjoining these parts, so that ˆΓ = [min(ŷ, y ), max(y m, y )]. Notice that when ŷ > y there is no smooth fit at the left end of the interval ˆΓ. K c + p c < D: we have ĝ < 0 on (0, ) and g < ĝ on (y, ), so that H 0 and V c = 0. C.3 Solutions in the case = a A summary of the results of this susection is presented in Tale C.3. Although there does not seem to e any economic rationale ehind this order case, the analysis simplifies: g(y) = (p c D) y + K c y d, g (y) = 1 2 y 1 2 (pc D), g (y) = 1 4 y 3 2 (D pc ), ĝ(y) = (K c + p c D) y d, (C.2) ĝ (y) = 1 2 y 1 2 (Kc + p c D), ĝ (y) = 1 4 y 3 2 (D Kc p c ). 9

Tale C.3: Stopping regions for the single option when a =. Whenever the stopping region is trivial we write V c = 0. p c > D p c = D Stopping regions in the case = a. Parameter range Stopping region Figure C.2 y y ˆΓ = [y, ) d ŷ < y ˆΓ = [ŷ, ) e y < y, ŷ y ˆΓ = [y, ) K c y d > 0 ˆΓ = [min(ŷ, y ), ) e K c y d 0 V c = 0 p c < D Kc + pc f(x ) V c = 0 K c + p c > f(x ) ˆΓ = [min{ŷ, y }, y ] a C.3.1 Case p c > D Here g, ĝ and hence also H are strictly concave and increasing without ound so V c 0 and the stopping region ˆΓ will e of the form [A, ). We have ( ) d Kc y 2 ( ) 2 d y = 4, ŷ = 4. p c D K c + p c D If y y then A = y and smooth fit holds; otherwise, if ŷ < y then A = ŷ and smooth fit holds. If oth y < y and ŷ y then smooth fit does not hold and A = y. C.3.2 Case p c = D The function g is constant and ĝ is increasing and concave. Hence V c 0 precisely when K c y d > 0, in which case ˆΓ = [A, ) with A = min(ŷ, y ). C.3.3 Case p c < D In this case g is strictly convex and strictly decreasing and also ĝ(0) < 0, so V c 0 if and only if g(y ) > 0. In this case the stopping region is ˆΓ = [min{ŷ, y }, y ]. 10