Question

1. Consider a tennis match with 3 sets (just like in the lecture slides "Non recursive Dynamic Programming"). The first player to win 2 sets wins the match. Let the probability of winning a set be 0.5 The winner of the match gets $20, and the loser pays $20 Is this game recursive? a. Draw the game tree. Clearly show the players, strategies, and payoffs. b. What is the value of the game in the state 1-12 d. What is the value of the entire game? e. What is the probability of: Winning the match ii. Winning the match after losing the first set

Someone help please? URGENT

Answer 1

poe. e even to A tennis motch ith 3 sets (Just lice in the lectare sides "Non recursive DHamic P<oR* udins te match er -to urn 2 babil * The inne oh match 20. ond lose* 20 > ue devivi aur Yes, tte aame is recursive. Douo tthe Siouo the ers Talentes , and plauer -1 coins

the stake L-4 ? uohal % the value ot the ame in the e uohere the bot have toon one geS Par that i* the value % -the entire g*? 5 inoinq the match pro bability 어 uinni mci - it at and « rn and 3

0-60 Sub sinninq the match oes osing s losinq the rst set JD, winning th a set nd set)+ 5 o.35 o. 85