Hacker News Board Hacker News, browsed like a classic message board
Live data from Hacker News

Investor Day

blog.ycombinator.com

Post reply on HN
Print view View original

11–20 of 92 posts

Re: Investor Day

#11

Post by Finbarr »

a-priori wrote: post #9
sappapp wrote: post #5

Earlier quoted context omitted.

I assume so as well. This algorithm is outlined by the stable marriage problem for those that are interested.

It's not quite the stable marriage problem, because in the stable marriage problem you're trying to find an optimal 1:1 pairing. It's also not the NRMP problem because in that case, residents are only matched with one hospital in a year. Here companies are matched with multiple investors, and investors are matched with multiple companies. But regardless, I believe the algorithm is roughly the same as the NRMP algorit…

Yes you are on the money. There are also some additional constraints, e.g., we don't want to match startups with multiple investors from the same fund.

Re: Investor Day

#12

Post by tdstein »

BinaryIdiot wrote: post #10

Seems like a solid idea. I honestly thought something like this was already in place so it makes sense. Still though the first thing I thought of is what it might feel like to be part of the statistic few who get zero investors clicking the button (I mean statistically this should happen at least a couple of times due to the batch size, right? Or am I severely underestimating the amount of investors that attempts do…

Yes if investors are not forced to meet with X number of startups

Re: Investor Day

#15

Post by Finbarr »

sachinag wrote: post #2

I assume this is using the same or similar algorithm as the NRMP algorithm uses for U.S. residency match day?

Very close. It's many:many with multiple iterations until a stable solution is found.

Re: Investor Day

#16

Post by tdstein »

a-priori wrote: post #9
sappapp wrote: post #5

Earlier quoted context omitted.

I assume so as well. This algorithm is outlined by the stable marriage problem for those that are interested.

It's not quite the stable marriage problem, because in the stable marriage problem you're trying to find an optimal 1:1 pairing. It's also not the NRMP problem because in that case, residents are only matched with one hospital in a year. Here companies are matched with multiple investors, and investors are matched with multiple companies. But regardless, I believe the algorithm is roughly the same as the NRMP algorit…

In the NRMP there is a N:1 matching between residents and hospitals, where N If the meetings are time sliced, let's say by hour, then run the algorithm for each time slice.

Re: Investor Day

#17

Post by Finbarr »

BinaryIdiot wrote: post #10

Seems like a solid idea. I honestly thought something like this was already in place so it makes sense. Still though the first thing I thought of is what it might feel like to be part of the statistic few who get zero investors clicking the button (I mean statistically this should happen at least a couple of times due to the batch size, right? Or am I severely underestimating the amount of investors that attempts do…

There are a lot more investors attending demo day than startups so this is not likely to be an issue for the companies.

Re: Investor Day

#18

Post by pc86 »

BinaryIdiot wrote: post #10

Seems like a solid idea. I honestly thought something like this was already in place so it makes sense. Still though the first thing I thought of is what it might feel like to be part of the statistic few who get zero investors clicking the button (I mean statistically this should happen at least a couple of times due to the batch size, right? Or am I severely underestimating the amount of investors that attempts do…

If you can't get a single investor to give you 20 minutes after Demo Day you've got much bigger problems.

Re: Investor Day

#20

Post by sachinag »

Finbarr wrote: post #15
sachinag wrote: post #2

I assume this is using the same or similar algorithm as the NRMP algorithm uses for U.S. residency match day?

Very close. It's many:many with multiple iterations until a stable solution is found.

Could you write up the differences? I'd really enjoy reading that.
Post reply on HN