Earlier quoted context omitted.
Do you have experience interviewing candidates? Many candidates will answer this question correctly and yet be totally unable to do anything when they're confronted with a non textbook case. To be clear the brain teasers I ask are mathematical problems, not the type of brain teasers used in consulting interviews. For instance: We play a game where we each draw a secret random number uniformly between 0 and 1. We each…
Ok, I'm stumped. If I've parsed your description correctly, we get no info about our opponent's actions or the results until the end. Absent any ability to observe their strategy, it seems like you do want to maximize for expected value of your own actions, and I'm curious about the counterexample. How do we maximize EV? A single throw's pdf is 1, for x in [0,1], so its EV is 0.5. The question is how to improve on a…
How to Get a Quant Job in Finance
131–140 of 143 posts
Re: How to Get a Quant Job in Finance
#132Earlier quoted context omitted.
Do you have experience interviewing candidates? Many candidates will answer this question correctly and yet be totally unable to do anything when they're confronted with a non textbook case. To be clear the brain teasers I ask are mathematical problems, not the type of brain teasers used in consulting interviews. For instance: We play a game where we each draw a secret random number uniformly between 0 and 1. We each…
hey murbard is the answer to this 1-goldenratio? (.618...) to get this I computed the function f(x,y) which is my expected value if I reroll if roll <= x and my opponent re-rerolls if roll <= y. let p be the optimal value. by symmetry f(p,p) = 0.5 so there must be a local minimum around that point. solving by taking a one sided derivative gives me (sqrt(5)-1)/2
(to be thorough, you also need to show that re-rolling based on a single threshold dominates other strategies, but it's fairly intuitive and not too hard to prove)
Re: How to Get a Quant Job in Finance
#133Earlier quoted context omitted.
Do you have experience interviewing candidates? Many candidates will answer this question correctly and yet be totally unable to do anything when they're confronted with a non textbook case. To be clear the brain teasers I ask are mathematical problems, not the type of brain teasers used in consulting interviews. For instance: We play a game where we each draw a secret random number uniformly between 0 and 1. We each…
I wouldn't describe this as a brainteaser. It's a well-defined math problem, not some BS question about manhole covers or barbers in Chicago.
Re: How to Get a Quant Job in Finance
#134Earlier quoted context omitted.
Ok, I'm stumped. If I've parsed your description correctly, we get no info about our opponent's actions or the results until the end. Absent any ability to observe their strategy, it seems like you do want to maximize for expected value of your own actions, and I'm curious about the counterexample. How do we maximize EV? A single throw's pdf is 1, for x in [0,1], so its EV is 0.5. The question is how to improve on a…
I don't really get it either, but I think the idea is that you're supposed to somehow optimize on the assumption that your opponent is equally likely to be using any strategy. (To my mind this makes the problem very confusing because it's such an unrealistic assumption.) If you assume that the only possible strategies are "rethrow if my first throw is <= x", then you can define a function f(x,y) giving the EV where x…
Imagine we play a die game where whoever rolls the largest number wins. Which die would you rather play with?
1-1-1-1-1-10^250 or 2-2-2-2-2-2
The first die has an EV of about 1.67e249, the second die an EV of 2. Yet, the second die will win 5 out of 6 games against the other one.
To solve the problem, you must find the Nash equilibrium of the game. That is, you must find a strategy which the opponent cannot exploit, no matter what he does.
Re: How to Get a Quant Job in Finance
#135Earlier quoted context omitted.
Ok, I'm stumped. If I've parsed your description correctly, we get no info about our opponent's actions or the results until the end. Absent any ability to observe their strategy, it seems like you do want to maximize for expected value of your own actions, and I'm curious about the counterexample. How do we maximize EV? A single throw's pdf is 1, for x in [0,1], so its EV is 0.5. The question is how to improve on a…
I don't really get it either, but I think the idea is that you're supposed to somehow optimize on the assumption that your opponent is equally likely to be using any strategy. (To my mind this makes the problem very confusing because it's such an unrealistic assumption.) If you assume that the only possible strategies are "rethrow if my first throw is <= x", then you can define a function f(x,y) giving the EV where x…
Re: How to Get a Quant Job in Finance
#136Earlier quoted context omitted.
Do you have experience interviewing candidates? Many candidates will answer this question correctly and yet be totally unable to do anything when they're confronted with a non textbook case. To be clear the brain teasers I ask are mathematical problems, not the type of brain teasers used in consulting interviews. For instance: We play a game where we each draw a secret random number uniformly between 0 and 1. We each…
I haven't read up on game theory in a long time, does "best strategy to follow" mean "the strategy that maximizes my expected payoff for all the strategies my opponent could employ"? So, an explicit counterexample would be my opponent picking a strategy of only re-throwing above .25. His expectation is then .25 * (0 + .25)/2 + .75 * (0 + 1)/2 ~= .40, so I should not rethrow if I get above .40 and below .50, even thou…
Re: How to Get a Quant Job in Finance
#137Earlier quoted context omitted.
I don't really get it either, but I think the idea is that you're supposed to somehow optimize on the assumption that your opponent is equally likely to be using any strategy. (To my mind this makes the problem very confusing because it's such an unrealistic assumption.) If you assume that the only possible strategies are "rethrow if my first throw is <= x", then you can define a function f(x,y) giving the EV where x…
And no, you don't assume that every strategy is equally likely. You assume that the opponent plays optimally with full knowledge of your own strategy, which means you're looking for a Nash equilibrium http://en.wikipedia.org/wiki/Nash_equilibrium
Re: How to Get a Quant Job in Finance
#138Earlier quoted context omitted.
And no, you don't assume that every strategy is equally likely. You assume that the opponent plays optimally with full knowledge of your own strategy, which means you're looking for a Nash equilibrium http://en.wikipedia.org/wiki/Nash_equilibrium
That's fine if you already know game theory, but then the problem is not quite as accessible as you made out. You can't expect someone to just invent the concept of a Nash Equilibrium on the spot from the words "best strategy". (Although I understand that you may expect your interviewees to already be familiar with game theory.)
Nash's brilliance was in proving that under reasonable conditions, a mixed equilibrium always exists, which is far less obvious.
Re: How to Get a Quant Job in Finance
#139Earlier quoted context omitted.
That's fine if you already know game theory, but then the problem is not quite as accessible as you made out. You can't expect someone to just invent the concept of a Nash Equilibrium on the spot from the words "best strategy". (Although I understand that you may expect your interviewees to already be familiar with game theory.)
In this case, the candidate's thesis work explicitly dealt with game theory. In addition, this doesn't require much knowledge of game theory... if you think about the problem for a bit, you can re-derive the concept fairly easily. Nash's brilliance was in proving that under reasonable conditions, a mixed equilibrium always exists, which is far less obvious.
Re: How to Get a Quant Job in Finance
#140Earlier quoted context omitted.
In this case, the candidate's thesis work explicitly dealt with game theory. In addition, this doesn't require much knowledge of game theory... if you think about the problem for a bit, you can re-derive the concept fairly easily. Nash's brilliance was in proving that under reasonable conditions, a mixed equilibrium always exists, which is far less obvious.
The issue isn't the difficulty of the concept but the ambiguity of "best strategy".