T.R | Title | User | Personal Name | Date | Lines |
---|
1656.1 | t is discrete time | EPIK::FINNERTY | Sell high, buy low | Fri Aug 28 1992 16:36 | 3 |
|
btw, t is a non-negative integer. /jim
|
1656.2 | Lots of Irritating Silly Parenthesis | TAV02::NITSAN | One side will make you larger | Sat Aug 29 1992 05:25 | 13 |
| V(t) = ((1-R) * V(t-1)) + (R * V(t-1) * (o(t)*y1 - (1-o(t))*y2)) =
= V(t-1) * [ (1-R) + R * V(t-1) * (o(t)*y1 - (1-o(t))*y2) ] =
= V(t-1) + V(t-1) * R * [ -1 + o(t)*y1 - (1-o(t))*y2 ] =
= V(t-1) + V(t-1) * R * f(t)
/ -1 + y1 (probability p)
f(t) = <
\ -1 - y2 (probability 1-p)
It *seems* that if y1 is "big enough" we want R=1, else we want R=0.
Is there a possibility for any other R as a solution?
/Nitsan
|
1656.3 | No known closed-form solution | VMSDEV::HALLYB | Fish have no concept of fire. | Sat Aug 29 1992 11:31 | 5 |
| This looks like the "optimal f" problem from _Portfolio Management
Formulas_, by Ralph Vince. ISBN 0-471-52756-4, 1-800-CALLWILEY, $50.
Well worth it.
John
|
1656.4 | | VIZUAL::FINNERTY | Sell high, buy low | Tue Sep 08 1992 10:47 | 13 |
|
re: .2
line 2 contained an extra V(t-1)
re: .0
viewed as a decision tree, this became pretty straightforward. I
can post some results if anyone is interested. I suspect that .3
has the complete analysis.
/Jim
|