Finite Mathematics for the Managerial, Life, and Social Sciences
12th Edition
ISBN: 9781337405782
Author: Soo T. Tan
Publisher: Cengage Learning
expand_more
expand_more
format_list_bulleted
Question
Chapter 9.4, Problem 26E
To determine
Whether the statement is true or false and explain reason for it with an example.
“If the value of a strictly determined game is not negative, it favors the row player”.
Expert Solution & Answer
Trending nowThis is a popular solution!
Students have asked these similar questions
Do all three solution approaches for simultaneous games work independently (not together)? If not, which do not
Given question is A basket of fruit is being assembled from apples, bananas, and oranges. What is the fewest number of fruit pieces that should be placed in the basket to ensure that there are at least 8 apples, 6 bananas, or 9 oranges?Your answer:
The question is asking you to prepare for a worst-case scenario, not a best-case scenario. Imagine a game where you're not the one in charge of choosing the fruits - your opponent is in charge, and they don't want you to win. The opponent can get away with choosing 20 fruits (7 apples, 5 bananas, and 8 oranges) before the 21st fruit finally forces your condition to be satisfied.
Therefore total required the fewest number of fruit pieces =(7+5+8)+1=21.My question:Why did you add 7+5+8 , instead of 8 apples, 6 bananas, or 9 oranges? The given is 8+6+9 not 7+5+8. Also why did you add +1? Here, you add 1: (7+5+8) +1 =21. Also, Is it pigeonhole formula? The pigeonhole is ⌈n/m⌉ not like this as far as i know. Thank you
Consider the game described by the following table. What is the best response for the column player if
s/he knows that the row player will make the Y move?
B
OA
O
C
ROW
PLAYER
O There is no definitive answer.
X
Y
COLUMN PLAYER
A
4, -1
3, -1
B
-1,0
-2,4
C
2,1
0,2
Chapter 9 Solutions
Finite Mathematics for the Managerial, Life, and Social Sciences
Ch. 9.1 - What is a finite stochastic process? What can you...Ch. 9.1 - Prob. 2CQCh. 9.1 - Consider a transition matrix T for a Markov chain...Ch. 9.1 - Prob. 1ECh. 9.1 - Prob. 2ECh. 9.1 - Prob. 3ECh. 9.1 - Prob. 4ECh. 9.1 - Prob. 5ECh. 9.1 - Prob. 6ECh. 9.1 - Prob. 7E
Ch. 9.1 - Prob. 8ECh. 9.1 - Prob. 9ECh. 9.1 - In Exercises 1-10, determine which of the matrices...Ch. 9.1 - Prob. 11ECh. 9.1 - Prob. 12ECh. 9.1 - Prob. 13ECh. 9.1 - Prob. 14ECh. 9.1 - Prob. 15ECh. 9.1 - In Exercises 1518, find X2 the probability...Ch. 9.1 - Prob. 17ECh. 9.1 - Prob. 18ECh. 9.1 - Prob. 19ECh. 9.1 - Prob. 20ECh. 9.1 - Political Polls: Morris Polling conducted a poll 6...Ch. 9.1 - Commuter Trends: In a large metropolitan area, 20...Ch. 9.1 - Prob. 23ECh. 9.1 - Prob. 24ECh. 9.1 - Prob. 25ECh. 9.1 - MARKET SHARE OF AUTO MANUFACTURERES In a study of...Ch. 9.1 - Prob. 27ECh. 9.1 - Homeowners choice of Energy: A study conducted by...Ch. 9.1 - In Exercises 29 and 30, determine whether the...Ch. 9.1 - Prob. 30ECh. 9.1 - Prob. 1TECh. 9.1 - Prob. 2TECh. 9.1 - Prob. 3TECh. 9.1 - Prob. 4TECh. 9.2 - What is a A steady state distribution vector, b a...Ch. 9.2 - Prob. 2CQCh. 9.2 - Prob. 1ECh. 9.2 - Prob. 2ECh. 9.2 - Prob. 3ECh. 9.2 - Prob. 4ECh. 9.2 - Prob. 5ECh. 9.2 - Prob. 6ECh. 9.2 - Prob. 7ECh. 9.2 - Prob. 8ECh. 9.2 - Prob. 9ECh. 9.2 - Prob. 10ECh. 9.2 - Prob. 11ECh. 9.2 - Prob. 12ECh. 9.2 - Prob. 13ECh. 9.2 - Prob. 14ECh. 9.2 - Prob. 15ECh. 9.2 - Prob. 16ECh. 9.2 - Prob. 17ECh. 9.2 - COMMUTER TRENDS Within a large metropolitan area,...Ch. 9.2 - Prob. 19ECh. 9.2 - PROFESSIONAL WOMEN From data compiled over a...Ch. 9.2 - Prob. 21ECh. 9.2 - HOMEOWNERS' CHOICE OF ENERGY A study conducted by...Ch. 9.2 - NETWORK NEWS VIEWERSHIP A television poll was...Ch. 9.2 - Prob. 24ECh. 9.2 - GENETICS In a certain species of roses, a plant...Ch. 9.2 - Prob. 26ECh. 9.2 - Prob. 27ECh. 9.2 - Prob. 28ECh. 9.2 - Prob. 29ECh. 9.2 - Prob. 1TECh. 9.2 - Prob. 2TECh. 9.2 - Prob. 3TECh. 9.3 - What is an absorbing stochastic matrix?Ch. 9.3 - Prob. 2CQCh. 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 - Prob. 8ECh. 9.3 - Prob. 9ECh. 9.3 - Prob. 10ECh. 9.3 - Prob. 11ECh. 9.3 - In Exercises 9-14, rewrite each absorbing...Ch. 9.3 - Prob. 13ECh. 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 - Prob. 23ECh. 9.3 - Prob. 24ECh. 9.3 - Prob. 25ECh. 9.3 - Prob. 26ECh. 9.3 - GAME OF CHANCE Refer to Exercise 26. Suppose Diane...Ch. 9.3 - Prob. 28ECh. 9.3 - COLLEGE GRADUATION RATE: The registrar of...Ch. 9.3 - Prob. 30ECh. 9.3 - GENETICS Refer to Example 4. If the offspring are...Ch. 9.3 - Prob. 32ECh. 9.3 - Prob. 33ECh. 9.4 - a. What is the maximin strategy for the row player...Ch. 9.4 - Prob. 2CQCh. 9.4 - Prob. 1ECh. 9.4 - In Exercises 1-8, determine the maximin and...Ch. 9.4 - In Exercises 1-8, determine the maximin and...Ch. 9.4 - Prob. 4ECh. 9.4 - Prob. 5ECh. 9.4 - In Exercises 1-8, determine the maximin and...Ch. 9.4 - Prob. 7ECh. 9.4 - Prob. 8ECh. 9.4 - Prob. 9ECh. 9.4 - In Exercises 9-18, determine whether the...Ch. 9.4 - In Exercises 9-18, determine whether the...Ch. 9.4 - Prob. 12ECh. 9.4 - Prob. 13ECh. 9.4 - Prob. 14ECh. 9.4 - Prob. 15ECh. 9.4 - Prob. 16ECh. 9.4 - Prob. 17ECh. 9.4 - Prob. 18ECh. 9.4 - GAME OF MATCHING FINGERS Robin and Cathy play a...Ch. 9.4 - Prob. 20ECh. 9.4 - Prob. 21ECh. 9.4 - Prob. 22ECh. 9.4 - MARKET SHARE: Rolands Barber Shop and Charleys...Ch. 9.4 - In Exercises 24-26, determine whether the...Ch. 9.4 - Prob. 25ECh. 9.4 - Prob. 26ECh. 9.5 - Prob. 1CQCh. 9.5 - Prob. 2CQCh. 9.5 - Prob. 1ECh. 9.5 - Prob. 2ECh. 9.5 - Prob. 3ECh. 9.5 - Prob. 4ECh. 9.5 - In Exercises 1-6, the payoff matrix and strategies...Ch. 9.5 - Prob. 6ECh. 9.5 - Prob. 7ECh. 9.5 - Prob. 8ECh. 9.5 - The payoff matrix for a game is [332311121] a....Ch. 9.5 - The payoff matrix for a game is [423422352] a....Ch. 9.5 - Prob. 11ECh. 9.5 - Prob. 12ECh. 9.5 - In Exercises 11-16, find the optimal strategies, P...Ch. 9.5 - Prob. 14ECh. 9.5 - Prob. 15ECh. 9.5 - Prob. 16ECh. 9.5 - COIN-MATCHING GAME Consider the coin-matching game...Ch. 9.5 - INVESTMENT STRATEGIES As part of their investment...Ch. 9.5 - INVESTMENT STRATEGIES The Maxwells have decided to...Ch. 9.5 - CAMPAIGN STRATEGIES Bella Robinson and Steve...Ch. 9.5 - MARKETING STRATEGIES Two dentists, Lydia Russell...Ch. 9.5 - Prob. 22ECh. 9.5 - Prob. 23ECh. 9.CRQ - Prob. 1CRQCh. 9.CRQ - Prob. 2CRQCh. 9.CRQ - Fill in the blanks. The probabilities in a Markov...Ch. 9.CRQ - Fill in the blanks. A transition matrix associated...Ch. 9.CRQ - Prob. 5CRQCh. 9.CRQ - Prob. 6CRQCh. 9.CRQ - Prob. 7CRQCh. 9.CRQ - Prob. 8CRQCh. 9.CRQ - Prob. 9CRQCh. 9.CRQ - Prob. 10CRQCh. 9.CRE - Prob. 1CRECh. 9.CRE - Prob. 2CRECh. 9.CRE - Prob. 3CRECh. 9.CRE - Prob. 4CRECh. 9.CRE - Prob. 5CRECh. 9.CRE - Prob. 6CRECh. 9.CRE - In Exercises 7-10, determine whether the matrix is...Ch. 9.CRE - Prob. 8CRECh. 9.CRE - Prob. 9CRECh. 9.CRE - Prob. 10CRECh. 9.CRE - In Exercises 11-14, find the steady-state matrix...Ch. 9.CRE - Prob. 12CRECh. 9.CRE - Prob. 13CRECh. 9.CRE - Prob. 14CRECh. 9.CRE - Prob. 15CRECh. 9.CRE - Prob. 16CRECh. 9.CRE - Prob. 17CRECh. 9.CRE - Prob. 18CRECh. 9.CRE - Prob. 19CRECh. 9.CRE - Prob. 20CRECh. 9.CRE - Prob. 21CRECh. 9.CRE - Prob. 22CRECh. 9.CRE - Prob. 23CRECh. 9.CRE - Prob. 24CRECh. 9.CRE - Prob. 25CRECh. 9.CRE - Prob. 26CRECh. 9.CRE - Prob. 27CRECh. 9.CRE - Prob. 28CRECh. 9.CRE - Prob. 29CRECh. 9.CRE - OPTIMIZING DEMAND The management of a divison of...Ch. 9.BMO - The transition matrix for a Markov process is...Ch. 9.BMO - Prob. 2BMOCh. 9.BMO - Prob. 3BMOCh. 9.BMO - Prob. 4BMOCh. 9.BMO - The payoff matrix for a certain game is A=[213234]...Ch. 9.BMO - Prob. 6BMO
Knowledge Booster
Similar questions
- 2.)A jar contains 2 red, 3 green, and 6 blue marbles. In a game a player closes their eyes, reaches into the jar and randomly chooses two marbles. The player wins the game if at least one of their marbles is red. Suppose it costs $1 to play the game and the winning prize is $3. Mathematically analyze this game and determine if it is in your financial interest to play the game.arrow_forwardA game involves drawing a single card from a standard deck. The player receives $10 for an ace, $5 for a king, and $1 for a red card that is neither an ace nor a king. Otherwise, the player receives nothing. If the cost of each draw is $2, should you play? Explain your answer mathematically.arrow_forwardA 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.arrow_forward
- Ashleigh and Pavak play a game that begins with a pile of 100 toothpicks. They alternate turns with Ashleigh going first. On each player’s turn, they must remove 1, 3, or 4 toothpicks from the pile. The player who removes the last toothpick wins the game. Determine, with proof, which player has a winning strategy.arrow_forwardSupposed a certain game is fair and costs $7 if you lose and has a net payoff of $10 if you win. The only possible outcomes of the game are winning and losing.arrow_forwardPlz asaparrow_forward
- 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.arrow_forwardZara 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.arrow_forwardRock 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_forward
- You are going to play the 7-11 game, which has the following rules: You roll two dice. If the total value of the two dice is 7 or 11, you immediately win the game. If the total value is 2, 3, or 12, you immediately lose. If the total value is 4, 5, 6, 8, 9, or 10, you keep this value as a referenced point. Then, you continue rolling the dice until you obtain the same value as the referenced point then you win the game. However, if you obtain the value of 7 before the referenced point, then you lose. For example, you obtain 4 in the first time of rolling, you keep rolling the dice until you get 4 (before 7) then you win. Similarly, you obtain 4 in the first time of rolling, you keep rolling the dice but you get 7 (before 4) then you lose. What is the probability to win this game? You can solve this question either by - a simulation - in this case you have to answer one more question, i.e., on average how many times do you roll the dice for each game? (for a submission, you will need to…arrow_forwardYou have a choice between two games. Game a said that you have a 0.864 probability of winning, and game B says that you have a 0.012 probability of losing. If you want to win, which game should you play and why?arrow_forwardIn this game, two chips are placed in a cup. One chip has two red sides and one chip has a red and a blue side. The player shakes the cup and dumps out the chips. The player wins if both chips land red side up and loses if one chip lands red side up and one chip lands blue side up. The cost to play is $4 and the prize is worth $6. Is this a fair game. = Win a prize = Do not win a prize 1. Start by determining the probabilities for winning a prize and not winning a prize. Draw a probability tree to find the possible outcomes and the probabilities. After you draw the tree, check you work by clicking on the link below. Click to hide hint CHIP 1 CHIP 2 Probability P(Red) & P(Red) = P(R) - P(R) = 0.5. 0.5 = 0.25 0.5 0.5 0.5 P(Red) & P(Blue) = P(R) - P(B) = 0.5.0.5 = 0.25 Start 0.5 0.5 P(Red) & P(Red) = P(R) - P(R) = 0.5. 0.5 = 0.25 0.5 P(Red) & P(Blue) = P(R) - P(B) = 0.5.0.5 = 0.25arrow_forward
arrow_back_ios
SEE MORE QUESTIONS
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