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
Question
Chapter 11.1, Problem 40E
To determine
The resulting payoff matrix and whether the game is strictly determined or not.
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solutionStudents have asked these similar questions
Write the payoff matrix for the given game, use Rick as the row player.
Two friends, Rick and Carl, play the following game. Each one has a coin, and each decides which side to turn up. They show the coins simultaneously and make payments according to the following. If both show heads, Rick pays Carl 50 cents. If both show tails, Rick pays Carl 25 cents. If a head and a tail show, Carl pays Rick 35 cents.
Write the payoff matrix for the given game, use Rachel as the row player.
Two players, Rachel and Charlie, each have two cards. Rachel has one black card with the number 3 and one red card with the number 5. Charlie has a black card with a 6 written on it and a red card with a 1. They each select one of their cards and simultaneously show the cards. If the cards are the same color, Rachel gets, in dollars, the sum of the two numbers shown. If the cards are different colors, Charlie gets, in dollars, the difference of the two numbers shown.
Two-Finger Morra is a game in which two players each hold up one or two fingers. The payoff, in dollars, is the total number of fingers shown. R receives the payoff if the total is even, and C receives the payoff if the total is odd. Write the payoff matrix.
C
R
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
- 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.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.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_forward
- A bag contains 3 gold marbles, 10 silver marbles, and 20 black marbles. Someone offers to play this game: You randomly select one marble from the bag. If it is gold, you win $3. If it is silver, you win $2. If it is black, you lose $1.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_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
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
Graph Theory: Euler Paths and Euler Circuits; Author: Mathispower4u;https://www.youtube.com/watch?v=5M-m62qTR-s;License: Standard YouTube License, CC-BY
WALK,TRIAL,CIRCUIT,PATH,CYCLE IN GRAPH THEORY; Author: DIVVELA SRINIVASA RAO;https://www.youtube.com/watch?v=iYVltZtnAik;License: Standard YouTube License, CC-BY