The first player to win 2 sets is the winner of a tennis match. Suppose that whatever happened in the previous sets, each player has probability 1/3 of winning the next set. A)Determine the expected number of sets played.B)how about if now change to be first player to win 3 sets is the winner of a tennis match?
let x are the number of sets played
P(X=2)=P(first player wins first 2 sets)+P(second player wins first 2 sets)=(0.5*0.5)+(0.5*0.5)=0.50
P(X=3)=1-P(X=2)=1-0.5 =0.5
therefore expected number of sets played =xP(x)=0.5*2+0.5*3 =2.5
The first player to win 2 sets is the winner of a tennis match. Suppose that whatever happened in...
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. b. Draw the game tree. Clearly show the players, strategies, and payoffs. What is the value of the game in the state 1-1? c. d. What...
Someone help please? URGENT 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...
can someone respond, third time asking 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...
Font Paragraph 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. a. Is this game recursive? Draw the game tree. Clearly show the players, strategies, and payoffs. b. What is the value of the game in the state 1-12 c....
Question 1 (1 polnt) The following Information applies to questions 1 through 5. Consider a tennis match with 3 sets. The first player to win 2 sets wins the match. Let the probability of Player 1 winning a set be 0.7. The winner of the match gets $100, and the loser get nothing. Hint: draw the game tree will help answer the following questions. 1. This game is an example of a Simultaneous game in pure strategies Recursive Dynamic Progranm...
Problem 3. In the game of tennis, the first player to win four points wins the game as long as the winner's total is at least two points more than the opponent. Thus if the game is tied at 3-3(Deuce"), then the game is not decided by the next point, but must go on until one player has two points more than the opponent's score. Assume that the server has a constant probability p of winning each point, independently of...
Question 1 (1 polnt) The following Information applies to questions 1 through 5. Consider a tennis match with 3 sets. The first player to win 2 sets wins the match. Let the probability of Player 1 winning a set be 0.7. The winner of the match gets $100, and the loser get nothing. Hint: draw the game tree will help answer the following questions. 1. This game is an example of a Simultaneous game in pure strategies Recursive Dynamic Progranm...
A certain tennis player makes a successful first serve 78% of the time. Suppose the tennis player serves 100 times in a match. What's the probability that she makes at least 81 first serves?
I thought the answer was C) 5 but that is incorrect. I am not sure how to find the correct answer. 25. In many women's tennis matches they play best-out-of-three sets. In other words, they play until one player wins two sets, and there are no ties. Lourdes and Mariana are two rivals, though Lourdes seems to win about six sets for every four that Mariana wins. Use the random numbers table below to simulate 10 matches between Lourdes and...
Pennsylvania has a lottery entitled "Big 4". To win, a player must correctly match 4 digits, in order, from a daily lottery in which four digits are selected. Digits are chosen from four separate bins, each containing 10 balls numbered 0-9. The only way to win is to match all 4 digits. If the payoff for a $100 bet is $10000, what is the expected value of winning? Create the probability model for this situation. Based on the model, is...