Finite Mathematics (11th Edition)
11th Edition
ISBN: 9780321979438
Author: Margaret L. Lial, Raymond N. Greenwell, Nathan P. Ritchey
Publisher: PEARSON
expand_more
expand_more
format_list_bulleted
Concept explainers
Question
Chapter 11, Problem 5EA
To determine
The possible hazards and benefits of deviating from an adaptive strategy.
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solution
Students have asked these similar questions
The board game Dominion is a card-drafting game where the player with the most victory
points wins. You are playing Dominion with a group of friends, and are on the last turn. The only
two remaining cards that you can purchase are Duchies and Dukes.
Each Duchy is worth 3 victory points and costs 5 gold. Each Duke gives you 1 victory point
per Duchy in your possession, and also costs 5 gold. Assuming you have N gold and can purchase
as many cards as you like, how many Dukes and Duchies should you buy to maximize your victory
points?
My neighborhood has a lot of dogs. In fact, when I walk my dog, Wrigley, only 2% of the time do we not see any other dogs. Gary has three dogs (Salsa, Nacho, and Dublin), and we see only Gary and his dogs about 30% of the time when we are on a walk. Lesley has two dogs (Buster and Oreo), and we see only Lesley and her dogs 20% of the time when we are on a walk. Gary and Lesley’s dogs don’t get along; we never see them at the same time. Margo has one dog (Bond), and we see only Margo and Bond 25% of the time when we are on a walk. 10% of the time we see Margo and Lesley.
What is the probability that Wrigley and I see both Gary (Salsa, Nacho and Dublin) and Margo (Bond) on a walk?
What is the probability we see at least one dog owner on our walk?
What is the probability we see only Margo or only Gary?
Are the events seeing Gary and seeing Margo independent? EXPLAIN briefly.
Are the events of seeing Lesley and seeing Gary mutually exclusive? EXPLAIN briefly.
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…
Chapter 11 Solutions
Finite Mathematics (11th Edition)
Ch. 11.1 - In the following game, decide on the payoff when...Ch. 11.1 - Prob. 2ECh. 11.1 - Prob. 3ECh. 11.1 - In the following game, decide on the payoff when...Ch. 11.1 - Prob. 5ECh. 11.1 - Prob. 6ECh. 11.1 - Prob. 7ECh. 11.1 - Does it have a saddle point?Ch. 11.1 - Prob. 9ECh. 11.1 - Prob. 10E
Ch. 11.1 - Prob. 11ECh. 11.1 - Prob. 12ECh. 11.1 - Prob. 13ECh. 11.1 - Prob. 14ECh. 11.1 - Prob. 15ECh. 11.1 - Prob. 16ECh. 11.1 - Prob. 17ECh. 11.1 - Prob. 18ECh. 11.1 - Prob. 19ECh. 11.1 - Prob. 20ECh. 11.1 - Prob. 21ECh. 11.1 - Prob. 22ECh. 11.1 - Prob. 23ECh. 11.1 - Prob. 24ECh. 11.1 - Prob. 25ECh. 11.1 - Prob. 26ECh. 11.1 - Prob. 27ECh. 11.1 - Prob. 28ECh. 11.1 - Prob. 29ECh. 11.1 - Prob. 30ECh. 11.1 - Prob. 31ECh. 11.1 - Prob. 32ECh. 11.1 - Prob. 33ECh. 11.1 - Prob. 34ECh. 11.1 - Prob. 35ECh. 11.1 - Prob. 36ECh. 11.1 - Prob. 37ECh. 11.1 - APPLY IT Football When a football team has the...Ch. 11.1 - Prob. 39ECh. 11.1 - Prob. 40ECh. 11.1 - Children's Game In the children's game rock,...Ch. 11.2 - Suppose a game has payoff matrix [ 3452 ]. Suppose...Ch. 11.2 - Suppose a game has payoff matrix [ 041324110 ]....Ch. 11.2 - Find the optimum strategies for player A and...Ch. 11.2 - Find the optimum strategies for player A and...Ch. 11.2 - Prob. 5ECh. 11.2 - Prob. 6ECh. 11.2 - Prob. 7ECh. 11.2 - Prob. 8ECh. 11.2 - Prob. 9ECh. 11.2 - Prob. 10ECh. 11.2 - Prob. 11ECh. 11.2 - Prob. 12ECh. 11.2 - Prob. 13ECh. 11.2 - Prob. 14ECh. 11.2 - Prob. 15ECh. 11.2 - Prob. 16ECh. 11.2 - Prob. 17ECh. 11.2 - Prob. 18ECh. 11.2 - Prob. 19ECh. 11.2 - Prob. 20ECh. 11.2 - Prob. 21ECh. 11.2 - Prob. 22ECh. 11.2 - Prob. 23ECh. 11.2 - Prob. 24ECh. 11.2 - Prob. 25ECh. 11.2 - Prob. 26ECh. 11.2 - Prob. 27ECh. 11.2 - Prob. 28ECh. 11.2 - A reader wrote to the "Ask Marilyn" column in...Ch. 11.2 - Prob. 30ECh. 11.2 - Prob. 31ECh. 11.2 - Prob. 32ECh. 11.2 - Prob. 33ECh. 11.2 - Choosing Medication The number of cases of African...Ch. 11.2 - Prob. 35ECh. 11.2 - Prob. 36ECh. 11.2 - 37. Golf In a simplified variation of the Ryder...Ch. 11.2 - Prob. 38ECh. 11.2 - Prob. 39ECh. 11.2 - Prob. 40ECh. 11.2 - Finger Game Repeal Exercise 40 if each player may...Ch. 11.3 - Use the graphical method to find the optimum...Ch. 11.3 - Prob. 2ECh. 11.3 - Use the graphical method to find the optimum...Ch. 11.3 - Prob. 4ECh. 11.3 - Prob. 5ECh. 11.3 - Prob. 6ECh. 11.3 - Prob. 7ECh. 11.3 - Prob. 8ECh. 11.3 - Prob. 9ECh. 11.3 - Use the simplex method to find the optimum...Ch. 11.3 - Prob. 11ECh. 11.3 - Prob. 12ECh. 11.3 - Prob. 13ECh. 11.3 - Prob. 14ECh. 11.3 - Prob. 15ECh. 11.3 - In Exercises 1327, use the graphical method when...Ch. 11.3 - Prob. 17ECh. 11.3 - Prob. 18ECh. 11.3 - Prob. 19ECh. 11.3 - Prob. 20ECh. 11.3 - Prob. 21ECh. 11.3 - Prob. 22ECh. 11.3 - Prob. 23ECh. 11.3 - In Exercises 1327, use the graphical method when...Ch. 11.3 - In Exercises 13–27, use the graphical method when...Ch. 11.3 - Prob. 26ECh. 11.3 - Prob. 27ECh. 11 - 1. Since they like to eat out, each prefers a...Ch. 11 - If Linda likes French food more than Mel likes...Ch. 11 - Prob. 3EACh. 11 - 4. Suppose Linda knows that Mel is going to stick...Ch. 11 - Prob. 5EACh. 11 - Prob. 6EACh. 11 - Prob. 1RECh. 11 - Prob. 2RECh. 11 - Prob. 3RECh. 11 - Prob. 4RECh. 11 - Prob. 5RECh. 11 - Prob. 6RECh. 11 - Prob. 7RECh. 11 - Prob. 8RECh. 11 - Prob. 9RECh. 11 - Prob. 10RECh. 11 - 11. How can you determine from the payoff matrix...Ch. 11 - Prob. 12RECh. 11 - Prob. 13RECh. 11 - Prob. 14RECh. 11 - Prob. 15RECh. 11 - Prob. 16RECh. 11 - Prob. 17RECh. 11 - Prob. 18RECh. 11 - Prob. 19RECh. 11 - Prob. 20RECh. 11 - Prob. 21RECh. 11 - Prob. 22RECh. 11 - Prob. 23RECh. 11 - Prob. 24RECh. 11 - Prob. 25RECh. 11 - For the following games, find the strategies...Ch. 11 - Prob. 27RECh. 11 - For the following games, find the strategies...Ch. 11 - Prob. 29RECh. 11 - Prob. 30RECh. 11 - Prob. 31RECh. 11 - Prob. 32RECh. 11 - Prob. 33RECh. 11 - Prob. 34RECh. 11 - Prob. 35RECh. 11 - For each game, remove any dominated strategies,...Ch. 11 - Prob. 37RECh. 11 - Prob. 38RECh. 11 - Prob. 39RECh. 11 - Prob. 40RECh. 11 - Prob. 41RECh. 11 - Prob. 42RECh. 11 - Prob. 43RECh. 11 - Prob. 44RECh. 11 - Prob. 45RECh. 11 - Prob. 46RECh. 11 - Labor Relations In labor-management relations,...Ch. 11 - Prob. 48RECh. 11 - Prob. 49RECh. 11 - Prob. 50RECh. 11 - Prob. 51RECh. 11 - Prob. 52RECh. 11 - Prob. 53RECh. 11 - Prob. 54RECh. 11 - Politics Mary Wilkinson, a candidate for city...Ch. 11 - Prob. 56RECh. 11 - Prob. 57RECh. 11 - Prob. 58RECh. 11 - Prob. 59RECh. 11 - Prob. 60RECh. 11 - Prob. 61RECh. 11 - Prob. 62RECh. 11 - Prob. 63RECh. 11 - Newcomb's Paradox Suppose there are two boxes, A...
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
- At your local carnival, there is a game where 40 rubber duckies are floating in a kiddie tub, and they each have their bottoms painted one of three colors. 55 are painted pink, 16 are painted blue, and 19 are painted purple. If the player selects a duck with a pink bottom, they receive three pieces of candy. If they select blue, they receive two pieces of candy. And if they select purple, they receive one piece of candy. If the game is played 42 times, what are the minimum and maximum amounts of candy that could be handed out?arrow_forwardvideo gamer believes that team composition greatly affects win rate. To test this idea, the player decides to play 100 matches with teams of 3 colors: Red, Green, and Blue. The player records the number of matches he wins with each team color. Given anecdotal evidence, the gamer believes his red team is the best and therefore will win the most games. He has less experience with his blue and green team and is interested to see if there is a difference between the two. Because the gamer is more experienced with his red team, he plays more matches with that team. The total number of matches played per team color is: Red-50, Blue-23, and Green 27. a) What is the IV of this experiment? What are the levels of the IV? What is the scale of measurement of the IV? b) What is the DV of this experiment? What is the scale of measurement of the DV? c) Is this a True experiment or not? Explain your reasoning. d) What is the hypothesis of this experiment? Is it directional or nondirectional? e)…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
- In 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.arrow_forwardplease do the last question(Q3) as well Define a game as follow: you begin with an urn that contains a mixture of black and white balls, and during the game you have access to as many extra black and white balls as you need. In each move of the game, you remove two balls from the urn without being able to see what colour they are. Then you look at their colour and do the following: If the balls are the same colour, you keep them out of the urn and put a black ball in the urn. if the balls are different colours, you keep the black one out of the urn and put the white one back into the urn. Each move reduces the number of balls by one, and the game will end when only one ball is left in the urn. In this you will figure out how to predict the colour of the last ball in the urn and prove your answer using mathematical induction. Q1) Draw diagrams to map out all the possibilities for playing the game starting with two balls in the urn, then three balls, then four balls. For each case…arrow_forwardThe game of craps is played with two dice. The player rolls both dice and wins immediately if the outcome (the sum of the faces) is 7 or 11. If the outcome is 2, 3, or 12, the player loses immediately. If he rolls any other outcome, he continues to throw the dice until he either wins by repeating the first outcome or loses by rolling a 7.arrow_forward
- Suppose you play a game where you roll 2 six-sided dice. If you roll a 7, you will lose some money, but if you roll anything else you will win 100. How much money would you have to lose in order for you average 0 per roll?arrow_forwardThis game is called “Get Negative”. Roll two dice (record these in the order you roll them), and then do then do the following: take the first number rolled and subtract 2 times the second number rolled. Regardless of who rolls, Player A gets 3 points if the product is greater than or equal to 0 (i.e. it is zero or positive); Otherwise Player B gets 1 points. The players may or may not take turns rolling the dice as it does not matter who is rolling. Any player may score on any roll, and every roll will result in a score. Play the game by rolling the dice 25 times. For each turn, keep a record of both dice and the resulting answer and the points scored, according to the rules above. Tally the points and calculate the final score for each player. Remember, someone gets a point for each turn, depending on the numbers rolled. (One does not have to be rolling to receive the points.) (Note: you may test the game by yourself by doing all of the 25 rolls yourself and just giving the…arrow_forwardThis game is called “Get Negative”. Roll two dice (record these in the order you roll them), and then do then do the following: take the first number rolled and subtract 2 times the second number rolled. Regardless of who rolls, Player A gets 3 points if the product is greater than or equal to 0 (i.e. it is zero or positive); Otherwise Player B gets 1 points. The players may or may not take turns rolling the dice as it does not matter who is rolling. Any player may score on any roll, and every roll will result in a score. Play the game by rolling the dice 25 times. For each turn, keep a record of both dice and the resulting answer and the points scored, according to the rules above. Tally the points and calculate the final score for each player. Remember, someone gets a point for each turn, depending on the numbers rolled. (One does not have to be rolling to receive the points.) (Note: you may test the game by yourself by doing all of the 25 rolls yourself and just giving the…arrow_forward
- Consider old McDonald, who must carry a dozen eggs from the barn to the house. The ground between the barn and the house is slippery, so there is a 50 percent chance that McDonald will slip on a given trip and break all the eggs in his basket. Consider two strategies: a one-basket strategy (a single trip with all 12 eggs) and a two-basket strategy (two trips, with 6 eggs per trip). McDonald can sell each egg for 10 cents. List all of the possible outcomes under each of the strategies. What is the expected number of delivered (unbroken) eggs under each strategy? What is his expected revenue under each strategy? What strategy is better?arrow_forwardYou are a contestant on a game show. There are three closed doors in front of you. The game show host tells you that behind one of these doors is a million dollars in cash, and that behind the other two doors there are trashes. You do not know which doors contain which prizes, but the game show host does. The game you are going to play is very simple: you pick one of the three doors and win the prize behind it. After you have made your selection, the game show host opens one of the two doors that you did not choose and reveals trash. At this point, you are given the option to either stick with your original door or switch your choice to the only remaining closed door. To maximize your chance to win a million dollars in cash, should you switch? Choices: A) Yes B) No C) It doesn't matter because the probability for you to win a million dollars in cash stays the same no matter if you switch or not.arrow_forwardWhat is a three-way table? Can you give me an example?arrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
Calculus For The Life SciencesCalculusISBN:9780321964038Author:GREENWELL, Raymond N., RITCHEY, Nathan P., Lial, Margaret L.Publisher:Pearson Addison Wesley,
Calculus For The Life Sciences
Calculus
ISBN:9780321964038
Author:GREENWELL, Raymond N., RITCHEY, Nathan P., Lial, Margaret L.
Publisher:Pearson Addison Wesley,