pull down to refresh

Close, but not quite correct in terms of a Nash equilibrium. Because if two of the males had, say, equal attractiveness, and both decided to go for the blonde, they'd block each other and it wouldn't be Nash. One of them would be better off going for the brunette first, rather than blocking each other.
So one should consider a choice based on one's probability of being successful rather than have a fixed and definite choice? Using these odds, sometimes going for the blonde, sometimes not. This should resolve the problem if two males have an equal level of attractiveness, no?
This is correct enough. In the end, they will randomize. To be fully exhaustive, there are actually Nash equilibria!
  • . Three of the guys go for the blonde's friends, one guy goes for the blonde.
  • . Two of the guys go for the blonde's friends. Two of the guys randomize over the blonde.
  • . One of the guys goes for the blonde's friends. Three of the guys randomize over the blonde.
  • . All of the guys randomize over the blonde.
The exact probabilities in each equilibrium depend on the relative utilities of the blonde, her friends, and getting no one.
reply
Thanks for formalizing it and hinting me in the right direction. And thanks for the sats :)
EDIT: so, (4+6+4+1=)15 equilibria?
reply
so, (4+6+4+1=)15 equilibria?
That should be correct, assuming all the males are actually identical. If they have different preferences, or if the blonde may select one over another when there's a conflict, then the solutions could change.
Fun fact: The number of Nash equilibria, including randomized ones, which we call "mixed strategies", is always odd.
reply