Finite Mathematics & Its Applications (12th Edition)
12th Edition
ISBN: 9780134437767
Author: Larry J. Goldstein, David I. Schneider, Martha J. Siegel, Steven Hair
Publisher: PEARSON
expand_more
expand_more
format_list_bulleted
Textbook Question
Chapter 9.1, Problem 20E
For each of the games that follow, give the payoff matrix and decide whether the game is strictly determined. For those that are, determine the optimal strategies for R and C.
Scissors Paper Stone In the children’s game Scissors Paper Stone, each of two children calls out one of the three words. If they both call out the same word, then the game is a tie. Otherwise, “scissors” beats “paper” (since scissors can cut paper), “paper” beats “stone” (since paper can cover stone), and “stone” beats “scissors” (since stone can break scissors). Suppose that the loser pays a penny to the winner.
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solutionStudents have asked these similar questions
A particular two-player game starts with a pile of diamonds and a pile of rubies. Onyour turn, you can take any number of diamonds, or any number of rubies, or an equalnumber of each. You must take at least one gem on each of your turns. Whoever takesthe last gem wins the game. For example, in a game that starts with 5 diamonds and10 rubies, a game could look like: you take 2 diamonds, then your opponent takes 7rubies, then you take 3 diamonds and 3 rubies to win the game.You get to choose the starting number of diamonds and rubies, and whether you gofirst or second. Find all starting configurations (including who goes first) with 8 gemswhere you are guaranteed to win. If you have to let your opponent go first, what arethe starting configurations of gems where you are guaranteed to win? If you can’t findall such configurations, describe the ones you do find and any patterns you see.
Zara and Sue play the following game. Each of them roll a fair six-sided die once. If Sue’s number is greater than or equal to Zara’s number, she wins the game. But if Sue rolled a number smaller than Zara’s number, then Zara rolls the die again. If Zara’s second roll gives a number that is less than or equal to Sue’s number, the game ends with a draw. If Zara’s second roll gives a number larger than Sue’s number, Zara wins the game.
Find the probability that Zara wins the game and the probability that Sue wins the game.
Zara and Sue play the following game. Each of them roll a fair six-sided die once. If Sue’s number is greater than or equal to Zara’s number, she wins the game. But if Sue rolled a number smaller than Zara’s number, then Zara rolls the die again. If Zara’s second roll gives a number that is less than or equal to Sue’s number, the game ends with a draw. If Zara’s second roll gives a number larger than Sue’s number, Zara wins the game.
Find the probability that Zara wins the game and the probability that Sue wins the game.
Note: Sue only rolls a die once. The second roll, if the game goes up to that point, is made only by Zara.
Chapter 9 Solutions
Finite Mathematics & Its Applications (12th Edition)
Ch. 9.1 - Solutions can be found following the section...Ch. 9.1 - Prob. 2CYUCh. 9.1 - Prob. 3CYUCh. 9.1 - Prob. 1ECh. 9.1 - Prob. 2ECh. 9.1 - Prob. 3ECh. 9.1 - Prob. 4ECh. 9.1 - In Exercises 1–12, determine the optimal pure...Ch. 9.1 - In Exercises 1–12, determine the optimal pure...Ch. 9.1 - Prob. 7E
Ch. 9.1 - In Exercises 1–12, determine the optimal pure...Ch. 9.1 - In Exercises 112, determine the optimal pure...Ch. 9.1 - In Exercises 1–12, determine the optimal pure...Ch. 9.1 - In Exercises 1–12, determine the optimal pure...Ch. 9.1 - Prob. 12ECh. 9.1 - Prob. 13ECh. 9.1 - Prob. 14ECh. 9.1 - Prob. 15ECh. 9.1 - Prob. 16ECh. 9.1 - Prob. 17ECh. 9.1 - Prob. 18ECh. 9.1 - Prob. 19ECh. 9.1 - For each of the games that follow, give the payoff...Ch. 9.1 - Prob. 21ECh. 9.1 - Prob. 22ECh. 9.1 - Prob. 23ECh. 9.2 - Solutions can be found following the section...Ch. 9.2 - Prob. 2CYUCh. 9.2 - Prob. 1ECh. 9.2 - Suppose that a game has payoff matrix [102120011]...Ch. 9.2 - Prob. 3ECh. 9.2 - Prob. 4ECh. 9.2 - Prob. 5ECh. 9.2 - Flood Insurance A small business owner must decide...Ch. 9.2 - 7. Two players, Robert and Carol, play a game with...Ch. 9.2 - Rework Exercise 7 with [.7.3] as Roberts strategy.Ch. 9.2 - Two players, Robert and Carol, play a game with...Ch. 9.2 - 10. Rework Exercise 9 with as Robert’s...Ch. 9.2 - 11. Assume that two players, Renée and Carlos,...Ch. 9.2 - Prob. 12ECh. 9.2 - Prob. 13ECh. 9.2 - Prob. 14ECh. 9.2 - Prob. 15ECh. 9.2 - 16. Three-Finger Morra Reven and Coddy play a game...Ch. 9.3 - Prob. 1CYUCh. 9.3 - Prob. 2CYUCh. 9.3 - Prob. 1ECh. 9.3 - Prob. 2ECh. 9.3 - Prob. 3ECh. 9.3 - Prob. 4ECh. 9.3 - Prob. 5ECh. 9.3 - Prob. 6ECh. 9.3 - Prob. 7ECh. 9.3 - In Exercises 5–12, determine the value of the game...Ch. 9.3 - In Exercises 512, determine the value of the game...Ch. 9.3 - Prob. 10ECh. 9.3 - Prob. 11ECh. 9.3 - Prob. 12ECh. 9.3 - In Exercises 13–16, determine the value of the...Ch. 9.3 - Prob. 14ECh. 9.3 - Prob. 15ECh. 9.3 - Prob. 16ECh. 9.3 - Prob. 17ECh. 9.3 - Prob. 18ECh. 9.3 - Prob. 19ECh. 9.3 - Prob. 20ECh. 9.3 - Prob. 21ECh. 9.3 - Prob. 22ECh. 9.3 - Football Suppose that, when the offense calls a...Ch. 9.3 - Prob. 24ECh. 9.3 - Prob. 25ECh. 9.3 - Three-Finger Mor ra Reven and Coddy play a game in...Ch. 9.3 - Advertising Strategies The Carter Company can...Ch. 9 - 1. What do the individual entries of a payoff...Ch. 9 - Prob. 2FCCECh. 9 - Prob. 3FCCECh. 9 - Prob. 4FCCECh. 9 - Prob. 5FCCECh. 9 - Prob. 6FCCECh. 9 - Prob. 7FCCECh. 9 - What is meant by the optimal mixed strategies of R...Ch. 9 - In Exercises 14, state whether or not the games...Ch. 9 - Prob. 2RECh. 9 - Prob. 3RECh. 9 - Prob. 4RECh. 9 - Prob. 5RECh. 9 - Prob. 6RECh. 9 - Prob. 7RECh. 9 - Prob. 8RECh. 9 - Prob. 9RECh. 9 - Prob. 10RECh. 9 - Prob. 11RECh. 9 - Prob. 12RECh. 9 - Prob. 13RECh. 9 - Prob. 14RECh. 9 - Prob. 15RECh. 9 - Prob. 16RECh. 9 - Prob. 17RECh. 9 - Prob. 18RECh. 9 - Prob. 1PCh. 9 - Prob. 2PCh. 9 - Prob. 3PCh. 9 - Prob. 4PCh. 9 - Prob. 5PCh. 9 - Prob. 6P
Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, subject and related others by exploring similar questions and additional content below.Similar questions
- Rock smashes scissors Almost everyone has played the rock-paper- scissors game at some point. Two players face each other and, at the count of 3, make a fist (rock), an extended hand, palm side down (paper), or a "V" with the index and middle fingers (scissors). The winner is determined by these rules: rock smashes scissors; paper covers rock; and scissors cut paper. If both players choose the same object, then the game is a tie. Suppose that Player 1 and Player 2 are both equally likely to choose rock, paper, or scissors. (a) Give a probability model for this chance process. (b) Find the probability that Player 1 wins the game on the first throw. 3.arrow_forwardKiara and her friends are playing The Duck Game at a local fair. In this game, the player selects one of 50 identical plastic ducks from a pool. The bottom of each duck is each numbered 1, 2, or 3. If you draw a duck with a 1, you win a small prize, a duck with a 2 will win you a medium prize, and a duck with a 3 will win a large prize. According to the game operator, there are 25 ducks with a number 1 on the bottom, 20 ducks with the number 2, and 5 ducks with the number 3. Use the information given to explore some of the mathematical concepts you have practiced so far by answering the questions below.arrow_forwardNigel and Sofia play the following game. Each of them roll a fair six-sided die once. IfSofia’s number is greater than or equal to Nigel’s number, she wins the game. But ifSofia rolled a number smaller than Nigel’s number, then Nigel rolls again. If Nigel’ssecond roll gives a number that is less than or equal to Sofia’s number, the game endswith a draw. If Nigel’s second roll gives a number larger than Sofia’s number, Nigelwins the game.Find the probability that Nigel wins the game and the probability that Sofia wins thegame.arrow_forward
- Bob and Doug play a lot of Ping-Pong, but Doug is a much better player, and wins 80% of their games. To make up for this, if Doug wins a game he will spot Bob five points in their next game. If Doug wins again he will spot Bob ten points the next game, and if he still wins the next game he will spot him fifteen points, and continue to spot him fifteen points as long as he keeps winning. Whenever Bob wins a game he goes back to playing the next game with no advantage. It turns out that with a five-point advantage Bob wins 20% of the time; he wins 50% of the time with a ten-point advantage and 80% of the time with a fifteen-point advantage. Model this situation as a Markov chain using the number of consecutive games won by Doug as the states. There should be four states representing zero, one, two, and three or more consecutive games won by Doug. Find the transition matrix of this system, the steady-state vector for the system, and determine the proportion of games that Doug will win in…arrow_forwardBob and Doug play a lot of Ping-Pong, but Doug is a much better player, and wins 80% of their games. To make up for this, if Doug wins a game he will spot Bob five points in their next game. If Doug wins again he will spot Bob ten points the next game, and if he still wins the next game he will spot him fifteen points, and continue to spot him fifteen points as long as he keeps winning. Whenever Bob wins a game he goes back to playing the next game with no advantage. It turns out that with a five-point advantage Bob wins 40% of the time; he wins 70% of the time with a ten-point advantage and 90% of the time with a fifteen-point advantage. Model this situation as a Markov chain using the number of consecutive games won by Doug as the states. There should be four states representing zero, one, two, and three or more consecutive games won by Doug. Find the transition matrix of this system, the steady-state vector for system, and determine the proportion games that Doug will win the long…arrow_forwardBob and Doug play a lot of Ping-Pong, but Doug is a much better player, and wins 80% of their games. To make up for this, if Doug wins a game he will spot Bob five points in their next game. If Doug wins again he will spot Bob ten points the next game, and if he still wins the next game he will spot him fifteen points, and continue to spot him fifteen points as long as he keeps winning. Whenever Bob wins a game he goes back to playing the next game with no advantage. It turns out that with a five-point advantage Bob wins 30% of the time; he wins 40% of the time with a ten-point advantage and 70% of the time with a fifteen-point advantage. Model this situation as a Markov chain using the number of consecutive games won by Doug as the states. There should be four states representing zero, one, two, and three or more consecutive games won by Doug. Find the transition matrix of this system, the steady-state vector for the system, and determine the proportion of games that Doug will win in…arrow_forward
arrow_back_ios
arrow_forward_ios
Recommended textbooks for you
- Discrete Mathematics and Its Applications ( 8th I...MathISBN:9781259676512Author:Kenneth H RosenPublisher:McGraw-Hill EducationMathematics for Elementary Teachers with Activiti...MathISBN:9780134392790Author:Beckmann, SybillaPublisher:PEARSON
- Thinking Mathematically (7th Edition)MathISBN:9780134683713Author:Robert F. BlitzerPublisher:PEARSONDiscrete Mathematics With ApplicationsMathISBN:9781337694193Author:EPP, Susanna S.Publisher:Cengage Learning,Pathways To Math Literacy (looseleaf)MathISBN:9781259985607Author:David Sobecki Professor, Brian A. MercerPublisher:McGraw-Hill Education
Discrete Mathematics and Its Applications ( 8th I...
Math
ISBN:9781259676512
Author:Kenneth H Rosen
Publisher:McGraw-Hill Education
Mathematics for Elementary Teachers with Activiti...
Math
ISBN:9780134392790
Author:Beckmann, Sybilla
Publisher:PEARSON
Thinking Mathematically (7th Edition)
Math
ISBN:9780134683713
Author:Robert F. Blitzer
Publisher:PEARSON
Discrete Mathematics With Applications
Math
ISBN:9781337694193
Author:EPP, Susanna S.
Publisher:Cengage Learning,
Pathways To Math Literacy (looseleaf)
Math
ISBN:9781259985607
Author:David Sobecki Professor, Brian A. Mercer
Publisher:McGraw-Hill Education
Solve ANY Optimization Problem in 5 Steps w/ Examples. What are they and How do you solve them?; Author: Ace Tutors;https://www.youtube.com/watch?v=BfOSKc_sncg;License: Standard YouTube License, CC-BY
Types of solution in LPP|Basic|Multiple solution|Unbounded|Infeasible|GTU|Special case of LP problem; Author: Mechanical Engineering Management;https://www.youtube.com/watch?v=F-D2WICq8Sk;License: Standard YouTube License, CC-BY
Optimization Problems in Calculus; Author: Professor Dave Explains;https://www.youtube.com/watch?v=q1U6AmIa_uQ;License: Standard YouTube License, CC-BY
Introduction to Optimization; Author: Math with Dr. Claire;https://www.youtube.com/watch?v=YLzgYm2tN8E;License: Standard YouTube License, CC-BY