SERVING THE QUANTITATIVE FINANCE COMMUNITY

Search found 2 matches

by colorfish
July 5th, 2012, 4:43 pm
Forum: Brainteaser Forum
Topic: Clearing
Replies: 4
Views: 14516

Clearing

<t>Another solution is to use dynamic programming.Denote Bi as the $ of the i-th borrower, Lj as the $ of the j-th lender. Further denote f([B1, B2, ..., Bn], [L1, L2, ... Lm]) as the function evaluating the minimum number of "links" among the n borrowers and the m lenders.The recursive relationship...
by colorfish
July 5th, 2012, 4:22 pm
Forum: Brainteaser Forum
Topic: an interview question, the probability of picking a seat randomly in a stadium
Replies: 12
Views: 21252

an interview question, the probability of picking a seat randomly in a stadium

<t>I think both are 1/1000. Similar to the "Monty Hall" problem, the probability of getting the prize does not change after the host deliberately removed one loser, which is 1/3. However, in "Monty Hall", you can choose to switch; hence, if you choose a loser at the beginning, you will win the prize...
GZIP: On