<?xml version='1.0' encoding='UTF-8'?><?xml-stylesheet href="http://www.blogger.com/styles/atom.css" type="text/css"?><feed xmlns='http://www.w3.org/2005/Atom' xmlns:openSearch='http://a9.com/-/spec/opensearchrss/1.0/' xmlns:blogger='http://schemas.google.com/blogger/2008' xmlns:georss='http://www.georss.org/georss' xmlns:gd="http://schemas.google.com/g/2005" xmlns:thr='http://purl.org/syndication/thread/1.0'><id>tag:blogger.com,1999:blog-5264419489096142546</id><updated>2024-10-06T21:48:06.550-07:00</updated><category term="short notes"/><category term="interview"/><category term="interest rate"/><category term="snack for thought"/><category term="volatility"/><category term="credit"/><category term="stochastic calculus"/><category term="coin tossing"/><category term="naive-ness can kill"/><category term="Vanilla"/><category term="Book Review"/><category term="wishlist"/><category term="C++"/><category term="Bookmark"/><category term="statistics"/><category term="trading"/><category term="numerical methods"/><category term="Just for fun"/><category term="card flipping"/><category term="dice rolling"/><category term="Agent Based Model"/><category term="Algorithms"/><category term="F#"/><category term="FX"/><title type='text'>It&#39;s All Greek to Me</title><subtitle type='html'>Quant Finance, Brainteasers, and Other Useful Things</subtitle><link rel='http://schemas.google.com/g/2005#feed' type='application/atom+xml' href='http://iagtm.blogspot.com/feeds/posts/default'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/5264419489096142546/posts/default?redirect=false'/><link rel='alternate' type='text/html' href='http://iagtm.blogspot.com/'/><link rel='hub' href='http://pubsubhubbub.appspot.com/'/><link rel='next' type='application/atom+xml' href='http://www.blogger.com/feeds/5264419489096142546/posts/default?start-index=26&amp;max-results=25&amp;redirect=false'/><author><name>ΣHΦ</name><uri>http://www.blogger.com/profile/08883576142863481302</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='16' height='16' src='https://img1.blogblog.com/img/b16-rounded.gif'/></author><generator version='7.00' uri='http://www.blogger.com'>Blogger</generator><openSearch:totalResults>121</openSearch:totalResults><openSearch:startIndex>1</openSearch:startIndex><openSearch:itemsPerPage>25</openSearch:itemsPerPage><entry><id>tag:blogger.com,1999:blog-5264419489096142546.post-6982717476819108954</id><published>2016-02-23T08:38:00.002-08:00</published><updated>2016-02-23T08:38:34.794-08:00</updated><category scheme="http://www.blogger.com/atom/ns#" term="Book Review"/><title type='text'>Book Review: Rock Breaks Scissors by Poundstone</title><content type='html'>&amp;nbsp;&lt;a href=&quot;http://www.amazon.com/Rock-Breaks-Scissors-Outguessing-Outwitting/dp/1491531185&quot; target=&quot;_blank&quot;&gt;http://www.amazon.com/Rock-Breaks-Scissors-Outguessing-Outwitting/dp/1491531185&lt;/a&gt;&lt;br /&gt;
&lt;br /&gt;
This is the third book I have read recently that is about forecasting (see &lt;a href=&quot;http://iagtm.blogspot.hk/2015/03/book-review-signal-and-noise-by-nate.html&quot; target=&quot;_blank&quot;&gt;here&lt;/a&gt; and &lt;a href=&quot;http://iagtm.blogspot.hk/2016/02/book-review-superforecasting-by-tetlock.html&quot; target=&quot;_blank&quot;&gt;here&lt;/a&gt; for the previous two).&lt;br /&gt;
&lt;br /&gt;
Poundstone did a pretty good job overall. The first chapter of the book is a general discussion on the human psychology of perceiving randomness. The following one half gives specific examples of how to outperform in various more light-hearted and trivial prediction exercises (e.g. multiple choice tests, rock-paper-scissors, passwords etc.), and the remaining one half does the same thing but with more serious topics (e.g. sports betting, web big data, stock market etc.).&lt;br /&gt;
&lt;br /&gt;
Once again I&#39;ll try to distill the essence of the book here:&lt;br /&gt;
&lt;ol&gt;
&lt;li&gt;The human mind is handicapped in creating and detecting randomness&lt;/li&gt;
&lt;li&gt;We can take advantage of the above in many situations for a statistically significant gain&lt;/li&gt;
&lt;li&gt;In situations where randomness rules, the real pros do not care so much about &lt;b&gt;&lt;u&gt;views&lt;/u&gt;&lt;/b&gt;; they care more about &lt;u&gt;&lt;b&gt;odds&lt;/b&gt;&lt;/u&gt;&lt;/li&gt;
&lt;/ol&gt;
</content><link rel='replies' type='application/atom+xml' href='http://iagtm.blogspot.com/feeds/6982717476819108954/comments/default' title='Post Comments'/><link rel='replies' type='text/html' href='http://iagtm.blogspot.com/2016/02/book-review-rock-breaks-scissors-by.html#comment-form' title='0 Comments'/><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/5264419489096142546/posts/default/6982717476819108954'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/5264419489096142546/posts/default/6982717476819108954'/><link rel='alternate' type='text/html' href='http://iagtm.blogspot.com/2016/02/book-review-rock-breaks-scissors-by.html' title='Book Review: Rock Breaks Scissors by Poundstone'/><author><name>ΣHΦ</name><uri>http://www.blogger.com/profile/08883576142863481302</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='16' height='16' src='https://img1.blogblog.com/img/b16-rounded.gif'/></author><thr:total>0</thr:total></entry><entry><id>tag:blogger.com,1999:blog-5264419489096142546.post-7963993078926936877</id><published>2016-02-07T01:25:00.002-08:00</published><updated>2016-02-07T01:25:27.627-08:00</updated><category scheme="http://www.blogger.com/atom/ns#" term="Book Review"/><title type='text'>Book Review:  Superforecasting by Tetlock and Gardner</title><content type='html'>The theme of this book is very similar to &lt;a href=&quot;http://iagtm.blogspot.hk/2015/03/book-review-signal-and-noise-by-nate.html&quot; target=&quot;_blank&quot;&gt;Nate Silver&#39;s The Signal and the Noise&lt;/a&gt;. The first few chapters are worth reading, while as it drags on the final one-third of the book is less appealing, as it indulges in corny talks of team works etc.. The new ideas I got from this book, in addition to those already listed in the review above, include:&lt;br /&gt;
&lt;ol&gt;
&lt;li&gt;The use of &lt;a href=&quot;https://en.wikipedia.org/wiki/Brier_score&quot; target=&quot;_blank&quot;&gt;Brier score&lt;/a&gt; for rating forecast, because &#39;good&#39; forecast should be in probabilistic terms&lt;/li&gt;
&lt;li&gt;As a corollary, one has to make enough forecasts in order to have a statistically significant score (=/= good score)&lt;/li&gt;
&lt;li&gt;Update predictions as frequently as appropriate&lt;/li&gt;
&lt;li&gt;There is a vicious cycle going on in the &#39;Mainstream&#39; of our society: people are not aware of the importance/option to think probabilistic -&amp;gt; they crave for binary, determined answers -&amp;gt; the media are aware of this demand -&amp;gt; the media cultivate the guru/pundit culture -&amp;gt; the people get more addicted to this way of thinking&lt;/li&gt;
&lt;/ol&gt;
&amp;nbsp;All in all, it is not as readable a book as Silver&#39;s, but I would still recommend it to anyone who is serious about improving and understanding the art of forecasting.</content><link rel='replies' type='application/atom+xml' href='http://iagtm.blogspot.com/feeds/7963993078926936877/comments/default' title='Post Comments'/><link rel='replies' type='text/html' href='http://iagtm.blogspot.com/2016/02/book-review-superforecasting-by-tetlock.html#comment-form' title='0 Comments'/><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/5264419489096142546/posts/default/7963993078926936877'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/5264419489096142546/posts/default/7963993078926936877'/><link rel='alternate' type='text/html' href='http://iagtm.blogspot.com/2016/02/book-review-superforecasting-by-tetlock.html' title='Book Review:  Superforecasting by Tetlock and Gardner'/><author><name>ΣHΦ</name><uri>http://www.blogger.com/profile/08883576142863481302</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='16' height='16' src='https://img1.blogblog.com/img/b16-rounded.gif'/></author><thr:total>0</thr:total></entry><entry><id>tag:blogger.com,1999:blog-5264419489096142546.post-1848070473886058164</id><published>2015-03-19T05:37:00.002-07:00</published><updated>2015-03-19T05:37:16.650-07:00</updated><category scheme="http://www.blogger.com/atom/ns#" term="Book Review"/><title type='text'>Book Review: The Signal and the Noise by Nate Silver</title><content type='html'>An anecdotal account without much technical materials, nonetheless an enjoyable read. Through the case studies (weather forecast, earthquake prediction, economic forecast, sports betting, poker, etc.) the readers are gradually introduced to what quantitative prediction is/should be.&lt;br /&gt;
&lt;br /&gt;
If I am to distill three most important points made in the book, they would be&lt;br /&gt;
&lt;ol&gt;
&lt;li&gt;Think probability; or even better, think &lt;b&gt;&lt;u&gt;CONDITIONAL&lt;/u&gt;&lt;/b&gt; probability, aka Bayesian.&lt;/li&gt;
&lt;li&gt;Giving your prediction a context, or &quot;having a story,&quot; would result in forecasts that are much better than blindly dive into datamining.&lt;/li&gt;
&lt;li&gt;The evaluation of the performance of predictions should not be based (solely) on whether they got it right. Maintaining best practices is more important.&lt;/li&gt;
&lt;/ol&gt;
There may not be much originality in the materials, but the writing is decent and there are valuable lessons to take home. Recommended especially for people who work with quantitative data manipulation.&lt;br /&gt;
&lt;br /&gt;
</content><link rel='replies' type='application/atom+xml' href='http://iagtm.blogspot.com/feeds/1848070473886058164/comments/default' title='Post Comments'/><link rel='replies' type='text/html' href='http://iagtm.blogspot.com/2015/03/book-review-signal-and-noise-by-nate.html#comment-form' title='0 Comments'/><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/5264419489096142546/posts/default/1848070473886058164'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/5264419489096142546/posts/default/1848070473886058164'/><link rel='alternate' type='text/html' href='http://iagtm.blogspot.com/2015/03/book-review-signal-and-noise-by-nate.html' title='Book Review: The Signal and the Noise by Nate Silver'/><author><name>ΣHΦ</name><uri>http://www.blogger.com/profile/08883576142863481302</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='16' height='16' src='https://img1.blogblog.com/img/b16-rounded.gif'/></author><thr:total>0</thr:total></entry><entry><id>tag:blogger.com,1999:blog-5264419489096142546.post-653630656895951673</id><published>2014-07-01T01:58:00.001-07:00</published><updated>2014-07-01T01:58:24.717-07:00</updated><category scheme="http://www.blogger.com/atom/ns#" term="Agent Based Model"/><category scheme="http://www.blogger.com/atom/ns#" term="short notes"/><title type='text'>Minority Game, Majority Game, $ Game etc.</title><content type='html'>Minority game (and other extensions) is the formalized study of the &lt;a href=&quot;http://en.wikipedia.org/wiki/El_Farol_Bar_problem&quot;&gt;El Farol Bar problem&lt;/a&gt;. It was proposed by various researchers that the dynamics under such games resembles the financial market. This is a list (with some sparse comments) of literature that are related to this topic:&lt;br /&gt;
&lt;br /&gt;
&lt;b&gt;Martino et al&lt;/b&gt;, 2003, &quot;&lt;i&gt;Statistical mechanics of the mixed majority-minority game with random external information&lt;/i&gt;&quot;&lt;br /&gt;
&lt;br /&gt;
&lt;b&gt;Namatame and Sato&lt;/b&gt;, &quot;&lt;i&gt;Localized minority games and emergence of efficient dynamic order&lt;/i&gt;&quot;&lt;br /&gt;
&lt;br /&gt;
&lt;b&gt;Satinover and Sornette&lt;/b&gt;, 2007, &quot;&lt;i&gt;&#39;Illusion of control&#39; in time-horizon minority and Parrondo games&lt;/i&gt;&quot;&lt;br /&gt;
&lt;br /&gt;
&lt;b&gt;Wiesinger et al&lt;/b&gt;, 2010, &quot;&lt;i&gt;Reverse engineering financial markets with majority and minority games using Genetic Algorithms&lt;/i&gt;&quot;&lt;br /&gt;
&lt;br /&gt;
&lt;b&gt;Cherkashin et al,&lt;/b&gt; 2009, &quot;&lt;i&gt;The reality game&lt;/i&gt;&quot;&lt;br /&gt;
This framework is particularly interesting because it allows for feedback. The size of the bets placed by the players would change the odds of winning.&lt;br /&gt;
&lt;br /&gt;
&lt;b&gt;Vitting Andersen and Sornette&lt;/b&gt;, 2002, &quot;&lt;i&gt;The $-game&lt;/i&gt;&quot;&lt;br /&gt;
They introduce the $-Game, and explain why it (instead of the Minority Game) is a better model for the financial market.&lt;br /&gt;
&lt;br /&gt;
&lt;b&gt;Yeung et al&lt;/b&gt;, 2008, &quot;&lt;i&gt;Models of financial markets with extensive participation incentives&lt;/i&gt;&quot;&lt;br /&gt;
They introduce the Wealth Game, and define the temperature of the grand canonical ensemble. More interestingly, they connect this theoretical framework to the real market by calibrating the model to market data, thus identifying where we are on the &quot;phase diagram.&quot;&lt;br /&gt;
&lt;br /&gt;
&lt;b&gt;De Martino et al&lt;/b&gt;, &quot;&lt;i&gt;From perceived risk to collective behavior in minority games&lt;/i&gt;&quot;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;</content><link rel='replies' type='application/atom+xml' href='http://iagtm.blogspot.com/feeds/653630656895951673/comments/default' title='Post Comments'/><link rel='replies' type='text/html' href='http://iagtm.blogspot.com/2014/07/minority-game-majority-game-game-etc.html#comment-form' title='0 Comments'/><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/5264419489096142546/posts/default/653630656895951673'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/5264419489096142546/posts/default/653630656895951673'/><link rel='alternate' type='text/html' href='http://iagtm.blogspot.com/2014/07/minority-game-majority-game-game-etc.html' title='Minority Game, Majority Game, $ Game etc.'/><author><name>ΣHΦ</name><uri>http://www.blogger.com/profile/08883576142863481302</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='16' height='16' src='https://img1.blogblog.com/img/b16-rounded.gif'/></author><thr:total>0</thr:total></entry><entry><id>tag:blogger.com,1999:blog-5264419489096142546.post-6245654146099647399</id><published>2014-06-30T17:46:00.001-07:00</published><updated>2014-06-30T17:46:26.944-07:00</updated><category scheme="http://www.blogger.com/atom/ns#" term="short notes"/><category scheme="http://www.blogger.com/atom/ns#" term="snack for thought"/><category scheme="http://www.blogger.com/atom/ns#" term="volatility"/><title type='text'>Volatility Smile and Volatility Models: A Short Note</title><content type='html'>&lt;u&gt;&lt;b&gt;Local Volatility (LV) Model&lt;/b&gt;&lt;/u&gt;&lt;br /&gt;
&lt;ol&gt;
&lt;li&gt;LV preserves market completeness (is it a good/must-have thing?)&lt;/li&gt;
&lt;li&gt;LV gives forward smiles that are too flat compared to market&lt;/li&gt;
&lt;li&gt;In fact, LV doesn&#39;t really qualify as a model: it fits implied vol perfectly but trivially, with no capability/intention to consider the underlying dynamics&lt;/li&gt;
&lt;li&gt;LV also produces poor smile dynamics prediction&lt;/li&gt;
&lt;/ol&gt;
&amp;nbsp;&lt;u&gt;&lt;b&gt;More General Notes&lt;/b&gt;&lt;/u&gt;&lt;br /&gt;
&lt;ol&gt;
&lt;li&gt;The most sought-after quality for a model should be accurate hedging, not mathematical tractability etc.&lt;/li&gt;
&lt;li&gt;In fact, there is no good reason to limit ourselves to vanillas only when calibrating a vol model; calibrating only to vanillas has been common practice, which is unfortunate &lt;/li&gt;
&lt;li&gt;The information carried by vanillas is the unconditional (risk-neutral) probabilities that can be recovered by taking second derivatives w.r.t. strikes (i.e. the stock price is here at t=0, what is the probability that it will end up there at t=T?)&lt;/li&gt;
&lt;li&gt;Conditional probabilities, on the other hand, is not contained in vanillas (i.e. conditional on the stock price being here at t=s&lt;t at=&quot;&quot; end=&quot;&quot; is=&quot;&quot; it=&quot;&quot; probability=&quot;&quot; t=&quot;T?)&amp;lt;/li&quot; that=&quot;&quot; the=&quot;&quot; there=&quot;&quot; up=&quot;&quot; what=&quot;&quot; will=&quot;&quot;&gt;
&lt;li&gt;Another way of saying this is that vanillas are not sensitive to unconditional distributions&lt;/li&gt;
&lt;li&gt;Therefore, one way to proceed is to include some exotics in the calibration: forward starting options are sensitive to conditional probabilities; while American digitals (or barriers) are sensitive to jumps&lt;/li&gt;
&lt;li&gt;As a rule of thumb, jumps are &quot;responsible&quot; for short-dated smile, and stochastic volatility is &quot;responsible&quot; for longer-dated smile &lt;/li&gt;
&lt;/t&gt;&lt;/li&gt;
&lt;/ol&gt;
&lt;br /&gt;
Reference:&lt;br /&gt;
Ayache 2004, &lt;a href=&quot;http://citeseerx.ist.psu.edu/viewdoc/download;jsessionid=1C7B598469F273B529AD16DC8779BAB2?doi=10.1.1.232.7835&amp;amp;rep=rep1&amp;amp;type=pdf&quot;&gt;Can anyone solve the smile problem?&lt;/a&gt;&lt;br /&gt;
Ayache 2005, &lt;a href=&quot;http://www.ito33.com/sites/default/files/articles/0501_ayache.pdf&quot;&gt;Can anyone solve the smile problem? A Post-Scriptum&lt;/a&gt;&lt;br /&gt;
&lt;br /&gt;
Also, Rebonato&#39;s &lt;a href=&quot;http://www.amazon.com/Volatility-Correlation-The-Perfect-Hedger/dp/0470091398&quot;&gt;Volatility and Correlation: The Perfect Hedger and the Fox&lt;/a&gt; is relevant, and it&#39;s a great read, but that would be another episode.</content><link rel='replies' type='application/atom+xml' href='http://iagtm.blogspot.com/feeds/6245654146099647399/comments/default' title='Post Comments'/><link rel='replies' type='text/html' href='http://iagtm.blogspot.com/2014/06/volatility-smile-and-volatility-models.html#comment-form' title='0 Comments'/><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/5264419489096142546/posts/default/6245654146099647399'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/5264419489096142546/posts/default/6245654146099647399'/><link rel='alternate' type='text/html' href='http://iagtm.blogspot.com/2014/06/volatility-smile-and-volatility-models.html' title='Volatility Smile and Volatility Models: A Short Note'/><author><name>ΣHΦ</name><uri>http://www.blogger.com/profile/08883576142863481302</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='16' height='16' src='https://img1.blogblog.com/img/b16-rounded.gif'/></author><thr:total>0</thr:total></entry><entry><id>tag:blogger.com,1999:blog-5264419489096142546.post-345297864736366224</id><published>2014-03-01T04:55:00.002-08:00</published><updated>2014-03-01T05:07:44.200-08:00</updated><category scheme="http://www.blogger.com/atom/ns#" term="snack for thought"/><title type='text'>How do you model the dynamics of asset prices? A self-reflection (Epilogue of 3)</title><content type='html'>As the title suggests, this was supposed to be a &lt;a href=&quot;http://iagtm.blogspot.hk/2013/11/how-do-you-model-dynamics-of-asset.html&quot; target=&quot;_blank&quot;&gt;three &lt;/a&gt;&lt;a href=&quot;http://iagtm.blogspot.hk/2013/11/how-do-you-model-dynamics-of-asset_23.html&quot; target=&quot;_blank&quot;&gt;part &lt;/a&gt;&lt;a href=&quot;http://iagtm.blogspot.hk/2014/01/how-do-you-model-dynamics-of-asset.html&quot; target=&quot;_blank&quot;&gt;series&lt;/a&gt;.
 But I feel like I have left out so much that I wanted to discuss, so 
although the first 3 parts have already provided an overview on what I 
would call the &quot;classical&quot; quant modeling approach (loosely speaking, 
one that focuses on describing the asset price time series with a random
 process), I would take this opportunity to talk about what lies beyond 
such approach.&lt;br /&gt;
&lt;br /&gt;
We are interested particularly in capturing the &lt;i&gt;tails&lt;/i&gt; of the distribution. What about putting the tail on the center stage? That is the spirit of &lt;a href=&quot;http://en.wikipedia.org/wiki/Extreme_value_theory&quot; target=&quot;_blank&quot;&gt;extreme value theory&lt;/a&gt;.
 It has had wide application in natural disaster forecast. The basic 
idea is to posit a probability distribution that specifically fits the 
tail of the distribution. Contrast this with, say, the stochastic 
volatility approach in which we tried to fatten the tail, while still 
keeping our focus on the &#39;body&#39; of the return distribution. Now we are 
directly and un-apologetically modeling the tail itself. The advantage 
is obvious: we have more freedom in fitting the tails closely by 
dedicating the calibration to it. The short coming is more subtle. In 
order to perform extreme value analysis, we have to specify the 
threshold at where the tail starts, so that we can attach a distribution
 to it. If you define daily return of&amp;nbsp; -20% as the threshold, then you 
can use some distribution to catch the sub-sample of daily return less than -20%. But how do you choose the threshold? Choose it too deep into 
the body and you miss the point of using extreme value models. After 
all, we are trying to focus on the tail by not worrying about modeling 
the boring part of the distribution. On the other hand, choose it too 
far off into the tail and you suffer by not having enough historical 
data points for an accurate calibration. The other issue is that extreme
 value analysis would not solve the &quot;you don&#39;t know what you don&#39;t know&quot;
 problem. You pick a threshold, you do the fitting, and chances are 
sooner or later a much worse draw down would take you by surprise, 
proving to you that the tail is even fatter that you have assumed.&lt;br /&gt;
&lt;br /&gt;
Now you might say, &quot;Hey, isn&#39;t that a necessary evil of any perceivable 
model in finance? That one has to make assumptions and wait to be 
surprised?&quot; And I tend to agree to the sad fact. Perhaps except for if 
we follow a completely different paradigm. Recently some researchers 
having been looking at crash forecasting using a wide range of 
unconventional tools. They range from fractal analysis that studies the 
(change in) scaling of time series; agent-based models that take a 
bottom-up approach trying to produce asset price dynamics by considering
 (grossly simplified) behaviors of traders; and critical point/phase 
change models that are inspired by Ising model in solid state physics. 
The common theme is the acknowledgement of market non-linearity and the 
lack of a single, forever stable market state. Unfortunately there is no
 straight forward way to connect these models to option prices, but with
 the advancements of numerical methods we may some day see wider 
applications of them.</content><link rel='replies' type='application/atom+xml' href='http://iagtm.blogspot.com/feeds/345297864736366224/comments/default' title='Post Comments'/><link rel='replies' type='text/html' href='http://iagtm.blogspot.com/2014/03/how-do-you-model-dynamics-of-asset.html#comment-form' title='1 Comments'/><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/5264419489096142546/posts/default/345297864736366224'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/5264419489096142546/posts/default/345297864736366224'/><link rel='alternate' type='text/html' href='http://iagtm.blogspot.com/2014/03/how-do-you-model-dynamics-of-asset.html' title='How do you model the dynamics of asset prices? A self-reflection (Epilogue of 3)'/><author><name>ΣHΦ</name><uri>http://www.blogger.com/profile/08883576142863481302</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='16' height='16' src='https://img1.blogblog.com/img/b16-rounded.gif'/></author><thr:total>1</thr:total></entry><entry><id>tag:blogger.com,1999:blog-5264419489096142546.post-3747236044932767806</id><published>2014-02-28T20:27:00.002-08:00</published><updated>2014-02-28T20:30:57.320-08:00</updated><category scheme="http://www.blogger.com/atom/ns#" term="interview"/><category scheme="http://www.blogger.com/atom/ns#" term="short notes"/><title type='text'>Looping the Strings Problem</title><content type='html'>This one is a classic that I believe is found in one of the popular interview books. You start with &lt;i&gt;N&lt;/i&gt; pieces of strings that are mixed into a single pile. You start randomly choosing two free ends at a time and joining them together. After &lt;i&gt;N&lt;/i&gt; rounds, you will be done as there will be no more free ends left. If the number of closed loops is &lt;i&gt;k&lt;/i&gt;, what is &lt;i&gt;F = &lt;/i&gt;E[&lt;i&gt;k&lt;/i&gt;]?&lt;br /&gt;
&lt;br /&gt;
If you go down the combinatorial path, you will soon see how hopeless it is to try figuring out the many different intermediate states. So perhaps combinatorial is not the right tool here. In fact, this problem can be readily solved with a closed-form solution using induction and recurrence. Before arriving at that, let&#39;s get some sense and inspiration by stating with a small &lt;i&gt;N&lt;/i&gt;.&lt;br /&gt;
&lt;br /&gt;
&lt;i&gt;N = 1&lt;/i&gt; is trivial and we see that &lt;i&gt;k = 1&lt;/i&gt; surely, so &lt;i&gt;F = 1&lt;/i&gt;. Consider &lt;i&gt;N = 2&lt;/i&gt;. During the first round of joining, when one free end is picked, it can be joined to any of the remaining 3 free ends. In one out of these three cases, we end up with &lt;i&gt;k&lt;/i&gt; = &lt;i&gt;2&lt;/i&gt; (namely, if the free end is joined to another end of itself); while in the remaining two cases, we end up with &lt;i&gt;k = 1&lt;/i&gt; (namely, if the free end is joined to any end of the other string). So $ F_2 = \frac 1 3 (1+F_1) + \frac 2 3 (F_1)=\frac 4 3 $. More generally, it&#39;s easy to show that $ F_N = \frac 1 {2N-1} (1+F_{N-1}) + \frac {2N-2} {2N-1} (F_{N-1})$&lt;br /&gt;
&lt;br /&gt;
This recurring relation can be rearranged to give the difference equation $ F_N = F_{N-1} + \frac 1 {2N-1} $. With the initial condition of $ F_1 = 1$, we can alternatively express it as a finite sum. Note how slow it grows with &lt;i&gt;N&lt;/i&gt; (~ log(&lt;i&gt;N&lt;/i&gt;)).</content><link rel='replies' type='application/atom+xml' href='http://iagtm.blogspot.com/feeds/3747236044932767806/comments/default' title='Post Comments'/><link rel='replies' type='text/html' href='http://iagtm.blogspot.com/2014/02/looping-strings-problem.html#comment-form' title='0 Comments'/><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/5264419489096142546/posts/default/3747236044932767806'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/5264419489096142546/posts/default/3747236044932767806'/><link rel='alternate' type='text/html' href='http://iagtm.blogspot.com/2014/02/looping-strings-problem.html' title='Looping the Strings Problem'/><author><name>ΣHΦ</name><uri>http://www.blogger.com/profile/08883576142863481302</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='16' height='16' src='https://img1.blogblog.com/img/b16-rounded.gif'/></author><thr:total>0</thr:total></entry><entry><id>tag:blogger.com,1999:blog-5264419489096142546.post-3092720917458488615</id><published>2014-01-30T01:18:00.000-08:00</published><updated>2014-01-30T01:24:06.212-08:00</updated><category scheme="http://www.blogger.com/atom/ns#" term="snack for thought"/><title type='text'>How do you model the dynamics of asset prices? A self-reflection (3 of 3)</title><content type='html'>&lt;a href=&quot;http://iagtm.blogspot.hk/2013/11/how-do-you-model-dynamics-of-asset_23.html&quot; target=&quot;_blank&quot;&gt;Last time&lt;/a&gt; we added jumps to the recipe to enrich the original random walk dynamics. Jump diffusion model is able to fit to market implied vol much better than the diffusion only counterpart. Before moving on, just two reminders:&lt;br /&gt;
&lt;ol&gt;
&lt;li&gt;The numerical pricing procedure becomes more involved, especially for grid/finite differencing methods (because we end up with an integro-differential equation, as opposed to a PDE)&lt;/li&gt;
&lt;li&gt;Although we usually speak of &quot;the&quot; jump diffusion model, we are free in specifying the probability distribution of the jump amplitude&lt;/li&gt;
&lt;/ol&gt;
&lt;b&gt;&lt;u&gt;How about good old Gaussian?&lt;/u&gt;&lt;/b&gt;&lt;br /&gt;
So is jump diffusion the ultimate holy grail? And is pure diffusion model done with? For the first question, we will see later in the series that there are many other approaches that supersede jump diffusion, but for now let&#39;s take a step back and address the second question.&lt;br /&gt;
&lt;br /&gt;
It turns out that the use of &lt;a href=&quot;http://en.wikipedia.org/wiki/Mixture_distribution&quot; target=&quot;_blank&quot;&gt;mixtures&lt;/a&gt; is able to tackle at least some of the shortcomings of the original random walk model. A mixture, not surprisingly, is formed by combining more than one &#39;sub-distributions.&#39; (usually, but not necessarily, of the same kind) Here we focus on Gaussian mixture. There are a number of possibilities regarding how the sub-distributions are combined, the use of Markov chain being a prominent one. Essentially, every time we need a new random variable to be generated, we first toss a coin to determine which sub-distribution out of the mixture to draw from. In the case of a mixture of two Gaussians, if one sub-distribution has a larger variance than the other, then the mixture would have fatter tail, although the individual sub-distributions do not.&lt;br /&gt;
&lt;br /&gt;
&amp;nbsp; &amp;nbsp; &amp;nbsp;&amp;nbsp; &lt;b&gt;Candidate: Mixture&lt;/b&gt;&lt;br /&gt;
&lt;ul&gt;
&lt;li&gt;Markovian&lt;/li&gt;
&lt;li&gt;Most likely not tractable&lt;/li&gt;
&lt;li&gt;Excess kurtosis&lt;/li&gt;
&lt;li&gt;Market incomplete&lt;/li&gt;
&lt;/ul&gt;
The use of mixture models in option pricing is rare, possibly because not everyone likes the idea of the hidden Markov chain that comes with the same package. Justifying and interpreting it is easier in the context of econometric modeling that deals with longer time frames, in which case the state changes can be perceived as a change in &lt;i&gt;regimes&lt;/i&gt;. For something like intra-day option pricing, the model may require that we draw from alternate sub-distributions every 5 minutes or so, and it&#39;s not trivial to make sense of what that means. (other than the fact that it fits the data well)&lt;br /&gt;
&lt;br /&gt;
&lt;b&gt;&lt;u&gt;Another French Mathematician&lt;/u&gt;&lt;/b&gt;&lt;br /&gt;
If producing a fatter tail is all we care about, then what about substituting Gaussian process with something with excess kurtosis? The resulting model would likely not have analytic solution, but we can fall back on numerical methods as our last resort. For example, ask the computer to generate 10000 random numbers from a Student&#39;s t distribution and use those in a Monte Carlo simulation.&lt;br /&gt;
&lt;br /&gt;
The idea sounds neat, but one has to be cautious about it. We may not be aware of it, but when we were modeling asset prices with Gaussian or Poisson processes, both of the processes are closed under linear transformation. In other words, aggregating multiple Gaussian (or Poisson) random variables would result in yet another Gaussian (or Poisson) variable. That means when we use Gaussian process to model asset prices, even though it may not be a very faithful description of reality, at least we are being consistent and we know what we are getting ourselves into: namely, if the one-day distribution is an &lt;i&gt;N(0.01, 0.05)&lt;/i&gt;, then the one-month distribution would be an &lt;i&gt;N(0.25,0.25), &lt;/i&gt;etc. Other distributions in general do not have this property. If in our hypothetical Monte Carlo simulation we draw from a t distribution with a degree of freedom of 10 for daily return, how would the monthly return be distributed? How about quarterly?&lt;br /&gt;
&lt;br /&gt;
These problems can be avoided by going for non-Gaussian processes while staying within the territory of &lt;a href=&quot;http://en.wikipedia.org/wiki/L%C3%A9vy_process&quot; target=&quot;_blank&quot;&gt;Levy processes&lt;/a&gt;, which is a broad family of processes that possess the nice property of being closed under linear transformation. (obviously both Gaussian and Poisson processes are members of this family)&lt;br /&gt;
&lt;br /&gt;</content><link rel='replies' type='application/atom+xml' href='http://iagtm.blogspot.com/feeds/3092720917458488615/comments/default' title='Post Comments'/><link rel='replies' type='text/html' href='http://iagtm.blogspot.com/2014/01/how-do-you-model-dynamics-of-asset.html#comment-form' title='0 Comments'/><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/5264419489096142546/posts/default/3092720917458488615'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/5264419489096142546/posts/default/3092720917458488615'/><link rel='alternate' type='text/html' href='http://iagtm.blogspot.com/2014/01/how-do-you-model-dynamics-of-asset.html' title='How do you model the dynamics of asset prices? A self-reflection (3 of 3)'/><author><name>ΣHΦ</name><uri>http://www.blogger.com/profile/08883576142863481302</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='16' height='16' src='https://img1.blogblog.com/img/b16-rounded.gif'/></author><thr:total>0</thr:total></entry><entry><id>tag:blogger.com,1999:blog-5264419489096142546.post-6357078265855166471</id><published>2014-01-28T06:38:00.000-08:00</published><updated>2014-02-04T05:58:13.145-08:00</updated><category scheme="http://www.blogger.com/atom/ns#" term="interview"/><title type='text'>Other Interview Questions</title><content type='html'>Q: It&#39;s 12:00 now. What time would it be when the minute hand crosses the hour hand again?&lt;br /&gt;
A: Between 1200 and 2400, this will happen for 11 times. So divide 12 hr by 11 and add to 1200, i.e. &lt;span style=&quot;color: red;&quot;&gt;13:05:27&lt;/span&gt;&lt;br /&gt;
&lt;br /&gt;
Q: A cell can do 4 things: 1) Dies; 2) Nothing; 3) Duplicate; or 4) Triplicate. What is P(colony dies out) if we start with one single cell?&lt;br /&gt;
A: Solve the polynomial&lt;br /&gt;
&lt;span style=&quot;color: red;&quot;&gt;$ p = \frac {1} {4} + &lt;/span&gt;&lt;span style=&quot;color: red;&quot;&gt;&lt;span style=&quot;color: red;&quot;&gt;\frac {1}{4}&lt;/span&gt; p + &lt;/span&gt;&lt;span style=&quot;color: red;&quot;&gt;&lt;span style=&quot;color: red;&quot;&gt;\frac {1}{4} &lt;/span&gt;p^2 + &lt;/span&gt;&lt;span style=&quot;color: red;&quot;&gt;&lt;span style=&quot;color: red;&quot;&gt;\frac {1}{4} &lt;/span&gt;p^3$&lt;/span&gt;&lt;br /&gt;
&lt;br /&gt;
Q: A 6x6 matrix has entries of either +1 or -1. How many unique combinations are there such that all column products and row products are +1?&lt;br /&gt;
A: Consider the top left 5x5 sub-matrix. It can take any permutation (as long as each row/column contains no more than 3 same number) because we can rely on the rest of the 6x6 matrix (an &quot;L&quot; shape) to &quot;fix&quot; it. So the answer is &lt;span style=&quot;color: red;&quot;&gt;$ 2^{25} $&lt;/span&gt;&lt;br /&gt;
&lt;br /&gt;
Q: There is an integer &lt;i&gt;X&lt;/i&gt;. The product of the digits is 96. What is the largest/smallest possible value of &lt;i&gt;X&lt;/i&gt;?&lt;br /&gt;
A: &lt;span style=&quot;color: red;&quot;&gt;smallest = 268, largest = 322222&lt;/span&gt;&lt;br /&gt;
&lt;br /&gt;
Q: What is the sum of all &lt;b&gt;digits&lt;/b&gt; of all the numbers between 1 and 1000000?&lt;br /&gt;
A: Convince yourself that all digits appear for an equal number of times. The answer is &lt;span style=&quot;color: red;&quot;&gt;27000001&lt;/span&gt;&lt;br /&gt;
&lt;br /&gt;
Q: A bus makes a stop, and 3/4 of all passengers get off, while 7 get on. This repeats for two more times. What is the smallest number of initial passengers?&lt;br /&gt;
A: &lt;span style=&quot;color: red;&quot;&gt;52&lt;/span&gt;&lt;br /&gt;
&lt;br /&gt;
Q: Paint the outside of a cube, then dice it into 27 equal smaller cubes. Pick one at random and roll it. What is P(no paint visible after the roll)?&lt;br /&gt;
A: &lt;span style=&quot;color: red;&quot;&gt;$ 6/27 \times 1/6 + 1/27 $&lt;/span&gt;&lt;br /&gt;
&lt;br /&gt;
Q: Two equally talented teams are playing a series of games in which the first team to win 4 games wins the series. What is P(7th game has to be played)?&lt;br /&gt;
A:&lt;span style=&quot;color: red;&quot;&gt; $ \frac {6!}{3!3!} \frac {1}{2^6} = \frac {5}{16}$&lt;/span&gt;&lt;br /&gt;
&lt;br /&gt;
Q: I roll a die, spin a roulette and draw a card from a deck of 52. What is the probability that all three give the same number?&lt;br /&gt;
A: &lt;span style=&quot;color: red;&quot;&gt;$ 5 \times \frac 1 6 \times \frac 1 {13} \times 1 {38} $&lt;/span&gt;&lt;br /&gt;
&lt;br /&gt;
Q: What is the last digit of 3 to the power 33?&lt;br /&gt;
A: &lt;span style=&quot;color: red;&quot;&gt;&lt;span style=&quot;color: black;&quot;&gt;Some experimentation would indicate that $3^0=1$,&amp;nbsp;&lt;/span&gt;&lt;/span&gt;&lt;span style=&quot;color: red;&quot;&gt;&lt;span style=&quot;color: black;&quot;&gt; $3^1=3$, $&lt;/span&gt;&lt;/span&gt;&lt;span style=&quot;color: red;&quot;&gt;&lt;span style=&quot;color: black;&quot;&gt;&lt;code&gt;&lt;/code&gt;3^2=9$,&amp;nbsp;&lt;/span&gt;&lt;/span&gt;&lt;span style=&quot;color: red;&quot;&gt;&lt;span style=&quot;color: black;&quot;&gt; $3^3=27$, $3^4=81$, ..., hence&lt;/span&gt; $3^33&amp;nbsp; &lt;code&gt;&lt;/code&gt;mod&amp;nbsp; &lt;code&gt;&lt;/code&gt;10 = 3$&lt;/span&gt;&lt;br /&gt;
&lt;br /&gt;
Q: &lt;i&gt;N&lt;/i&gt; couples shake hand with others. It is known that 1) They don&#39;t shake hand with their own partners; and 2) The first (2&lt;i&gt;N&lt;/i&gt; - 1) people surveyed all have different number of handshakes. What is the number of handshake the remaining person made?&lt;br /&gt;
A:&lt;span style=&quot;color: red;&quot;&gt; &lt;i&gt;N&lt;/i&gt; - 1&lt;/span&gt; (Can draw graphs to deduce; any analytic solution?)&lt;br /&gt;
&lt;br /&gt;
Q: What is P(3 random points on a circle are within an 180 degree arc)?&lt;br /&gt;
A: There are two approaches: 1) Area on an abstract &lt;i&gt;&lt;u&gt;x-y&lt;/u&gt;&lt;/i&gt; plane, &lt;i&gt;x&lt;/i&gt; and &lt;i&gt;y&lt;/i&gt; are distances from the first point pinned down (call it &lt;i&gt;z&lt;/i&gt;, which is arbitrary); or 2) $ N \times \frac {1}{2^{N-1}} $, with $ N=3$. Both give the answer of &lt;span style=&quot;color: red;&quot;&gt;3/4&lt;/span&gt;.&lt;br /&gt;
&lt;br /&gt;
Q: How do you simulate a 6-sided die using a fair coin? What&#39;s the expected number of toss to produce the number?&lt;br /&gt;
A: Use a binary scheme. With 3 tosses, there are 8 possible outcomes, which is more than enough to simulate 6 sides. The trick is to know which 2 to exclude. {HHH,TTT} would be a bad choice because you always have to wait until the 3rd toss to know if you failed. So we should choose something like {HHH,HHT} or {THH,THT}. The expected number of toss is given by solving&lt;br /&gt;
&lt;span style=&quot;color: red;&quot;&gt;$E[N]=\frac 6 8 \times 3 + \frac 2 8 (2+E[N])$&lt;/span&gt;&lt;br /&gt;
&lt;br /&gt;
Q: Place 3 points randomly on the perimeter of a square. What is P(they don&#39;t form a triangle) and P(all lie on different edges)?&lt;br /&gt;
A: &lt;span style=&quot;color: red;&quot;&gt;$P(they_&lt;/span&gt;&lt;span style=&quot;color: red;&quot;&gt;don&#39;t&lt;code&gt;_&lt;/code&gt;&lt;/span&gt;&lt;span style=&quot;color: red;&quot;&gt;&lt;code&gt;&lt;/code&gt;form&lt;code&gt;_&lt;/code&gt;&lt;/span&gt;&lt;span style=&quot;color: red;&quot;&gt;&lt;code&gt;&lt;/code&gt;&lt;/span&gt;&lt;span style=&quot;color: red;&quot;&gt;a_&lt;/span&gt;&lt;span style=&quot;color: red;&quot;&gt;triangle) = 4/{4^3} = 1/16$; $P(all_&lt;/span&gt;&lt;span style=&quot;color: red;&quot;&gt;lie_&lt;/span&gt;&lt;span style=&quot;color: red;&quot;&gt;on_&lt;/span&gt;&lt;span style=&quot;color: red;&quot;&gt;different_&lt;/span&gt;&lt;span style=&quot;color: red;&quot;&gt;edges) =\frac {4 \times _3P_3}{4^3} = 3/8$&lt;/span&gt;&lt;br /&gt;
&lt;br /&gt;
Q: 10 light bulbs are lined up in a row, and it is known that no two of the adjacent light bulbs can be both on. What is the possible number of arrangements?&lt;br /&gt;
A: Fibonacci sequence, &lt;span style=&quot;color: red;&quot;&gt;144&lt;/span&gt;&lt;br /&gt;
&lt;br /&gt;
Q: You have a large number of red and blue balls (equally many) in a large container. What is P(odd number of red) if you draw a) 3 balls from the container? b) 10 balls from the container?&lt;br /&gt;
A: &lt;span style=&quot;color: red;&quot;&gt;0.5&lt;/span&gt; regardless of how many you draw. For example if 3 are drawn, the binomial distribution is 1(odd) 3(even) 3(odd) 1(even); if 4 are drawn, the binomial distribution is 1(even) 4(odd) 6(even) 4(odd) 1(even).&lt;br /&gt;
&lt;br /&gt;
Q: Transport as many apples as possible to a destination 1000 km away starting with 3000 apples. For each km of transportation, you lose 1 apple.&lt;br /&gt;
A:&amp;nbsp; The best tactic is to always start with full load so as to maximize number of &quot;apple km&quot; traveled per apple lost. So the 1st stop is optimally at 3000 - 3X = 2000 &amp;lt;=&amp;gt; X = 333; the 2nd stop is optimally at 2000 - 2X = 1000 &amp;lt;=&amp;gt; X = 500. After 833 km, we are left with 1000 apples. Hence we will have &lt;span style=&quot;color: red;&quot;&gt;833 &lt;/span&gt;apples at the destination.&lt;br /&gt;
&lt;br /&gt;
Q: You are playing against two players A and B individually in a tournament, with A being the better player. If you have to win at least 2 &lt;b&gt;consecutive&lt;/b&gt; games out of 3 in order to be the champion, would you prefer the order ABA or BAB?&lt;br /&gt;
A: Out of the 8 outcomes {LLL,LLW,LWL,LWW,WLL,WLW,WWL,WWW}, only {WWW,WWL,LWW} are desirable. If q = P(winning against A) and p = P(winning against B) so that p &amp;gt; q,&lt;br /&gt;
P(champion with the order ABA) = pqp + pq(1-p) + (1-p)qp = 2pq - ppq&lt;br /&gt;
P(champion with the order BAB) = qpq + qp(1-q) + (1-q)pq = 2pq - pqq&lt;br /&gt;
So&amp;nbsp; &lt;span style=&quot;color: red;&quot;&gt;P(champion with the order BAB) &amp;gt; P(champion with the order ABA)&lt;/span&gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;</content><link rel='replies' type='application/atom+xml' href='http://iagtm.blogspot.com/feeds/6357078265855166471/comments/default' title='Post Comments'/><link rel='replies' type='text/html' href='http://iagtm.blogspot.com/2014/01/other-interview-questions.html#comment-form' title='2 Comments'/><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/5264419489096142546/posts/default/6357078265855166471'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/5264419489096142546/posts/default/6357078265855166471'/><link rel='alternate' type='text/html' href='http://iagtm.blogspot.com/2014/01/other-interview-questions.html' title='Other Interview Questions'/><author><name>ΣHΦ</name><uri>http://www.blogger.com/profile/08883576142863481302</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='16' height='16' src='https://img1.blogblog.com/img/b16-rounded.gif'/></author><thr:total>2</thr:total></entry><entry><id>tag:blogger.com,1999:blog-5264419489096142546.post-7079572206437016423</id><published>2014-01-17T07:54:00.001-08:00</published><updated>2014-01-28T07:16:56.095-08:00</updated><category scheme="http://www.blogger.com/atom/ns#" term="short notes"/><title type='text'>Short Notes on HMM (Hidden Markov Model)</title><content type='html'>&lt;div class=&quot;de1&quot;&gt;
&lt;u&gt;&lt;b&gt;1. Regarding calibration&lt;/b&gt;&lt;/u&gt;&lt;/div&gt;
&lt;div class=&quot;de2&quot;&gt;
Numerical optimization is computatinoal intensive and 
prone to local max, but it is able to estimate any general model 
specification. On the other hand, EM algorithms such as Baum-Welch are 
more reliable in seeking global max, but they are only capable of 
backing out the parameters of models with distributions that are fully 
described by moments (Gaussian, Poisson, ...)&lt;/div&gt;
&lt;div class=&quot;de1&quot;&gt;
&lt;/div&gt;
&lt;div class=&quot;de2&quot;&gt;
&lt;u&gt;&lt;b&gt;2. Problem with HMM, and extensions&lt;/b&gt;&lt;/u&gt;&lt;/div&gt;
&lt;div class=&quot;de1&quot;&gt;
As Soltan discusses in his paper, ordinary HMM is by 
definition prone to instability due to the exponentiated matrix 
structure. The instability dominates in the long run, meaning that state
 occupancy duration estimation of ordinary HMM is usually unreliable. 
There are two ways to go: 1) HSMM (a.k.a. explicit duration HMM, inhomogeneous HMM, etc.), or 2) 
Treat duration as an extra degree of state space (see Soltan).&lt;/div&gt;
&lt;div class=&quot;de2&quot;&gt;
&lt;/div&gt;
&lt;div class=&quot;de1&quot;&gt;
References:&lt;/div&gt;
&lt;div class=&quot;de2&quot;&gt;
&lt;a href=&quot;http://www.reza-soltan.com/papers/3.pdf&quot;&gt;http://www.reza-soltan.com/papers/3.pdf&lt;/a&gt;&lt;/div&gt;
&lt;div class=&quot;de1&quot;&gt;
&lt;a href=&quot;http://sist.sysu.edu.cn/~syu/HSMM_bibliography.htm&quot;&gt;http://sist.sysu.edu.cn/~syu/HSMM_bibliography.htm&lt;/a&gt;&lt;/div&gt;
</content><link rel='replies' type='application/atom+xml' href='http://iagtm.blogspot.com/feeds/7079572206437016423/comments/default' title='Post Comments'/><link rel='replies' type='text/html' href='http://iagtm.blogspot.com/2014/01/short-notes-on-hmm.html#comment-form' title='0 Comments'/><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/5264419489096142546/posts/default/7079572206437016423'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/5264419489096142546/posts/default/7079572206437016423'/><link rel='alternate' type='text/html' href='http://iagtm.blogspot.com/2014/01/short-notes-on-hmm.html' title='Short Notes on HMM (Hidden Markov Model)'/><author><name>ΣHΦ</name><uri>http://www.blogger.com/profile/08883576142863481302</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='16' height='16' src='https://img1.blogblog.com/img/b16-rounded.gif'/></author><thr:total>0</thr:total></entry><entry><id>tag:blogger.com,1999:blog-5264419489096142546.post-354877541512650052</id><published>2013-12-13T07:48:00.000-08:00</published><updated>2013-12-13T07:50:28.786-08:00</updated><category scheme="http://www.blogger.com/atom/ns#" term="naive-ness can kill"/><category scheme="http://www.blogger.com/atom/ns#" term="snack for thought"/><title type='text'>The Importance of Trading More</title><content type='html'>This is by no means an attempt to promote high frequency trading (HFT). In fact, the HFT scene has become so crowded that even real pro shops are having a hard time, let alone retail traders with their home brew system (By the way, &lt;a href=&quot;http://jspauld.com/post/35126549635/how-i-made-500k-with-machine-learning-and-hft&quot; target=&quot;_blank&quot;&gt;here&lt;/a&gt; is an interesting read. Judge for yourself how much to believe). So why should a trader trade more?&lt;br /&gt;
&lt;br /&gt;
Because it&#39;s about how confident you can be in making a conclusion. If you make one trade in your life and it turns out winning, your rate of winning is 100% and yet the only legitimate conclusion you can make is...well, that you don&#39;t have enough data point. In the spirit of Bayesian statistics as was used &lt;a href=&quot;http://iagtm.blogspot.hk/2013/11/monty-hall-extended.html&quot; target=&quot;_blank&quot;&gt;here&lt;/a&gt;, we can formulate a simple analysis that hopefully would provide some insights.&lt;br /&gt;
&lt;br /&gt;
Suppose that you are a manager about to hire a new trader for your team. There are two candidates, Andrew Flook who had 5 winning trades out of 5 last year; and Bob Luckson who had 70 winning trades out of 100 last year. Who should get the job? Since Andrew has a 100% winning rate and Bob has only 70%...are we missing something?&lt;br /&gt;
&lt;br /&gt;
Let&#39;s cast this in the light of Bayesian statistics. Of course I would have to make some assumptions:&lt;br /&gt;
&lt;br /&gt;
Winning probability of a fluke trader = p = 0.5&lt;br /&gt;
Winning probability of a skilled trader = q = 0.7&lt;br /&gt;
Total number of winning trades = W&lt;br /&gt;
Total number of losing trades = L&lt;br /&gt;
Unconditional probability that any trader is a skilled one = s = 0.2&lt;br /&gt;
&lt;br /&gt;
The last assumption about a trader being a skilled one is based on the anecdotal evidence that only about 20% of all traders are profitable in the long run. So, if $R$ stands for the trading &lt;b&gt;R&lt;/b&gt;esults of last year, $S$($F$) stands for the trader being a &lt;b&gt;S&lt;/b&gt;killed(&lt;b&gt;F&lt;/b&gt;luke) one, we have&lt;br /&gt;
&lt;br /&gt;
$$ P(R|S)P(S) = q^W (1-q)^L s $$&lt;br /&gt;
$$ P(R|F)P(F) = p^W (1-p)^L (1-s) $$&lt;br /&gt;
$$ P(S|R) = \frac {P(R|S)P(S) }{P(R|S)P(S) +P(R|F)P(F) } $$ &lt;br /&gt;
&lt;br /&gt;
Plugging in the numbers, we find that Andrew (the 100% guy) has a 57% chance of being a skilled trader, while Bob enjoys a 99.9% chance.</content><link rel='replies' type='application/atom+xml' href='http://iagtm.blogspot.com/feeds/354877541512650052/comments/default' title='Post Comments'/><link rel='replies' type='text/html' href='http://iagtm.blogspot.com/2013/12/the-importance-of-trading-more.html#comment-form' title='0 Comments'/><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/5264419489096142546/posts/default/354877541512650052'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/5264419489096142546/posts/default/354877541512650052'/><link rel='alternate' type='text/html' href='http://iagtm.blogspot.com/2013/12/the-importance-of-trading-more.html' title='The Importance of Trading More'/><author><name>ΣHΦ</name><uri>http://www.blogger.com/profile/08883576142863481302</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='16' height='16' src='https://img1.blogblog.com/img/b16-rounded.gif'/></author><thr:total>0</thr:total></entry><entry><id>tag:blogger.com,1999:blog-5264419489096142546.post-2437799005466362368</id><published>2013-11-23T21:44:00.004-08:00</published><updated>2013-11-23T21:44:51.556-08:00</updated><category scheme="http://www.blogger.com/atom/ns#" term="snack for thought"/><title type='text'>How do you model the dynamics of asset prices? A self-reflection (2 of 3)</title><content type='html'>&lt;a href=&quot;http://iagtm.blogspot.hk/2013/11/how-do-you-model-dynamics-of-asset.html&quot; target=&quot;_blank&quot;&gt;Last time&lt;/a&gt; we have set a stage for the discussion on modeling the dynamics of asset prices. Gaussian process is the &quot;canonical&quot; way to go, and we&#39;ve seen the characteristics/limitations of it. To recap:&lt;br /&gt;
&lt;br /&gt;
&amp;nbsp; &amp;nbsp; &amp;nbsp;&amp;nbsp; &lt;b&gt;Candidate: Brownian motion&lt;/b&gt;&lt;br /&gt;
&lt;ul&gt;
&lt;li&gt;Markovian&lt;/li&gt;
&lt;li&gt;&quot;Tractable&quot;(-ish, depending on how you transform it)&lt;/li&gt;
&lt;li&gt;Excess kurtosis = 0&lt;/li&gt;
&lt;li&gt;Market completeness (if number of hedging instruments &amp;gt;= number of sources of randomness) &lt;/li&gt;
&lt;/ul&gt;
This view is usually summed up and referred to as &quot;random walk&quot; (or diffusion, if you are from the natural science branch of the academia). But does the financial market really walk? Or does it prefer doing something else?&lt;br /&gt;
&lt;br /&gt;
&lt;u&gt;&lt;i&gt;&lt;b&gt;Poisson&lt;/b&gt;&lt;/i&gt;&lt;/u&gt;&lt;br /&gt;
We&#39;ve already met &lt;a href=&quot;http://en.wikipedia.org/wiki/Carl_Friedrich_Gauss&quot; target=&quot;_blank&quot;&gt;Gauss &lt;/a&gt;last time. Now we&#39;ll introduce a contemporary of him, &lt;a href=&quot;http://en.wikipedia.org/wiki/Sim%C3%A9on_Denis_Poisson&quot; target=&quot;_blank&quot;&gt;Siméon Denis Poisson&lt;/a&gt;&lt;b&gt;. &lt;/b&gt;While Brownian motion is a diffusion stochastic process (a &lt;i&gt;random walk&lt;/i&gt; down the street), the Poisson process is a &lt;i&gt;counting process&lt;/i&gt; that is associated with jumps. When we add a Poisson counting process to the diffusion equation, the stochastic differential equation becomes a jump-diffusion equation that allows for jumps, or &quot;gapping up/down&quot;. Why is this desirable or required? Just talk to any trader, and they&#39;ll tell you that price jump is a reality, especially for markets with substantial close hours (i.e. the majority of the markets other than FX, S&amp;amp;P futures...). So instead of a random walk down the street, perhaps after all it is more like &lt;a href=&quot;http://en.wikipedia.org/wiki/Parkour&quot; target=&quot;_blank&quot;&gt;parkour &lt;/a&gt;down the street?&lt;br /&gt;
&lt;br /&gt;
&lt;i&gt;&lt;u&gt;&lt;b&gt;You Jump, I Jump&lt;/b&gt;&lt;/u&gt;&lt;/i&gt;&lt;br /&gt;
What are the advantages of modeling asset prices with a jump-diffusion process over a diffusion only process?&lt;br /&gt;
&lt;br /&gt;
&amp;nbsp; &amp;nbsp; &amp;nbsp;&amp;nbsp; &lt;b&gt;Candidate: Jump-diffusion Process&lt;/b&gt;&lt;br /&gt;
&lt;ul&gt;
&lt;li&gt;Markovian&lt;/li&gt;
&lt;li&gt;Not tractable (unless under restrictive assumptions)&lt;/li&gt;
&lt;li&gt;Excess kurtosis &amp;gt; 0&lt;/li&gt;
&lt;li&gt;Market incomplete (unless under restrictive assumptions)&amp;nbsp; &lt;/li&gt;
&lt;/ul&gt;
So, only Markovian-ness stays. Derivative prices under jump-diffusion models are generally not tractable unless assumptions are made. For example, &lt;a href=&quot;http://www.math.nyu.edu/~benartzi/Slides5.2.pdf&quot; target=&quot;_blank&quot;&gt;Merton&#39;s jump-diffusion model&lt;/a&gt; assumes that the jump size is lognormally distributed. The possibility of jumps gives the asset return distribution a desired &lt;i&gt;fat tail&lt;/i&gt; feature, hence excess kurtosis. Finally, market completeness is in general lost (there are two sources of randomness - diffusion and jump, but only one hedging instrument - the asset itself), and one has to estimate a market price of risk of the jumps. Incidentally, in Merton&#39;s model he assumes that such a market price of risk is zero because of diversifiability.&lt;br /&gt;
&lt;br /&gt;
The implementation of jump-diffusion model can be challenging. The numerical calibration is of course more computationally intensive, but the more subtle and fundamental issue is this: how do we identify jumps? When there is a &quot;sudden&quot; gap in the time series, how can one be sure that it is NOT just an extreme value, yet still being drawn from the good old Gaussian distribution?&lt;br /&gt;
&lt;br /&gt;</content><link rel='replies' type='application/atom+xml' href='http://iagtm.blogspot.com/feeds/2437799005466362368/comments/default' title='Post Comments'/><link rel='replies' type='text/html' href='http://iagtm.blogspot.com/2013/11/how-do-you-model-dynamics-of-asset_23.html#comment-form' title='0 Comments'/><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/5264419489096142546/posts/default/2437799005466362368'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/5264419489096142546/posts/default/2437799005466362368'/><link rel='alternate' type='text/html' href='http://iagtm.blogspot.com/2013/11/how-do-you-model-dynamics-of-asset_23.html' title='How do you model the dynamics of asset prices? A self-reflection (2 of 3)'/><author><name>ΣHΦ</name><uri>http://www.blogger.com/profile/08883576142863481302</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='16' height='16' src='https://img1.blogblog.com/img/b16-rounded.gif'/></author><thr:total>0</thr:total></entry><entry><id>tag:blogger.com,1999:blog-5264419489096142546.post-4915022626927826244</id><published>2013-11-22T01:23:00.001-08:00</published><updated>2013-11-22T20:45:26.792-08:00</updated><category scheme="http://www.blogger.com/atom/ns#" term="interview"/><category scheme="http://www.blogger.com/atom/ns#" term="short notes"/><title type='text'>Monty Hall, extended</title><content type='html'>The original &lt;a href=&quot;http://en.wikipedia.org/wiki/Monty_Hall_problem&quot; target=&quot;_blank&quot;&gt;Monty Hall problem&lt;/a&gt; is so famous that pretty much every soul knows the solution by heart (in case you don&#39;t: change to the other still closed door and double your winning probability!). Despite (or because of) the fame of this problem, some would learn the answer without really knowing how to solve it. Let&#39;s go through the problem in its original setting:&lt;br /&gt;
&lt;br /&gt;
&lt;b&gt;&lt;u&gt;Classic Three Door Monty Hall &lt;/u&gt;&lt;/b&gt;&lt;br /&gt;
There are three doors &lt;i&gt;A&lt;/i&gt;, &lt;i&gt;B&lt;/i&gt; and &lt;i&gt;C&lt;/i&gt;, and only one leads to a prize. After you picked door &lt;i&gt;A&lt;/i&gt;, the host (who knows where the prize is) opens door &lt;i&gt;C&lt;/i&gt;, which turns out to be not the prize door. What is the winning probabilities of you sticking to door &lt;i&gt;A&lt;/i&gt; versus switching to door &lt;i&gt;B&lt;/i&gt;?&lt;br /&gt;
&lt;br /&gt;
And of course, the toolkit to invoke is Bayesian statistics:&lt;br /&gt;
$$ P(A|C_o) = \frac { P(C_o|A)P(A)}{P(C_o)} $$&lt;br /&gt;
where $P(X)$ is the unconditional probability of the prize being behind door &lt;i&gt;X&lt;/i&gt;, and $P(Y_o)$ is the probability of door &lt;i&gt;Y&lt;/i&gt; being opened by the host. In this case, the entities on the RHS are straightforward, except perhaps for $ P(C_o)$:&lt;br /&gt;
$$&amp;nbsp; P(C_o|A) = 1/2 $$&lt;br /&gt;
$$&amp;nbsp; P(A) = 1/3 $$&lt;br /&gt;
$$&amp;nbsp; P(C_o) =  P(C_o|A)P(A) +  P(C_o|B)P(B) +  P(C_o|C)P(C) $$&lt;br /&gt;
$$= \frac 1 2 \times&amp;nbsp; \frac 1 3 + 1 \times \frac 1 3 + 0 = \frac 1 2$$ &lt;br /&gt;
So $P(A|C_o) = 1/3$. One can in a similar fashion find that $P(B|C_o) = 2/3$. The reason $  P(C_o|B) = 1$ is of course that if the prize is really behind door &lt;i&gt;B&lt;/i&gt;, the host has no choice but to open door &lt;i&gt;C&lt;/i&gt;.&lt;br /&gt;
&lt;br /&gt;
&lt;u&gt;&lt;b&gt;Extended Five Door Monty Hall&lt;/b&gt;&lt;/u&gt;&lt;br /&gt;
So far so good. Now we are invited to a &quot;Monty Hall Deluxe&quot; game with a bigger prize, but more doors and more rounds.&lt;u&gt;&lt;b&gt; &lt;/b&gt;&lt;/u&gt;In round one, you pick a door. The host would open one door, after which you may choose to switch to another. Then once you have decided and acted accordingly, we enter round two where the host would open one more door (so number of closed door drops to 3 at this point). Then you decide on whether to switch for a second time, and if so to which door. What should the optimal strategy be?&lt;br /&gt;
&lt;br /&gt;
Suppose you first pick door &lt;i&gt;A&lt;/i&gt; and the host opens door &lt;i&gt;E&lt;/i&gt;. The first round of this game is really similar to the Classic version above. Namely,&lt;br /&gt;
$$ P(A|E_o) = \frac { P(E_o|A)P(A)}{P(E_o)} $$&lt;br /&gt;
with&lt;br /&gt;
$$&amp;nbsp; P(E_o|A) = 1/4$$&lt;br /&gt;
$$&amp;nbsp; P(A) = 1/5$$&lt;br /&gt;
$$&amp;nbsp; P(E_o) =\sum&amp;nbsp;  P(E_o|X)P(X) $$&lt;br /&gt;
$$= \frac 1 4 \times&amp;nbsp; \frac 1 5 + \frac 1 3 \times \frac 1 5 +  \frac 1 3 \times&amp;nbsp; \frac 1 5+ \frac 1 3 \times&amp;nbsp; \frac 1 5+0 = \frac 1 4$$&lt;br /&gt;
So $P(A|E_o) = 3/15$. Similarly, one can show that $P(B|E_o) = P(C|E_o) =P(D|E_o) =4/15$. So once again, it is better for you to switch (and due to symmetry, it doesn&#39;t matter to which).&lt;br /&gt;
&lt;br /&gt;
Suppose you switch to door &lt;i&gt;B&lt;/i&gt;. Now we are in round two. The host then open door &lt;i&gt;D&lt;/i&gt;, which, surprise-surprise, turns out to have no prize behind it too. Now what do you do? What are the probabilities of staying versus switching?&lt;br /&gt;
&lt;br /&gt;
One thing to be careful about is this: since at this point round one is already over, the conditional probabilities we calculated (i.e. $P(A|E_o)$, $P(B|E_o)$, ...) should now be considered unconditional:&lt;br /&gt;
$$ P(A)&amp;nbsp; = 3/15$$&lt;br /&gt;
$$ P(B)&amp;nbsp; = 4/15$$&lt;br /&gt;
$$ P(C)&amp;nbsp; = 4/15$$&lt;br /&gt;
We also have the followings:&lt;br /&gt;
$$ P(D_o|A) = 1/2$$&lt;br /&gt;
$$ P(D_o|B) = 1/3$$&lt;br /&gt;
$$ P(D_o|C) = 1/2$$ &lt;br /&gt;
$$&amp;nbsp; P(D_o) =\sum&amp;nbsp;  P(D_o|X)P(X) $$&lt;br /&gt;
$$= \frac 1 2 \times&amp;nbsp; \frac 3 {15} + \frac 1 3 \times \frac 4 {15} +  \frac 1 2
 \times&amp;nbsp; \frac 4 {15} +0 = \frac {29} {90}$$ &lt;br /&gt;
Hence $P(A|D_o) = 9/29$, $P(B|D_o) = 8/29$ and $P(C|D_o) = 12/29$. So staying with door &lt;i&gt;B&lt;/i&gt; is even worse than switching back to door &lt;i&gt;A&lt;/i&gt;, and switching to the untouched door &lt;i&gt;C&lt;/i&gt; is the best. Just keep switching!</content><link rel='replies' type='application/atom+xml' href='http://iagtm.blogspot.com/feeds/4915022626927826244/comments/default' title='Post Comments'/><link rel='replies' type='text/html' href='http://iagtm.blogspot.com/2013/11/monty-hall-extended.html#comment-form' title='0 Comments'/><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/5264419489096142546/posts/default/4915022626927826244'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/5264419489096142546/posts/default/4915022626927826244'/><link rel='alternate' type='text/html' href='http://iagtm.blogspot.com/2013/11/monty-hall-extended.html' title='Monty Hall, extended'/><author><name>ΣHΦ</name><uri>http://www.blogger.com/profile/08883576142863481302</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='16' height='16' src='https://img1.blogblog.com/img/b16-rounded.gif'/></author><thr:total>0</thr:total></entry><entry><id>tag:blogger.com,1999:blog-5264419489096142546.post-2705642244072243538</id><published>2013-11-17T19:54:00.003-08:00</published><updated>2013-11-22T22:33:41.385-08:00</updated><category scheme="http://www.blogger.com/atom/ns#" term="snack for thought"/><title type='text'>How do you model the dynamics of asset prices? A self-reflection (1 of 3)</title><content type='html'>Having been working on/studying mathematical finance for a while now, I feel like it would be useful to step back and look at one of the most important topics in this area: how does one model asset price dynamics?&lt;br /&gt;
&lt;br /&gt;
&lt;u&gt;&lt;b&gt;&lt;span lang=&quot;de&quot;&gt;&lt;i&gt;Gauß&lt;/i&gt;&lt;/span&gt; &lt;/b&gt;&lt;/u&gt;&lt;br /&gt;
The canonical account would inevitably begin with &lt;a href=&quot;http://en.wikipedia.org/wiki/Carl_Friedrich_Gauss&quot; target=&quot;_blank&quot;&gt;Gauss&lt;/a&gt;. The &lt;a href=&quot;http://en.wikipedia.org/wiki/Normal_distribution&quot; target=&quot;_blank&quot;&gt;Gaussian distribution&lt;/a&gt; (or the normal distribution, depending on your academic upbringing) is undeniable the most well-investigated probability distribution in human history. We don&#39;t need to go into all the details and properties of it, but it&#39;s good to be reminded of a number of facts regarding how the normal distribution is related to some other entities:&lt;br /&gt;
&lt;ul&gt;
&lt;li&gt;It is closely related to the phenomenon of &lt;a href=&quot;http://en.wikipedia.org/wiki/Diffusion&quot; target=&quot;_blank&quot;&gt;diffusion&lt;/a&gt;;&lt;/li&gt;
&lt;li&gt;The &lt;a href=&quot;http://en.wikipedia.org/wiki/Central_limit_theorem&quot; target=&quot;_blank&quot;&gt;Central Limit Theorem&lt;/a&gt; says that (under some technical conditions) the sum of many i.i.d. random variables would converge to a normal distribution;&lt;/li&gt;
&lt;li&gt;&lt;a href=&quot;http://en.wikipedia.org/wiki/Brownian_motion&quot; target=&quot;_blank&quot;&gt;Brownian motion&lt;/a&gt; is mathematically described by &lt;a href=&quot;http://en.wikipedia.org/wiki/Wiener_process&quot; target=&quot;_blank&quot;&gt;Wiener process&lt;/a&gt;, which follows a Gaussian distribution.&lt;/li&gt;
&lt;/ul&gt;
I don&#39;t want to delve into historical investigation in whether &lt;a href=&quot;http://en.wikipedia.org/wiki/Louis_Bachelier&quot; target=&quot;_blank&quot;&gt;Louis Bachelier&lt;/a&gt; is the first person to model financial time series with (arithmetic) Brownian motion, but it&#39;s fair to say that he is at least among the first ones who formalize it and apply it in derivative pricing. Later down the road, some would argue that arithmetic Brownian motion is prone to producing negative values and would propose other alternative processes (e.g. geometric Brownian motion for stock prices, O-U process for rates), but those would all be in the same spirit of arithmetic Brownian motion, save some transformations (e.g. taking the natural log as in geometric Brownian motion)&lt;br /&gt;
&lt;br /&gt;
&lt;i&gt;&lt;u&gt;&lt;b&gt;Our&amp;nbsp; Checklist&lt;/b&gt;&lt;/u&gt;&lt;/i&gt;&lt;br /&gt;
Before proceeding further, let&#39;s compile a checklist that we will re-visit multiple times in this series:&lt;br /&gt;
&lt;br /&gt;
&amp;nbsp; &amp;nbsp; &amp;nbsp;&amp;nbsp; &lt;b&gt;Candidate: Brownian motion&lt;/b&gt;&lt;br /&gt;
&lt;ul&gt;
&lt;li&gt;Markovian&lt;/li&gt;
&lt;li&gt;&quot;Tractable&quot;(-ish, depending on how you transform it)&lt;/li&gt;
&lt;li&gt;Excess kurtosis = 0&lt;/li&gt;
&lt;li&gt;Market completeness (if number of hedging instruments &amp;gt;= number of sources of randomness)&lt;/li&gt;
&lt;/ul&gt;
Since this is the first time the checklist is presented, we should go through each point:&lt;br /&gt;
&lt;ul&gt;
&lt;li&gt;A &lt;a href=&quot;http://en.wikipedia.org/wiki/Markov_process&quot; target=&quot;_blank&quot;&gt;Markov process&lt;/a&gt; has no memory. It doesn&#39;t matter if the market went up 20%, up 3%, down 3%, or down 20% yesterday. Today&#39;s probability of movement is not affected in any way.&lt;/li&gt;
&lt;li&gt;&quot;Tractable&quot; refers to a closed-form expression for the asset price process itself, or the price of derivatives with the asset as underlying.&lt;/li&gt;
&lt;li&gt;Excess &lt;a href=&quot;http://en.wikipedia.org/wiki/Kurtosis&quot; target=&quot;_blank&quot;&gt;kurtosis&lt;/a&gt; is a measure of &quot;tail effect&quot;&lt;/li&gt;
&lt;li&gt;Market completeness means a contingent claim can be fully hedged&lt;/li&gt;
&lt;/ul&gt;
The paradigm of thinking of asset price as following a Brownian motion is commonly known as the &lt;i&gt;random walk&lt;/i&gt; hypothesis. It is well-known and widely used: it&#39;s the canonical/default view in the majority of quant finance textbooks; it is mentioned and discussed in &quot;pop-finance&quot; books such as &lt;a href=&quot;http://www.amazon.com/Random-Walk-Down-Wall-Street/dp/0393330338&quot; target=&quot;_blank&quot;&gt;A Random Walk Down Wall Street&lt;/a&gt;. But how realistic is it and what are the caveats?</content><link rel='replies' type='application/atom+xml' href='http://iagtm.blogspot.com/feeds/2705642244072243538/comments/default' title='Post Comments'/><link rel='replies' type='text/html' href='http://iagtm.blogspot.com/2013/11/how-do-you-model-dynamics-of-asset.html#comment-form' title='1 Comments'/><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/5264419489096142546/posts/default/2705642244072243538'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/5264419489096142546/posts/default/2705642244072243538'/><link rel='alternate' type='text/html' href='http://iagtm.blogspot.com/2013/11/how-do-you-model-dynamics-of-asset.html' title='How do you model the dynamics of asset prices? A self-reflection (1 of 3)'/><author><name>ΣHΦ</name><uri>http://www.blogger.com/profile/08883576142863481302</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='16' height='16' src='https://img1.blogblog.com/img/b16-rounded.gif'/></author><thr:total>1</thr:total></entry><entry><id>tag:blogger.com,1999:blog-5264419489096142546.post-6112433210614977166</id><published>2013-11-07T02:15:00.000-08:00</published><updated>2013-11-07T02:17:13.948-08:00</updated><category scheme="http://www.blogger.com/atom/ns#" term="Algorithms"/><category scheme="http://www.blogger.com/atom/ns#" term="short notes"/><category scheme="http://www.blogger.com/atom/ns#" term="snack for thought"/><title type='text'>The Balanced 1-0 Matrix Problem</title><content type='html'>This post is about the &lt;a href=&quot;http://en.wikipedia.org/wiki/Dynamic_programming#A_type_of_balanced_0.E2.80.931_matrix&quot; target=&quot;_blank&quot;&gt;Balanced 1-0 Matrix&lt;/a&gt; problem. Namely, for an n-by-n matrix (can be relaxed to n-by-m, but we will stick to square matrix here), how many legitimate assignments are there such that each row as well as column contains exactly n/2 zeros and n/2 ones?&lt;br /&gt;
&lt;br /&gt;
You will find different approaches to solve this problem in the link, and one thing to note is how quickly the sequence grows: the numbers of possible assignments are 1, 2, 90, 297200... for 1-by-1, 2-by-2, 3-by-3, 4-by-4 matrices. The brute force approach is not very interesting, so we will only discuss the dynamic programming approach. The Matlab script can be found at the end.&lt;br /&gt;
&lt;br /&gt;
The idea is first to have an easy way to store the arrangement. That is what &lt;i&gt;stateArr &lt;/i&gt;does. As a 2-by-n array, it stores how many zeros and ones are still available to be allocated for each of the n columns. Then we have the systematic sweeping through the rows, meaning that we do a tree search starting from the first row downward. We iterate all the &lt;i&gt;possible &lt;/i&gt;combinations (of course, they have to have n/2 zeros and n/2 ones) for a row, and compare these possible combinations against the &lt;i&gt;stateArr&lt;/i&gt; to see if there are enough zeros and ones to be assigned. This is what the &lt;i&gt;for &lt;/i&gt;loop within the &lt;i&gt;DP_recursion&lt;/i&gt; is for.&lt;br /&gt;
&lt;br /&gt;
Finally, the algorithm described above would have to visit every and all solutions unless we use a&amp;nbsp;&lt;a href=&quot;http://en.wikipedia.org/wiki/Memoization&quot; target=&quot;_blank&quot;&gt;memoization&lt;/a&gt; trick. All partial solutions, as well as the corresponding &lt;i&gt;stateArr&lt;/i&gt;,&lt;i&gt; &lt;/i&gt; are stored in &lt;i&gt;stateArrTable&lt;/i&gt;, and for every step the script would first check whether partial solution already exists. If so, use the &lt;i&gt;stateArr &lt;/i&gt;as a signature/key to retrieve it; if not, and only if not, will it jump into recursion. &lt;br /&gt;
&lt;br /&gt;
Unfortunately, even with dynamic programming, the computation is too intensive for Matlab for any n &amp;gt; 4.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
function output = ZeroOneMat_DP(numCol)&lt;br /&gt;
% ((1, 2) (2, 1) (1, 2) (2, 1)) would be stored as&lt;br /&gt;
% [1, 2, 1, 2; 2, 1, 2, 1]&lt;br /&gt;
% First row is # zeros, second row is # ones&lt;br /&gt;
stateArr = numCol/2*ones(2,numCol);&lt;br /&gt;
stateArrTable = [];&lt;br /&gt;
partialAnsArr = [];&lt;br /&gt;
[output stateArrTable partialAnsArr] = DP_recursion(numCol, stateArr, stateArrTable, partialAnsArr, 0);&lt;br /&gt;
end&lt;br /&gt;
&lt;br /&gt;
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%&lt;br /&gt;
&lt;br /&gt;
function [output stateArrTable partialAnsArr] = DP_recursion(numCol, stateArr, stateArrTable, partialAnsArr, numSol)&lt;br /&gt;
% Iterate all combinations&lt;br /&gt;
locationMat = nchoosek(1:numCol,numCol/2);&lt;br /&gt;
tempOutput = numSol;&lt;br /&gt;
for i = 1:size(locationMat,1)&lt;br /&gt;
&amp;nbsp;&amp;nbsp;&amp;nbsp; thisRow = zeros(1,numCol);&lt;br /&gt;
&amp;nbsp;&amp;nbsp;&amp;nbsp; thisRow(locationMat(i,:)) = 1;&lt;br /&gt;
&amp;nbsp;&amp;nbsp;&amp;nbsp; % Change stateArr&lt;br /&gt;
&amp;nbsp;&amp;nbsp;&amp;nbsp; stateArr_temp = stateArr;&lt;br /&gt;
&amp;nbsp;&amp;nbsp;&amp;nbsp; for j = 1:numCol&lt;br /&gt;
&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp; if thisRow(j) == 0&lt;br /&gt;
&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp; stateArr_temp(1,j) = stateArr_temp(1,j) - 1;&lt;br /&gt;
&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp; elseif thisRow(j) == 1&lt;br /&gt;
&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp; stateArr_temp(2,j) = stateArr_temp(2,j) - 1;&lt;br /&gt;
&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp; end&lt;br /&gt;
&amp;nbsp;&amp;nbsp;&amp;nbsp; end&lt;br /&gt;
&amp;nbsp;&amp;nbsp;&amp;nbsp; % Check if there is negative values&lt;br /&gt;
&amp;nbsp;&amp;nbsp;&amp;nbsp; if min(min(stateArr_temp)) &amp;lt; 0&lt;br /&gt;
&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp; &lt;br /&gt;
&amp;nbsp;&amp;nbsp;&amp;nbsp; elseif min(min(stateArr_temp)) &amp;gt;= 0 &amp;amp; max(max(stateArr_temp)) &amp;gt; 0&lt;br /&gt;
&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp; % See if already in table&lt;br /&gt;
&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp; [foundBool theAnswer] = findInTable(stateArr_temp, stateArrTable, partialAnsArr);&lt;br /&gt;
&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp; if foundBool == 0 % not&lt;br /&gt;
&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp; [tempOutput2 stateArrTable partialAnsArr] = DP_recursion(numCol, stateArr_temp, stateArrTable, partialAnsArr, tempOutput);&lt;br /&gt;
&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp; % Save to partial answers&lt;br /&gt;
&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp; stateArrTable = [stateArrTable; stateArr_temp];&lt;br /&gt;
&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp; partialAnsArr = [partialAnsArr; tempOutput2 - tempOutput];&lt;br /&gt;
&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp; tempOutput = tempOutput2;&lt;br /&gt;
&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp; elseif foundBool == 1&lt;br /&gt;
&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp; % find in table&lt;br /&gt;
&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp; tempOutput = tempOutput + theAnswer;&lt;br /&gt;
&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp; end&lt;br /&gt;
&amp;nbsp;&amp;nbsp;&amp;nbsp; elseif&amp;nbsp; max(max(abs(stateArr_temp))) == 0 % successfully placed all numbers through the last row&lt;br /&gt;
&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp; tempOutput = tempOutput + 1;&lt;br /&gt;
&amp;nbsp;&amp;nbsp;&amp;nbsp; end&lt;br /&gt;
end&lt;br /&gt;
output = tempOutput;&lt;br /&gt;
end&lt;br /&gt;
&lt;br /&gt;
function [foundBool theAnswer] = findInTable(stateArr, stateArrTable, partialAnsArr)&lt;br /&gt;
foundBool = 0;&lt;br /&gt;
theAnswer = -1;&lt;br /&gt;
for i = 1:size(stateArrTable,1)/2&lt;br /&gt;
&amp;nbsp;&amp;nbsp;&amp;nbsp; if max(max(abs(stateArrTable(2*i-1:2*i,:)-stateArr))) == 0&lt;br /&gt;
&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp; theAnswer = partialAnsArr(i);&lt;br /&gt;
&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp; foundBool = 1;&lt;br /&gt;
&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp; break&lt;br /&gt;
&amp;nbsp;&amp;nbsp;&amp;nbsp; end&lt;br /&gt;
end&lt;br /&gt;
end</content><link rel='replies' type='application/atom+xml' href='http://iagtm.blogspot.com/feeds/6112433210614977166/comments/default' title='Post Comments'/><link rel='replies' type='text/html' href='http://iagtm.blogspot.com/2013/11/the-balanced-1-0-matrix-problem.html#comment-form' title='0 Comments'/><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/5264419489096142546/posts/default/6112433210614977166'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/5264419489096142546/posts/default/6112433210614977166'/><link rel='alternate' type='text/html' href='http://iagtm.blogspot.com/2013/11/the-balanced-1-0-matrix-problem.html' title='The Balanced 1-0 Matrix Problem'/><author><name>ΣHΦ</name><uri>http://www.blogger.com/profile/08883576142863481302</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='16' height='16' src='https://img1.blogblog.com/img/b16-rounded.gif'/></author><thr:total>0</thr:total></entry><entry><id>tag:blogger.com,1999:blog-5264419489096142546.post-3736626723110284226</id><published>2013-11-05T01:33:00.000-08:00</published><updated>2013-11-05T01:33:36.203-08:00</updated><category scheme="http://www.blogger.com/atom/ns#" term="card flipping"/><category scheme="http://www.blogger.com/atom/ns#" term="interview"/><title type='text'>Those damn cards...</title><content type='html'>We are quickly approaching the end of the combo interview question bank series. So far we have discussed a variety of coin and dice problems. Yet another popular theme would be card games, specifically with poker decks. As compared to coins and dice, a poker deck contains two colours and four suits, giving rise to some interesting and complicated games and problems.&lt;br /&gt;
&lt;br /&gt;
&lt;i&gt;&lt;b&gt;CF01&lt;/b&gt;&lt;/i&gt;&lt;br /&gt;
A deck consists of 3 red and 3 black cards. They are turned over one by one, and at any point you can make the call of the following card being red. If it turns out to be the case, you win. What is the optimal strategy?&lt;br /&gt;
&lt;i&gt;&lt;b&gt; &lt;/b&gt;&lt;/i&gt;&lt;br /&gt;
&lt;i&gt;&lt;b&gt;&lt;i&gt;&lt;b&gt;CF01&lt;/b&gt;&lt;/i&gt;- Answer:&lt;/b&gt;&lt;/i&gt;&lt;br /&gt;
This is closely related to option pricing with binomial tree. Being able to call &#39;red&#39; as you wish is equivalent to early exercise. It&#39;s trivial to show that &lt;i&gt;without&lt;/i&gt; early exercise, the probability tree reads:&lt;br /&gt;
0.5000&lt;br /&gt;
0.3125&amp;nbsp; 0.6875&lt;br /&gt;
0.1250 0.5000 0.8750&lt;br /&gt;
0.0000 0.2500 0.7500 1.0000&lt;br /&gt;
0.0000 0.5000 1.0000&lt;br /&gt;
1.0000 0.0000&lt;br /&gt;
corresponding to #Black card shown : #Red card shown&lt;br /&gt;
0:0&lt;br /&gt;
0:1&amp;nbsp; 1:0&lt;br /&gt;
0:2&amp;nbsp; 1:1&amp;nbsp; 2:0&lt;br /&gt;
0:3&amp;nbsp; 1:2&amp;nbsp; 2:1&amp;nbsp; 3:0&lt;br /&gt;
1:3&amp;nbsp; 2:2&amp;nbsp; 3:1&lt;br /&gt;
2:3&amp;nbsp; 3:2&lt;br /&gt;
Remember, this is when there is no early exercise, meaning that you can only passively look at cards being flipped open and wait to see if the last card is red. To take early exercise into account, some nodes on the probability tree will be over-ridden, depending on the numbers of remaining cards on the node. Take the (1:2) node as an example. When 1 Black card and 2 Red cards are already shown, there are 2 Black cards and 1 Red card remaining in the deck. Hence the winning probability of early calling at this point is 1/3 = 0.333..., which is &lt;i&gt;greater&lt;/i&gt; than 0.25. Hence the optimal strategy would require early calling at this node. Similar argument can be made regarding other nodes on the tree.&lt;br /&gt;
&lt;br /&gt;
&lt;i&gt;&lt;b&gt;CF02&lt;/b&gt;&lt;/i&gt;&lt;br /&gt;
You draw a card from a deck and player &lt;i&gt;B&lt;/i&gt; draws another. You win only if your draw has a higher number. What is the probability that you will win?&lt;br /&gt;
&lt;i&gt;&lt;b&gt; &lt;/b&gt;&lt;/i&gt;&lt;br /&gt;
&lt;i&gt;&lt;b&gt;&lt;i&gt;&lt;b&gt;CF02&lt;/b&gt;&lt;/i&gt;- Answer:&lt;/b&gt;&lt;/i&gt;&lt;br /&gt;
P(numbers equal) = 3/51 = 1/17. Due to symmetry, the two parties have the same winning probability. Hence P(you win) = (1 - 1/17) / 2 = &lt;span style=&quot;color: red;&quot;&gt;8/17&lt;/span&gt;&lt;br /&gt;
&lt;br /&gt;
&lt;a href=&quot;http://iagtm.blogspot.hk/2012/10/all-those-interview-questions-and.html&quot;&gt;See here for more interview questions/brainteasers&lt;/a&gt;</content><link rel='replies' type='application/atom+xml' href='http://iagtm.blogspot.com/feeds/3736626723110284226/comments/default' title='Post Comments'/><link rel='replies' type='text/html' href='http://iagtm.blogspot.com/2013/11/those-damn-cards.html#comment-form' title='0 Comments'/><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/5264419489096142546/posts/default/3736626723110284226'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/5264419489096142546/posts/default/3736626723110284226'/><link rel='alternate' type='text/html' href='http://iagtm.blogspot.com/2013/11/those-damn-cards.html' title='Those damn cards...'/><author><name>ΣHΦ</name><uri>http://www.blogger.com/profile/08883576142863481302</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='16' height='16' src='https://img1.blogblog.com/img/b16-rounded.gif'/></author><thr:total>0</thr:total></entry><entry><id>tag:blogger.com,1999:blog-5264419489096142546.post-7181991857017387353</id><published>2013-10-30T05:32:00.000-07:00</published><updated>2013-11-07T17:25:51.215-08:00</updated><category scheme="http://www.blogger.com/atom/ns#" term="dice rolling"/><category scheme="http://www.blogger.com/atom/ns#" term="interview"/><title type='text'>Those damn dice... (Part II)</title><content type='html'>&lt;a href=&quot;http://iagtm.blogspot.hk/2013/02/those-damn-dice.html&quot; target=&quot;_blank&quot;&gt;Last time&lt;/a&gt;&amp;nbsp; we investigated questions that ask about the probability of a variety of dice rolling situations. This time we focus on games that involve dice.&lt;br /&gt;
&lt;br /&gt;
&lt;i&gt;&lt;b&gt;&amp;nbsp;DR04&lt;/b&gt;&lt;/i&gt;&lt;br /&gt;
You roll a six-sided die and a ten-sided die. If you guess the sum correctly you win an amount that equals the sum. What is the optimal guess?&lt;br /&gt;
&lt;i&gt;&lt;b&gt; &lt;/b&gt;&lt;/i&gt;&lt;br /&gt;
&lt;i&gt;&lt;b&gt;DR04 - Answer:&lt;/b&gt;&lt;/i&gt;&lt;br /&gt;
First of all, think about what &quot;&lt;i&gt;optimal guess&lt;/i&gt;&quot; means. It should maximize the expected payoff. Hence we can iterate a table:&lt;br /&gt;
&lt;b&gt;Sum&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp;&amp;nbsp; | &lt;/b&gt;2&amp;nbsp; 3&amp;nbsp; 4&amp;nbsp; 5&amp;nbsp; 6&amp;nbsp; 7&amp;nbsp; 8&amp;nbsp; 9 10 11 12 13 14 15 16&lt;br /&gt;
&lt;b&gt;# combination&amp;nbsp; | &lt;/b&gt;1&amp;nbsp; 2&amp;nbsp; 3&amp;nbsp; 4&amp;nbsp; 5&amp;nbsp; 6&amp;nbsp; 6&amp;nbsp; 6&amp;nbsp;&amp;nbsp; 6&amp;nbsp;&amp;nbsp; 6&amp;nbsp;&amp;nbsp; 5 &amp;nbsp; 4&amp;nbsp;&amp;nbsp; 3&amp;nbsp;&amp;nbsp; 2&amp;nbsp;&amp;nbsp; 1&lt;br /&gt;
The product is maximized at sum = &lt;span style=&quot;color: red;&quot;&gt;11&lt;/span&gt;, which is the answer.&lt;br /&gt;
&lt;br /&gt;
&lt;i&gt;&lt;b&gt;DR05&lt;/b&gt;&lt;/i&gt;&lt;br /&gt;
What is the expectation value of the product of rolling a six-sided die and a eight-sided die?&lt;br /&gt;
&lt;i&gt;&lt;b&gt; &lt;/b&gt;&lt;/i&gt;&lt;br /&gt;
&lt;i&gt;&lt;b&gt;DR05- Answer:&lt;span style=&quot;background-color: white;&quot;&gt;&lt;/span&gt;&lt;/b&gt;&lt;/i&gt;&lt;br /&gt;
Since the two rolls are independent events, E[A &amp;amp; B] = E[A] * E[B] = &lt;span style=&quot;color: red;&quot;&gt;&lt;span style=&quot;background-color: white;&quot;&gt;15.75&lt;/span&gt;&lt;/span&gt;&lt;br /&gt;
&lt;br /&gt;
&lt;i&gt;&lt;b&gt;DR06&lt;/b&gt;&lt;/i&gt;&lt;br /&gt;
The game is as follow: Roll a 12-sided die. You can either get the amount of the roll, or choose to roll two 6-sided dice, at which point you must receive the sum of the two dice. What is the game worth?&lt;br /&gt;
&lt;i&gt;&lt;b&gt; &lt;/b&gt;&lt;/i&gt;&lt;br /&gt;
&lt;i&gt;&lt;b&gt;DR06- Answer:&lt;span style=&quot;background-color: white;&quot;&gt;&lt;/span&gt;&lt;/b&gt;&lt;/i&gt;&lt;br /&gt;
Use backward induction. The expected payoff of the second round is 7. Hence you would go for round 2 only if the first round was less than or equals 6. Thus the payoff is&lt;br /&gt;
(7 + 8 + 9 + 10 + 11 + 12) / 12 + 0.5 * 7 = &lt;span style=&quot;color: red;&quot;&gt;8.25&lt;/span&gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;i&gt;&lt;b&gt;DR06&lt;/b&gt;&lt;/i&gt;&lt;br /&gt;
What is the expectation value of the absolute difference of the points on two 6-sided dice?&lt;br /&gt;
&lt;i&gt;&lt;b&gt; &lt;/b&gt;&lt;/i&gt;&lt;br /&gt;
&lt;i&gt;&lt;b&gt;DR06- Answer:&lt;span style=&quot;background-color: white;&quot;&gt;&lt;/span&gt;&lt;/b&gt;&lt;/i&gt;&lt;br /&gt;
By simple state space counting, the answer is&lt;br /&gt;
(0 * 6 + 1 * 10 + 2 * 8 + 3 * 6 + 4 * 4 + 5 * 2) / 36 = &lt;span style=&quot;color: red;&quot;&gt;1.94&lt;/span&gt;&lt;br /&gt;
&lt;br /&gt;
&lt;a href=&quot;http://iagtm.blogspot.hk/2012/10/all-those-interview-questions-and.html&quot;&gt;See here for more interview questions/brainteasers&lt;/a&gt;&lt;br /&gt;
&lt;span style=&quot;color: red;&quot;&gt;&lt;/span&gt;</content><link rel='replies' type='application/atom+xml' href='http://iagtm.blogspot.com/feeds/7181991857017387353/comments/default' title='Post Comments'/><link rel='replies' type='text/html' href='http://iagtm.blogspot.com/2013/10/those-damn-dicepart-ii.html#comment-form' title='2 Comments'/><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/5264419489096142546/posts/default/7181991857017387353'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/5264419489096142546/posts/default/7181991857017387353'/><link rel='alternate' type='text/html' href='http://iagtm.blogspot.com/2013/10/those-damn-dicepart-ii.html' title='Those damn dice... (Part II)'/><author><name>ΣHΦ</name><uri>http://www.blogger.com/profile/08883576142863481302</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='16' height='16' src='https://img1.blogblog.com/img/b16-rounded.gif'/></author><thr:total>2</thr:total></entry><entry><id>tag:blogger.com,1999:blog-5264419489096142546.post-4577419026727876827</id><published>2013-10-11T23:27:00.002-07:00</published><updated>2013-10-11T23:27:56.877-07:00</updated><category scheme="http://www.blogger.com/atom/ns#" term="card flipping"/><category scheme="http://www.blogger.com/atom/ns#" term="coin tossing"/><category scheme="http://www.blogger.com/atom/ns#" term="interview"/><category scheme="http://www.blogger.com/atom/ns#" term="short notes"/><title type='text'>Brainteaser: Expected Number of Trials</title><content type='html'>The first part is the classic coin flipping question: For a fair coin, what is the expected number of trials in order to get the first Head? And the answer is 2 (see &lt;a href=&quot;http://iagtm.blogspot.hk/2012/11/those-damn-coins-part-ii.html&quot; target=&quot;_blank&quot;&gt;here&lt;/a&gt; for discussion and related problems).&lt;br /&gt;
&lt;br /&gt;
Now, put the coin aside and consider instead a deck of 52 cards. What is the expected number of trials in order to get the first red card? Would it be less than, equal to, or larger than 2? In the coin case, one way to get the answer is to do the infinite sum&lt;br /&gt;
&lt;br /&gt;
$$ E[H] = \sum_{i=1}^{\infty} \frac{1}{2^i} i $$&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Now, along the same line we can have a finite series&lt;br /&gt;
&lt;br /&gt;
$$ E[Red] = \sum_{i=1}^{52} P_i i$$&lt;br /&gt;
&lt;br /&gt;
The only problem is that for this case the $P_i$&#39;s are uglier. Just write down the first few terms and we will see&lt;br /&gt;
&lt;br /&gt;
$$ E[Red] = \frac {26}{52}1 + \frac {26}{52} \frac {26}{51}2 + \frac {26}{52} \frac {25}{51} \frac {26}{50}3 + \sum_{i=4}^{52} P_i i$$&lt;br /&gt;
&lt;br /&gt;
As you can see, some of the fractions are greater than 1/2 and some are less. Can we easily conclude if the finite sum is less than or greater than 2? &lt;br /&gt;
&lt;br /&gt;
&lt;a href=&quot;http://iagtm.blogspot.hk/2012/10/all-those-interview-questions-and.html&quot;&gt;See here for more interview questions/brainteasers&lt;/a&gt;&lt;br /&gt;
</content><link rel='replies' type='application/atom+xml' href='http://iagtm.blogspot.com/feeds/4577419026727876827/comments/default' title='Post Comments'/><link rel='replies' type='text/html' href='http://iagtm.blogspot.com/2013/10/brainteaser-expected-number-of-trials.html#comment-form' title='0 Comments'/><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/5264419489096142546/posts/default/4577419026727876827'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/5264419489096142546/posts/default/4577419026727876827'/><link rel='alternate' type='text/html' href='http://iagtm.blogspot.com/2013/10/brainteaser-expected-number-of-trials.html' title='Brainteaser: Expected Number of Trials'/><author><name>ΣHΦ</name><uri>http://www.blogger.com/profile/08883576142863481302</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='16' height='16' src='https://img1.blogblog.com/img/b16-rounded.gif'/></author><thr:total>0</thr:total></entry><entry><id>tag:blogger.com,1999:blog-5264419489096142546.post-5624107194707428101</id><published>2013-09-17T23:14:00.001-07:00</published><updated>2013-09-18T03:47:11.059-07:00</updated><category scheme="http://www.blogger.com/atom/ns#" term="short notes"/><category scheme="http://www.blogger.com/atom/ns#" term="volatility"/><title type='text'>Correlation Trading</title><content type='html'>Correlation trading is something that hasn&#39;t yet been discussed on this blog. In principle, one can bet on the correlation(s) among &lt;i&gt;n&lt;/i&gt; assets of one&#39;s choice. However most commonly correlation trading is done on an index. In other words, you are betting on the correlation of the constituents of the index. You can approach a bank and ask them to quote the strike of a &lt;i&gt;correlation swap&lt;/i&gt; for you. Then you can sit back and let the bank worry about all the dirty hedging works.&lt;br /&gt;
&lt;br /&gt;
There are sound reasons &lt;i&gt;not &lt;/i&gt;to go down this route. First, what if you want to speculate on a basket that is not a common index? That may not be readily quotable at the bank. Secondly, the strike of the correlation swap quoted by the bank is likely to have a large spread buffer to compensate for the risk they take.&lt;br /&gt;
&lt;br /&gt;
An alternative is to proxy the correlation swap. The technique is generally known as &lt;i&gt;dispersion trading&lt;/i&gt;. It&#39;s a fancy name of long-shorting an index versus its components, or vice versa.&lt;br /&gt;
&lt;br /&gt;
&lt;u&gt;&lt;b&gt;Straddles&lt;/b&gt;&lt;/u&gt;&lt;br /&gt;
The most primitive way of dispersion trading is to long the index straddle and short the constituents straddles (this would be betting on the correlation among the constituents to go up). In this case, each of the straddles proxy the specific variances (of the index or of the constituents), and the long-short portfolio of straddles in turn proxies the correlation. Such a simplistic scheme would of course leave a lot to be desired (e.g. the need to rehedge, see &lt;a href=&quot;http://iagtm.blogspot.hk/2011/11/variance-swap-revisited-part-ii.html&quot; target=&quot;_blank&quot;&gt;here&lt;/a&gt;).&lt;br /&gt;
&lt;u&gt;&lt;b&gt;&lt;br /&gt;&lt;/b&gt;&lt;/u&gt;
&lt;u&gt;&lt;b&gt;Variance Swaps&lt;/b&gt;&lt;/u&gt;&lt;br /&gt;
Can we do better? Absolutely. It&#39;s almost a no-brainer: replace the straddles with &lt;a href=&quot;http://iagtm.blogspot.hk/2012/05/variance-swap-revisited-redux.html&quot; target=&quot;_blank&quot;&gt;variance swaps&lt;/a&gt;! So instead of longing the index straddle and shorting the constituents straddles, you long the index variance swap and short the constituents variance swaps to bet the correlation going up. Thanks to the characteristics of variance swaps, you don&#39;t have to worry about rehedging anymore. Sounds good, doesn&#39;t it? But there is still room for improvement. Although hedging is not necessary, the weights of the variance swaps have to be dynamically maintained. As an example, suppose our (value weighted) index &lt;i&gt;I &lt;/i&gt;has only two components &lt;i&gt;A&lt;/i&gt; and &lt;i&gt;B&lt;/i&gt;. Initially the the index is made up of 50% each of &lt;i&gt;A&lt;/i&gt; and &lt;i&gt;B&lt;/i&gt;. You try to trade correlation by longing $100 notional of variance swap on &lt;i&gt;I&lt;/i&gt; and shorting $50 notional of variance swaps on &lt;i&gt;A&lt;/i&gt; and &lt;i&gt;B&lt;/i&gt; each. Over time, the underlyings move and the weights of &lt;i&gt;A&lt;/i&gt; and &lt;i&gt;B&lt;/i&gt; become, say, 43% and 57% respectively. You&#39;d have to dynamically re-balance your variance swap portfolio to keep in line with the changing weights.&lt;br /&gt;
&lt;br /&gt;
&lt;b&gt;Note: The above discussion assumes a value weighted index.&lt;/b&gt;&lt;br /&gt;
&lt;br /&gt;
As a side note, the strike of the long index variance swap, short constituents variance swap portfolio would in general differ from a correlation swap quote. The reason is non-zero vol-of-vol. This &lt;a href=&quot;http://arxiv.org/pdf/1004.0125.pdf&quot; target=&quot;_blank&quot;&gt;paper&lt;/a&gt; gives an in-depth investigation into the matter.&lt;br /&gt;
&lt;br /&gt;
&lt;u&gt;&lt;b&gt;Gamma Swaps&lt;/b&gt;&lt;/u&gt;&lt;br /&gt;
Knowing the shortcoming of dispersion trading using variance swaps (i.e. the need for reallocation), what alternative do we have? We can use a kind of swap that &#39;scales&#39; itself according to the underlying level, a feature that is provided by gamma swaps. You long the index gamma swap and short the constituents gamma swaps to bet the correlation going up. Due to the structure of a gamma swap, your exposure to each index component would in fact automatically match the desired weightings as the underlyings change.&lt;br /&gt;
&lt;br /&gt;</content><link rel='replies' type='application/atom+xml' href='http://iagtm.blogspot.com/feeds/5624107194707428101/comments/default' title='Post Comments'/><link rel='replies' type='text/html' href='http://iagtm.blogspot.com/2013/09/correlation-trading.html#comment-form' title='0 Comments'/><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/5264419489096142546/posts/default/5624107194707428101'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/5264419489096142546/posts/default/5624107194707428101'/><link rel='alternate' type='text/html' href='http://iagtm.blogspot.com/2013/09/correlation-trading.html' title='Correlation Trading'/><author><name>ΣHΦ</name><uri>http://www.blogger.com/profile/08883576142863481302</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='16' height='16' src='https://img1.blogblog.com/img/b16-rounded.gif'/></author><thr:total>0</thr:total></entry><entry><id>tag:blogger.com,1999:blog-5264419489096142546.post-7568005390606034553</id><published>2013-09-16T02:39:00.005-07:00</published><updated>2013-09-16T17:48:49.003-07:00</updated><category scheme="http://www.blogger.com/atom/ns#" term="snack for thought"/><category scheme="http://www.blogger.com/atom/ns#" term="trading"/><category scheme="http://www.blogger.com/atom/ns#" term="Vanilla"/><title type='text'>Common Option Strategies: The Greeks</title><content type='html'>Naked, single option trading is not only risky, but also it is difficult to single out specific exposures. Hence option combo strategies are more common. But what strikes to choose? Hopefully this post would give you some hints.&lt;br /&gt;
&lt;br /&gt;
Assumptions:&lt;br /&gt;
- Volatility smile = $0.15 - 0.1\times (K-K_{ATM}) + 0.1 \times (K-K_{ATM})^2 $&lt;br /&gt;
- Sticky strike&lt;br /&gt;
- Flat volatility term structure&lt;br /&gt;
&lt;br /&gt;
Since $\Theta$ and Vega are similar to $\Gamma$, we skip presenting those. We are showing:&lt;br /&gt;
- Price&lt;br /&gt;
- Delta&lt;br /&gt;
- Gamma&lt;br /&gt;
- Vanna&lt;br /&gt;
- Volga&lt;br /&gt;
- Charm&lt;br /&gt;
- $ \frac {\partial}{\partial t} Vega$&lt;br /&gt;
&lt;br /&gt;
Note:&lt;br /&gt;
$Vanna&amp;nbsp; = \frac{\partial}{\partial S}&amp;nbsp;  \frac{\partial P}{\partial \sigma}$&lt;br /&gt;
$Volga&amp;nbsp; =&amp;nbsp;  \frac{\partial^2 P}{\partial \sigma^2}$&lt;br /&gt;
$Charm = \frac{\partial}{\partial S}&amp;nbsp;  \frac{\partial P}{\partial T}$&lt;br /&gt;
&lt;br /&gt;
&lt;b&gt;Strangle&lt;/b&gt;&lt;br /&gt;
&lt;div class=&quot;separator&quot; style=&quot;clear: both; text-align: center;&quot;&gt;
&lt;a href=&quot;https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEiSOV3xFozD4vIdReQwUHJzgqPpKRTZtleVmao3XWGkgeu1SR4wXwABaSRBBtpuFQbQAaxCk4YujT4cQPPG6qgdB9QkoTuM6WAsF3QiuehmW0MarQONGQdFA2r7FxHkgezXMDg3U02qli8O/s1600/optionStrat_strangle.png&quot; imageanchor=&quot;1&quot; style=&quot;margin-left: 1em; margin-right: 1em;&quot;&gt;&lt;img border=&quot;0&quot; height=&quot;197&quot; src=&quot;https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEiSOV3xFozD4vIdReQwUHJzgqPpKRTZtleVmao3XWGkgeu1SR4wXwABaSRBBtpuFQbQAaxCk4YujT4cQPPG6qgdB9QkoTuM6WAsF3QiuehmW0MarQONGQdFA2r7FxHkgezXMDg3U02qli8O/s320/optionStrat_strangle.png&quot; width=&quot;320&quot; /&gt;&lt;/a&gt;&lt;/div&gt;
&lt;br /&gt;
&lt;b&gt;Short Bear Spread&lt;/b&gt;&lt;br /&gt;
&lt;div class=&quot;separator&quot; style=&quot;clear: both; text-align: center;&quot;&gt;
&lt;a href=&quot;https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEhoCIng6mHl-rR-RkOy4VN9o5Zv-zgovlgOXSzk0ZU1hyphenhyphenwMGGHdFTSYWCzl-DOacW-CHYMVQFlmYNGgfrmt2d06RmrhNIFH8wCz5Hx8K-0dc2_B6W5tmTDu9UUboUjN_UnQmYGZavRoVJzP/s1600/optionStrat_shortBearSprd.png&quot; imageanchor=&quot;1&quot; style=&quot;margin-left: 1em; margin-right: 1em;&quot;&gt;&lt;img border=&quot;0&quot; height=&quot;199&quot; src=&quot;https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEhoCIng6mHl-rR-RkOy4VN9o5Zv-zgovlgOXSzk0ZU1hyphenhyphenwMGGHdFTSYWCzl-DOacW-CHYMVQFlmYNGgfrmt2d06RmrhNIFH8wCz5Hx8K-0dc2_B6W5tmTDu9UUboUjN_UnQmYGZavRoVJzP/s320/optionStrat_shortBearSprd.png&quot; width=&quot;320&quot; /&gt;&lt;/a&gt;&lt;/div&gt;
&lt;br /&gt;
&lt;b&gt;Back Spread&lt;/b&gt;&lt;br /&gt;
&lt;div class=&quot;separator&quot; style=&quot;clear: both; text-align: center;&quot;&gt;
&lt;a href=&quot;https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEjSGt26-XD56ldh9bFdyZciu3L1kBuNG-D2rcebF5nVm4DAwh-K95SmN2XvTpyBtJXeapvZR8DPHPbkkYclKJPTKIAomHMFrvrpTPbXq-Vml-_Xo7zf9clxV_4v8GCspwAX70DWJIg2O_RI/s1600/optionStrat_backSprdwCall.png&quot; imageanchor=&quot;1&quot; style=&quot;margin-left: 1em; margin-right: 1em;&quot;&gt;&lt;img border=&quot;0&quot; height=&quot;198&quot; src=&quot;https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEjSGt26-XD56ldh9bFdyZciu3L1kBuNG-D2rcebF5nVm4DAwh-K95SmN2XvTpyBtJXeapvZR8DPHPbkkYclKJPTKIAomHMFrvrpTPbXq-Vml-_Xo7zf9clxV_4v8GCspwAX70DWJIg2O_RI/s320/optionStrat_backSprdwCall.png&quot; width=&quot;320&quot; /&gt;&lt;/a&gt;&lt;/div&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;b&gt;Calendar Spread&lt;/b&gt;&lt;br /&gt;
&lt;div class=&quot;separator&quot; style=&quot;clear: both; text-align: center;&quot;&gt;
&lt;/div&gt;
&lt;div class=&quot;separator&quot; style=&quot;clear: both; text-align: center;&quot;&gt;
&lt;a href=&quot;https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEhJyaNUfMaU3PIIEsvF-62aGaiy57K0QtDPFAmfc5NqvrC823Mxbv68umq0QBQp6YgDrQznZ81nhMRyG43-Oi8jWhYxLIdSUw9XRIac4G8auE7F685cYqFLyzBDP6xmhpVgxrjhZ16EAJ7W/s1600/optionStrat_calSprdwCall.png&quot; imageanchor=&quot;1&quot; style=&quot;margin-left: 1em; margin-right: 1em;&quot;&gt;&lt;img border=&quot;0&quot; height=&quot;195&quot; src=&quot;https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEhJyaNUfMaU3PIIEsvF-62aGaiy57K0QtDPFAmfc5NqvrC823Mxbv68umq0QBQp6YgDrQznZ81nhMRyG43-Oi8jWhYxLIdSUw9XRIac4G8auE7F685cYqFLyzBDP6xmhpVgxrjhZ16EAJ7W/s320/optionStrat_calSprdwCall.png&quot; width=&quot;320&quot; /&gt;&lt;/a&gt;&lt;/div&gt;
&lt;br /&gt;
&lt;b&gt;Diagonal Spread&lt;/b&gt;&lt;br /&gt;
&lt;div class=&quot;separator&quot; style=&quot;clear: both; text-align: center;&quot;&gt;
&lt;/div&gt;
&lt;div class=&quot;separator&quot; style=&quot;clear: both; text-align: center;&quot;&gt;
&lt;a href=&quot;https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEjZGyEoT6xePLoZLhMUEKdVwtetwJh0Qiqh67drGrN5qksqQnZ5zOyIFWsHtIQEEqNXlrpA__pebKiaBPzEXihqoV57PSBQNqWXqLuYN2OsBPj_6cDVZCyljZFucBYQ9eXiFdFWHPMo-h9K/s1600/optionStrat_diagSprdwCall.png&quot; imageanchor=&quot;1&quot; style=&quot;margin-left: 1em; margin-right: 1em;&quot;&gt;&lt;img border=&quot;0&quot; height=&quot;196&quot; src=&quot;https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEjZGyEoT6xePLoZLhMUEKdVwtetwJh0Qiqh67drGrN5qksqQnZ5zOyIFWsHtIQEEqNXlrpA__pebKiaBPzEXihqoV57PSBQNqWXqLuYN2OsBPj_6cDVZCyljZFucBYQ9eXiFdFWHPMo-h9K/s320/optionStrat_diagSprdwCall.png&quot; width=&quot;320&quot; /&gt;&lt;/a&gt;&lt;/div&gt;
&lt;br /&gt;
&lt;b&gt;Butterfly&lt;/b&gt;&lt;br /&gt;
&lt;div class=&quot;separator&quot; style=&quot;clear: both; text-align: center;&quot;&gt;
&lt;a href=&quot;https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEiT1pMnUeng3Rn4YcLQlkeOEYZ1-6hbvJAHovwU87E72d_h6tHY9m7PAXXOvUjiLmOujWkUHP7IwSRhHPJH9s1YhXM02VE75D2peYOeUMSznNKHk2a4JmBIGkuiPQkzek5yPj6F3VwWLqI5/s1600/optionStrat_butterfly.png&quot; imageanchor=&quot;1&quot; style=&quot;margin-left: 1em; margin-right: 1em;&quot;&gt;&lt;img border=&quot;0&quot; height=&quot;196&quot; src=&quot;https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEiT1pMnUeng3Rn4YcLQlkeOEYZ1-6hbvJAHovwU87E72d_h6tHY9m7PAXXOvUjiLmOujWkUHP7IwSRhHPJH9s1YhXM02VE75D2peYOeUMSznNKHk2a4JmBIGkuiPQkzek5yPj6F3VwWLqI5/s320/optionStrat_butterfly.png&quot; width=&quot;320&quot; /&gt;&lt;/a&gt;&lt;/div&gt;
&lt;br /&gt;
&lt;b&gt;Broken Wing Butterfly&lt;/b&gt;&lt;br /&gt;
&lt;div class=&quot;separator&quot; style=&quot;clear: both; text-align: center;&quot;&gt;
&lt;a href=&quot;https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEiQ7L2_tlExB_7yBSBE0cyrNjD_C6vz7ULBNonmO8lASUhkgGq9nuzswke4hxfBxPA2y3Z_hdEGDDulJg1Wrcs6eTtE0hiIb6GqDYSO553dT1JTVg9bjpUy-DdXzVKa3JpXrfrlR-R3CgQo/s1600/optionStrat_brokenWingButterfly.png&quot; imageanchor=&quot;1&quot; style=&quot;margin-left: 1em; margin-right: 1em;&quot;&gt;&lt;img border=&quot;0&quot; height=&quot;196&quot; src=&quot;https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEiQ7L2_tlExB_7yBSBE0cyrNjD_C6vz7ULBNonmO8lASUhkgGq9nuzswke4hxfBxPA2y3Z_hdEGDDulJg1Wrcs6eTtE0hiIb6GqDYSO553dT1JTVg9bjpUy-DdXzVKa3JpXrfrlR-R3CgQo/s320/optionStrat_brokenWingButterfly.png&quot; width=&quot;320&quot; /&gt;&lt;/a&gt;&lt;/div&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;b&gt;Iron Condor&lt;/b&gt;&lt;br /&gt;
&lt;div class=&quot;separator&quot; style=&quot;clear: both; text-align: center;&quot;&gt;
&lt;a href=&quot;https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEjHRWA150BG279lQYWyZUvtdrEOh2VRlYlvU-VBAwlURVFGBPeAGo0SJHmBIT7iUQw0ilyyN1HYwJ6xpKw2NFm1ORMj0BZnA7NU98099PHk3Z0YwMbDCig1p-vLO2yoFnHzXzPBO53Xc8yr/s1600/optionStrat_ironCondor.png&quot; imageanchor=&quot;1&quot; style=&quot;margin-left: 1em; margin-right: 1em;&quot;&gt;&lt;img border=&quot;0&quot; height=&quot;197&quot; src=&quot;https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEjHRWA150BG279lQYWyZUvtdrEOh2VRlYlvU-VBAwlURVFGBPeAGo0SJHmBIT7iUQw0ilyyN1HYwJ6xpKw2NFm1ORMj0BZnA7NU98099PHk3Z0YwMbDCig1p-vLO2yoFnHzXzPBO53Xc8yr/s320/optionStrat_ironCondor.png&quot; width=&quot;320&quot; /&gt;&lt;/a&gt;&lt;/div&gt;
</content><link rel='replies' type='application/atom+xml' href='http://iagtm.blogspot.com/feeds/7568005390606034553/comments/default' title='Post Comments'/><link rel='replies' type='text/html' href='http://iagtm.blogspot.com/2013/09/common-option-strategies-greeks.html#comment-form' title='0 Comments'/><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/5264419489096142546/posts/default/7568005390606034553'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/5264419489096142546/posts/default/7568005390606034553'/><link rel='alternate' type='text/html' href='http://iagtm.blogspot.com/2013/09/common-option-strategies-greeks.html' title='Common Option Strategies: The Greeks'/><author><name>ΣHΦ</name><uri>http://www.blogger.com/profile/08883576142863481302</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='16' height='16' src='https://img1.blogblog.com/img/b16-rounded.gif'/></author><media:thumbnail xmlns:media="http://search.yahoo.com/mrss/" url="https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEiSOV3xFozD4vIdReQwUHJzgqPpKRTZtleVmao3XWGkgeu1SR4wXwABaSRBBtpuFQbQAaxCk4YujT4cQPPG6qgdB9QkoTuM6WAsF3QiuehmW0MarQONGQdFA2r7FxHkgezXMDg3U02qli8O/s72-c/optionStrat_strangle.png" height="72" width="72"/><thr:total>0</thr:total></entry><entry><id>tag:blogger.com,1999:blog-5264419489096142546.post-995254903810342770</id><published>2013-09-10T02:50:00.004-07:00</published><updated>2013-09-10T02:51:26.805-07:00</updated><category scheme="http://www.blogger.com/atom/ns#" term="short notes"/><category scheme="http://www.blogger.com/atom/ns#" term="stochastic calculus"/><category scheme="http://www.blogger.com/atom/ns#" term="volatility"/><title type='text'>Short Note: VIX Derivatives Pricing</title><content type='html'>- Lest it has not been emphasized enough in the previous &lt;a href=&quot;http://iagtm.blogspot.hk/2013/09/vix-futures-pricing.html&quot; target=&quot;_blank&quot;&gt;post&lt;/a&gt;, note that there is no straightforward no-arbitrage relationship to get VIX future price from sopt VIX.&lt;br /&gt;
&lt;br /&gt;
- Perhaps one day, the market would be so well-developed and liquidly-traded that we could have a &quot;&lt;i&gt;Volatility Market Model&lt;/i&gt;.&quot; Until then, we will have to rely on more modest approaches.&lt;br /&gt;
&lt;br /&gt;
- Why do people say that VIX options are priced off VIX future instead of 
spot? Well, for options on, say, FX or stock, there is no need to distinguish between pricing options off futures or spots 
because spot and future are strictly connected by no-arbitrage; for VIX, 
however, such connection is absent. If you start of with VIX spot, you first have to price the future contract before you can price the option. So it is better to directly use VIX future price as 
input when pricing option on VIX, so as to avoid &quot;an extra layer of error.&quot;&lt;br /&gt;
&lt;br /&gt;
-&amp;nbsp; Currently the different approaches of pricing VIX derivatives are:&lt;br /&gt;
&lt;b&gt;1. Modeling the instantaneous spot variance as a stochastic process&lt;/b&gt;&lt;br /&gt;
This is similar to modeling the short rate in interest rate derivatives pricing. Instantaneous spot variance, much like short rate, is neither observed nor tradable. Yet, they are rather well-studied and people are quite familiar with them, at least in the context of vanilla and exotic stock options. The idea is to pick your favorite model that describes the evolution of the instantaneous variance (say, Heston or 3/2 model). Calibrate it to the current volatility surface (considering VIX is a 30-day measure, you may want to calibrate only to the front and forthcoming month). Then use the calibrated parameters to price the VIX derivatives with numerical integration.&lt;br /&gt;
&lt;br /&gt;
&lt;b&gt;2. Modeling the instantaneous forward variance as a stochastic process&lt;/b&gt;&lt;br /&gt;
This is similar to the HJM framework in interest rate derivatives pricing. One example is the model proposed by Bergomi (see, for example, Bergomi&#39;s &lt;i&gt;Smile Dynamics&lt;/i&gt; series).&lt;br /&gt;
&lt;br /&gt;
&lt;b&gt;3. Modeling VIX itself as a stochastic process&lt;/b&gt;&lt;br /&gt;
This differs from the previous two cases in the sense that VIX itself, which is observed, is modeled as a stochastic process.&lt;br /&gt;
&lt;br /&gt;
&lt;b&gt;Bottom line:&lt;/b&gt;&lt;br /&gt;
In addition to calibration efficiency, one important desirable feature is for the model to fit to &lt;u&gt;both the SPX option prices and the VIX option prices&lt;/u&gt;.&lt;br /&gt;
&lt;b&gt;&lt;br /&gt;&lt;/b&gt;
&lt;b&gt;Reference&lt;/b&gt;&lt;br /&gt;
Mencía and Sentana, 2012, &lt;i&gt;Valuation of VIX Derivatives&lt;/i&gt;&lt;br /&gt;
&lt;a href=&quot;http://www.bde.es/f/webbde/SES/Secciones/Publicaciones/PublicacionesSeriadas/DocumentosTrabajo/12/Fich/dt1232e.pdf&quot;&gt;http://www.bde.es/f/webbde/SES/Secciones/Publicaciones/PublicacionesSeriadas/DocumentosTrabajo/12/Fich/dt1232e.pdf&lt;/a&gt;&lt;br /&gt;
&lt;span style=&quot;font-size: small;&quot;&gt;Wang and Daigler, 2008,&lt;i&gt; The Performance of VIX Options Pricing Models: Empirical Evidence Beyond Simulation &lt;/i&gt;&lt;/span&gt;&lt;br /&gt;
&lt;a href=&quot;http://www2.fiu.edu/~zwang001/Research/papers/VIX_Option_Pricing_FMA.pdf&quot;&gt;http://www2.fiu.edu/~zwang001/Research/papers/VIX_Option_Pricing_FMA.pdf&lt;/a&gt;&lt;br /&gt;
</content><link rel='replies' type='application/atom+xml' href='http://iagtm.blogspot.com/feeds/995254903810342770/comments/default' title='Post Comments'/><link rel='replies' type='text/html' href='http://iagtm.blogspot.com/2013/09/short-note-vix-derivatives-pricing.html#comment-form' title='0 Comments'/><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/5264419489096142546/posts/default/995254903810342770'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/5264419489096142546/posts/default/995254903810342770'/><link rel='alternate' type='text/html' href='http://iagtm.blogspot.com/2013/09/short-note-vix-derivatives-pricing.html' title='Short Note: VIX Derivatives Pricing'/><author><name>ΣHΦ</name><uri>http://www.blogger.com/profile/08883576142863481302</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='16' height='16' src='https://img1.blogblog.com/img/b16-rounded.gif'/></author><thr:total>0</thr:total></entry><entry><id>tag:blogger.com,1999:blog-5264419489096142546.post-5080347672884708813</id><published>2013-09-05T23:57:00.002-07:00</published><updated>2013-09-05T23:58:32.208-07:00</updated><category scheme="http://www.blogger.com/atom/ns#" term="Bookmark"/><category scheme="http://www.blogger.com/atom/ns#" term="short notes"/><category scheme="http://www.blogger.com/atom/ns#" term="stochastic calculus"/><category scheme="http://www.blogger.com/atom/ns#" term="volatility"/><title type='text'>VIX Futures Pricing</title><content type='html'>&lt;br /&gt;
Recently I came across &lt;a href=&quot;http://www.macroption.com/&quot; target=&quot;_blank&quot;&gt;a blog called macroption&lt;/a&gt;, which seems to carry some interesting materials.&amp;nbsp; &lt;br /&gt;
&lt;br /&gt;
The blogger specifically explains the difference between the &lt;i&gt;&lt;b&gt;term structure&lt;/b&gt;&lt;/i&gt; and &lt;i&gt;&lt;b&gt;futures curve&lt;/b&gt;&lt;/i&gt; of VIX, which can sometimes be confusing. To eliminate the ambiguity, we can use the full notation, with three arguments, to denote forward volatility: $ V(t,S,T) $ (which is similar to the full notation of LIBOR). $ V(t,S,T) $ is, of course, the forward $T-S$ day volatility starting at a future time $S$ as observed at time $t$. With this in mind, the &lt;i&gt;&lt;b&gt;term structure&lt;/b&gt;&lt;/i&gt; of VIX would be a graph of $V(0,0,T)$ against $T$; while the &lt;i&gt;&lt;b&gt;futures curve&lt;/b&gt;&lt;/i&gt; of VIX would be a graph of $V(0,S,S+\delta)$ against $S$ ($\delta$ in this case would be 30 days).&lt;br /&gt;
&lt;br /&gt;
Now that we have clarified the notation, let&#39;s talk about VIX futures pricing and how convexity plays a role. $VIX^2$ is the fair strike of a variance swap, which can be replicated using vanillas in a model-independent manner (recap &lt;a href=&quot;http://iagtm.blogspot.hk/2012/05/variance-swap-revisited-redux.html&quot; target=&quot;_blank&quot;&gt;here&lt;/a&gt;). To express it in terms of expectation, we can write&lt;br /&gt;
&lt;br /&gt;
$$ VIX_0^2 = E^Q_0[V(0,0,30)] $$&lt;br /&gt;
&lt;br /&gt;
However, the VIX index and hence its related derivatives (futures and options) are quoted not in $VIX^2$ terms, but simply in $VIX$ itself (in other words, as we see that VIX is at 14.5, the fair strike of a variance swap is 0.145 * 0.145 = 0.021). If we consider a future contract, in general if the underlying is commodities, FX or stocks we can simply apply the no-arbitrage rule and arrive at the future price using the appropriate funding/dividend/storage/convenience yields. However, these simply don&#39;t exist for VIX, which is not a tradable entity. So, we have to rely on&lt;br /&gt;
&lt;br /&gt;
$$ F(0,T) = E^Q_0[\sqrt{VIX_T^2}] \neq \sqrt{E^Q_0[VIX_T^2]}$$&lt;br /&gt;
&lt;br /&gt;
This is where the convexity adjustment comes in (in fact it should be a &#39;concavity adjustment&#39;, as the square root function $\sqrt{x}$ is concave in $x$). We can approximate the future price as&lt;br /&gt;
&lt;br /&gt;
$$ F(0,T) \approx \sqrt{E^Q_0[VIX_T^2]} - \frac{var^Q_0[VIX_T^2]}{8[E^Q_0[VIX_T^2]]^{2/3}}$$&lt;br /&gt;
&lt;br /&gt;
(see, for example, Zhu and Lian,&amp;nbsp; An Analytical Formula for VIX Futures and its Applications, 2010) The negative sign of the higher order correction term clearly shows concavity.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;</content><link rel='replies' type='application/atom+xml' href='http://iagtm.blogspot.com/feeds/5080347672884708813/comments/default' title='Post Comments'/><link rel='replies' type='text/html' href='http://iagtm.blogspot.com/2013/09/vix-futures-pricing.html#comment-form' title='0 Comments'/><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/5264419489096142546/posts/default/5080347672884708813'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/5264419489096142546/posts/default/5080347672884708813'/><link rel='alternate' type='text/html' href='http://iagtm.blogspot.com/2013/09/vix-futures-pricing.html' title='VIX Futures Pricing'/><author><name>ΣHΦ</name><uri>http://www.blogger.com/profile/08883576142863481302</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='16' height='16' src='https://img1.blogblog.com/img/b16-rounded.gif'/></author><thr:total>0</thr:total></entry><entry><id>tag:blogger.com,1999:blog-5264419489096142546.post-6494967560164768150</id><published>2013-08-29T01:14:00.002-07:00</published><updated>2013-08-29T01:14:39.233-07:00</updated><category scheme="http://www.blogger.com/atom/ns#" term="Bookmark"/><title type='text'>Life on the Trading Floor</title><content type='html'>Interesting read for those who want to learn more about how things are on the trading floor (even though a bit dated).&lt;br /&gt;
&lt;br /&gt;
&lt;a href=&quot;http://www.trade2win.com/articles/752-day-life-forex-spot-desk-trader-part-1-a&quot;&gt;http://www.trade2win.com/articles/752-day-life-forex-spot-desk-trader-part-1-a&lt;/a&gt;&lt;br /&gt;
&lt;a href=&quot;http://www.trade2win.com/articles/754-day-life-forex-spot-desk-trader-part-2-a&quot;&gt;http://www.trade2win.com/articles/754-day-life-forex-spot-desk-trader-part-2-a&lt;/a&gt;&lt;br /&gt;
&lt;br /&gt;</content><link rel='replies' type='application/atom+xml' href='http://iagtm.blogspot.com/feeds/6494967560164768150/comments/default' title='Post Comments'/><link rel='replies' type='text/html' href='http://iagtm.blogspot.com/2013/08/life-on-trading-floor.html#comment-form' title='0 Comments'/><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/5264419489096142546/posts/default/6494967560164768150'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/5264419489096142546/posts/default/6494967560164768150'/><link rel='alternate' type='text/html' href='http://iagtm.blogspot.com/2013/08/life-on-trading-floor.html' title='Life on the Trading Floor'/><author><name>ΣHΦ</name><uri>http://www.blogger.com/profile/08883576142863481302</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='16' height='16' src='https://img1.blogblog.com/img/b16-rounded.gif'/></author><thr:total>0</thr:total></entry><entry><id>tag:blogger.com,1999:blog-5264419489096142546.post-4121756516349092538</id><published>2013-08-01T05:09:00.001-07:00</published><updated>2014-03-09T01:37:37.505-08:00</updated><category scheme="http://www.blogger.com/atom/ns#" term="Bookmark"/><category scheme="http://www.blogger.com/atom/ns#" term="Just for fun"/><category scheme="http://www.blogger.com/atom/ns#" term="short notes"/><title type='text'>MathJax</title><content type='html'>This is just to try out the cool things that are made possible by &lt;a href=&quot;http://www.mathjax.org/&quot; target=&quot;_blank&quot;&gt;MathJax&lt;/a&gt;. To enable it in Blogger, follow the instructions &lt;a href=&quot;http://blog.mlin.net/2013/05/testing-mathjax-on-blogger.html&quot; target=&quot;_blank&quot;&gt;here&lt;/a&gt; and &lt;a href=&quot;http://irrep.blogspot.hk/2011/07/mathjax-in-blogger-ii.html&quot; target=&quot;_blank&quot;&gt;here&lt;/a&gt;.&lt;br /&gt;
&lt;br /&gt;
&lt;u&gt;&lt;b&gt;Schrodinger Equation&lt;/b&gt;&lt;/u&gt;&lt;br /&gt;
$$ i \hbar \frac {\partial } {\partial t} \Psi = \hat{H} \Psi $$&lt;br /&gt;
&lt;br /&gt;
&lt;u&gt;&lt;b&gt;Black-Scholes Call Price&lt;/b&gt;&lt;/u&gt;&lt;br /&gt;
$$ C = e^{-d \tau} S N (d_1) - e^{-r \tau} K N(d_2)$$&lt;br /&gt;
&lt;br /&gt;
&lt;b&gt;&lt;u&gt;Fourier Transform&lt;/u&gt;&lt;/b&gt;&lt;br /&gt;
$$ \hat{f} (k) = \int^{+\infty}_{-\infty} f(x) e^{-2 \pi i k x} dx $$&lt;br /&gt;
&lt;br /&gt;
It also supports inline equations (e.g. $ E = m c ^2$). No more excuse to avoid typing up some nice formulae!&lt;br /&gt;
&lt;br /&gt;</content><link rel='replies' type='application/atom+xml' href='http://iagtm.blogspot.com/feeds/4121756516349092538/comments/default' title='Post Comments'/><link rel='replies' type='text/html' href='http://iagtm.blogspot.com/2013/08/mathjax.html#comment-form' title='0 Comments'/><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/5264419489096142546/posts/default/4121756516349092538'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/5264419489096142546/posts/default/4121756516349092538'/><link rel='alternate' type='text/html' href='http://iagtm.blogspot.com/2013/08/mathjax.html' title='MathJax'/><author><name>ΣHΦ</name><uri>http://www.blogger.com/profile/08883576142863481302</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='16' height='16' src='https://img1.blogblog.com/img/b16-rounded.gif'/></author><thr:total>0</thr:total></entry><entry><id>tag:blogger.com,1999:blog-5264419489096142546.post-42198888228824094</id><published>2013-07-31T00:15:00.001-07:00</published><updated>2013-07-31T00:17:21.221-07:00</updated><category scheme="http://www.blogger.com/atom/ns#" term="trading"/><category scheme="http://www.blogger.com/atom/ns#" term="volatility"/><title type='text'>A Follow-up on &quot;A Volatiltiy Trading Strategy That is (Almost) Too Good to be True&quot;</title><content type='html'>This is a follow-up on &lt;a href=&quot;http://iagtm.blogspot.hk/2013/05/a-volatiltiy-trading-strategy-that-is.html&quot; target=&quot;_blank&quot;&gt;the previous post&lt;/a&gt;. As I mentioned, backtest shows that the VIX term structure based strategy has faltered since late 2010. The strategy has seemingly lost its magic between late 2010 and late 2012, as reflected in the fluctuating backtest balance. What is interesting is perhaps that starting from late 2012, &quot;&lt;i&gt;doing the opposite&lt;/i&gt;&quot; seems to be a working strategy:&lt;br /&gt;
&lt;div class=&quot;separator&quot; style=&quot;clear: both; text-align: center;&quot;&gt;
&lt;/div&gt;
&lt;br /&gt;
&lt;div class=&quot;separator&quot; style=&quot;clear: both; text-align: center;&quot;&gt;
&lt;a href=&quot;https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEgjRbDUTYkgkILmqrtKzXzTR6Ju1RpU8KfLpDIPa2hyphenhyphenZVxA8tQrSpGVWbq7EESGYBIOlCPbS-GRYJWpH_h01-DYHOIUS1n5Ydwfk1geVbnTCuE0OpLj1c0Lcp0T0Ioni-ruvKTbyFMRRnG6/s1600/4oppo.jpg&quot; imageanchor=&quot;1&quot; style=&quot;margin-left: 1em; margin-right: 1em;&quot;&gt;&lt;img border=&quot;0&quot; height=&quot;240&quot; src=&quot;https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEgjRbDUTYkgkILmqrtKzXzTR6Ju1RpU8KfLpDIPa2hyphenhyphenZVxA8tQrSpGVWbq7EESGYBIOlCPbS-GRYJWpH_h01-DYHOIUS1n5Ydwfk1geVbnTCuE0OpLj1c0Lcp0T0Ioni-ruvKTbyFMRRnG6/s320/4oppo.jpg&quot; width=&quot;320&quot; /&gt;&lt;/a&gt;&lt;/div&gt;
&lt;br /&gt;
Recall that in the original strategy, we &lt;span style=&quot;color: red;&quot;&gt;hold VXX when recent realized vol is greater than VIX; hold XIV when recent realized vol is less than VIX&lt;/span&gt;. So the opposite strategy would be to &lt;span style=&quot;color: red;&quot;&gt;hold XIV when recent realized vol is greater than VIX; hold VXX when recent realized vol is less than VIX&lt;/span&gt;. Of course, looking at backtest results in this manner is bordering data-snooping, but it does get us thinking: what kind of regime change has occurred in the volatility market since the end of 2012? When would it flip back again?&lt;br /&gt;
&lt;br /&gt;</content><link rel='replies' type='application/atom+xml' href='http://iagtm.blogspot.com/feeds/42198888228824094/comments/default' title='Post Comments'/><link rel='replies' type='text/html' href='http://iagtm.blogspot.com/2013/07/a-follow-up-on-volatiltiy-trading.html#comment-form' title='0 Comments'/><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/5264419489096142546/posts/default/42198888228824094'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/5264419489096142546/posts/default/42198888228824094'/><link rel='alternate' type='text/html' href='http://iagtm.blogspot.com/2013/07/a-follow-up-on-volatiltiy-trading.html' title='A Follow-up on &quot;A Volatiltiy Trading Strategy That is (Almost) Too Good to be True&quot;'/><author><name>ΣHΦ</name><uri>http://www.blogger.com/profile/08883576142863481302</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='16' height='16' src='https://img1.blogblog.com/img/b16-rounded.gif'/></author><media:thumbnail xmlns:media="http://search.yahoo.com/mrss/" url="https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEgjRbDUTYkgkILmqrtKzXzTR6Ju1RpU8KfLpDIPa2hyphenhyphenZVxA8tQrSpGVWbq7EESGYBIOlCPbS-GRYJWpH_h01-DYHOIUS1n5Ydwfk1geVbnTCuE0OpLj1c0Lcp0T0Ioni-ruvKTbyFMRRnG6/s72-c/4oppo.jpg" height="72" width="72"/><thr:total>0</thr:total></entry></feed>