The problem is : http://domino.research.ibm.com/Comm/wwwr_ponder.nsf/challenges/February2006.html The solution to it is: http://domino.research.ibm.com/Comm/wwwr_ponder.nsf/solutions/February2006.html
The first problem is that, althougth the hypothesis of player 2's strategy is reasonable( when y is greater than a fixed p, he will call; or else he will fold ). But how to prove it? Why is there no any better strategy. Another doubt about the solution is in the last paragraph of the solution. There are statements as "The nit is easy to see that if the first player bets the second player should fold if y<.1, is in different between calling and folding for.1<y<.7 and should call when y>.7. " . I don't agree them. Following the solution, player 1 betting means that x<.1 or x>.7, which means that the opportunity of x<.1 is 1/4 and that of x>.7 is 3/4. If y<.1, then player 2 has the opportunity of 1/2*.1/(.1+.3)=1/8 to win; If .1<y<.7, then he has the opportunity of .1/(.1+.3)=1/4 to win; If y>.7, the has has opportunity .1/(.1+.3)+1/2*.3/(.1+.3)=5/8. So only when y>.7, player 2 should call, but this is inconsistent with the solution, say, when y>.4, player 2 should call. --~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to [email protected] To unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/algogeeks -~----------~----~----~----~------~----~------~--~---
