October 2007 Archives

Kelly criterion

| | No TrackBacks

[HDB 2008-06-04] This text is lifted from some website and I can't remember where.

For those who are interested in the theory, here are the mathematical steps I used to generalize the above problem.

Let's define some variables:

F = % of your bankroll that you invest in A
W1 = ROI of Product 1 = 30%
W2 = ROI of Product 2 = 10%
W3 = ROI of Product 3 = 12%
W4 = ROI of No Products Launching = -15%
P1 = Probability of Product 1 Launching
P2 = Probability of Product 2 Launching
P3 = Probability of Product 3 Launching
P4 = Probability of No Product Launching
B = Initial Bankroll
B' = Future Bankroll after N such investments
M = The Geometric Mean of N such investments

Using the above infomation, we can formulate:

B' = B * (1 + W1*F)^(P1*N) * 
    (1 + W2*F)^(P2*N) * 
    (1 + W3*F)^(P3*N) * 
    (1 + W4*F)^(P4*N)

M^N = B'/B = (1 + W1*F)^(P1*N) * 
    (1 + W2*F)^(P2*N) * 
    (1 + W3*F)^(P3*N) * 
    (1 + W4*F)^(P4*N)
M = [(1 + W1*F)^(P1*N) * 
    (1 + W2 * F)^(P2*N) * 
    (1 + W3*F)^(P3*N) * 
    (1 + W4*F)^(P4*N)]^(1/N)
M = (1 + W1*F)^(P1) * 
    (1 + W2*F)^(P2) * 
    (1 + W3*F)^(P3) * 
    (1 + W4*F)^(P4)

Therefore, to maximize the geometric return M, we need to find F such that the Product Sum of (1+Wi*F)^Pi for all i is maximized. Unfortunately, there is no simple formula that can compute the Kelly Criterion for multiple possible outcomes. Fortunately, with the aid of computer, I constructed an optimization model that will find the Kelly Criterion for you.

Using the Credential Management API

| | No TrackBacks
[Using the Credential Management API]
CredUIPromptForCredentials Win32 function

Dynamic DNS service

| | No TrackBacks

Selected top 100 links from PC Magazine

| | No TrackBacks

A New Generation of Swing Kids

| | No TrackBacks

The NY Sun article on swing dance in NYC, with photos from the Central Park event on 30 Sep 2007. Lori and I would have been at that event but we decided to go to the hospital instead to take care of my sprained ankle.

Find people on Internet

| | No TrackBacks

If you are looking for someone on the web, the best places to look are google, FaceBook, LinkedIn, and ZabaSearch. The most valuable personal facts to narrow your search are:

  • any previous address
  • date of birth
  • middle name
  • education
I used all of these to track down classmates for my 25th high school reunion.


[ZabaSearch]
[Yahoo]
[WhoWhere]
[SwitchBoard]
[DogPile]
[AnyWho]
[AllTheWeb]
[A9]
[PeopleSearch]
[SuperPages]
[PeopleFinders]
[WhitePages]
[TheUltimates]
[Canada 411]
[Addresses.com]
[IAF.net]

Front ends for intelius
[Pretrieve]
[ThePublicRecords]
[BackgroundRecordFinder]
[PublicRecordFinder]

Pages

OpenID accepted here Learn more about OpenID
Powered by Movable Type 4.32-en

About this Archive

This page is an archive of entries from October 2007 listed from newest to oldest.

September 2007 is the previous archive.

November 2007 is the next archive.

Find recent content on the main index or look in the archives to find all content.