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.1, Problem 14E
To determine
The dominated rows and column to find resultant.
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.
Consider a two-player game that is set up with two piles of stones. The two players are taking turns removing stones from one of the two piles. In each turn, a player must choose a pile and remove one stone or two stones from it. The player who removes the last stone (making both piles empty) wins the game. Show that if the two piles contain the same number n ∈ Z+ of stones initially, then the second player can always guarantee a win.
The game of Chomp is played by two players. In this game, cookies are laid out on a rectangular grid. The cookie in the top left position is poisoned. The two players take turns making moves; at each move, a player is required to eat a remaining cookie, together with all cookies to the right and/or below (that is all the remaining cookies in the rectangle, in which the first cookie eaten is the top left corner). The loser is the player who has no choice but to eat the poisoned cookie. Prove that if the board is square (and bigger than 1 × 1) then the first player has a winning strategy.
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
- In baseball, League A allows a designated hitter (DH) to bat for the pitcher, who is typically a weak hitter. In League B, the pitcher must bat. The common belief is that this results in League A teams scoring more runs. In interleague play, when League A teams visit League B teams, the League A pitcher must bat. So, if the DH does result in more runs, it would be expected that league A teams will score more runs in League A park than when visiting League B parks. To test this claim, a random sample of runs scored by league A teams with and without their DH is given in the accompanying table. Complete parts c) through d) below.arrow_forwardA game theorist is walking down the street in his neighborhood and finds $20. Just as he picks it up, two neighborhood kids, Jane and Tim, run up to him, asking if they can have it. Because game theorists are generous by nature, he says he’s willing to let them have the $20, but only according to the following procedure: Jane and Tim are each to submit a written request as to their share of the $20. Let t denote the amount that Tim requests for himself and j be the amount that Jane requests for herself. Tim and Jane must choose j and t from the interval [0,20]. If j + t ≤ 20, then the two receive what they requested, and the remainder, 20 - j - t, is split equally between them. If, however, j + t > 20, then they get nothing, and the game theorist keeps the $20. Tim and Jane are the players in this game. Assume that each of them has a payoff equal to the amount of money that he or she receives. Find all Nash equilibria.arrow_forwardIn a Stackelberg game, what is the best response that follower firm 2 can make to the choice y1 already made by the leader, firm 1?arrow_forward
- Which situation illustrates combination a. assigning participants of conference to breakout session halls b. forming a vehicle license plate with 3 lettes and 4 digits c. choosing winners of gift certificates worth 1000 pesos each d. arranging 10 children in a rowarrow_forwardIn Section 5.5 we showed the following two-person, zero-sum game had a mixed strategy: Player B b1 b2 b3 a1 0 -1 2 Player A a2 5 4 -3 a3 2 3 -4 a. Which strategies are dominated? a1, a2, a3, b1, b2, b3 b. Does the game have a pure or mixed strategy?arrow_forwardA tennis tournament has 85 participants. Players who lose a game are immediately eliminated; players who win a game keep playing. Still, the organizers have a lot of choices to make. They could give a first round bye to some players so that after the first round there are 26 = 64 players and no more bye are needed. Or they could give even a second round bye to the best players, or possibly even a third round bye to the very best ones. What is the best strategy for the organizers if they want to choose the winner of the tournament using as few games as possible?arrow_forward
- 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 youarrow_forwardThe coach of a basketball tema wants a plan B just in case all of her starters foul out in a game. The starting team consists of A, B, C, D, and E, and the substitute squad consists F, G, H, I, J, and K. F can substitute for either A or B, G can substitute for either B or C, H can substitute for either A, C, or D, I can substitute for either C or D, J can substitute for wither D or E, and K can substitute for E. A. Model the possible substitutions on the team using a bipartite graph. B. Find a matching for the first team, if all of them foul out in a game.arrow_forwardConsider a symmetric game with 10 players. Each player chooses among three strategies: x, y, and z. Let nx denote the number of players who choose x, ny denote the number of players who choose y, and nz denote the number of players who choose z. (So, nz = 10−nx−ny.) The payoff to a player from choosing strategy x is 10−nx (note that nx includes this player as well), strategy y is 13−2ny (again ny includes this player as well), and strategy z is 3. (a) Show that a Nash equilibrium must have at least one person choosing x and at least one person choosing y. (Hint: In a Nash equilibrium, no player can do better by doing something different.) b) Find all Nash equilibria.arrow_forward
- A researcher is conducting a DIFFERENT dictator game. In the first stage (S1), he forms pairs randomly and in each pair there is one dictator and one recipient. Each pair has $14 as endowment and a dictator has to decide how much to give to their recipient from the endowment. Then he adds another stage (S2) where it is stated that the dictators can give any amount between -$14 and +$14. a) explain what happens in Stage 1. b) explain what happens in stage 2. IN DETAILarrow_forward7. In a chess competition involving some men and women, every player needs to play exactly one game with every other player. It was found that in 45 games, both the players were women and in 190 games, both players were men. What is the number of game in which one person was a man and another person was a woman? * 12 40 180 200 8. In a locality, there are ten houses in a row. One night, a thief planned to steal from three houses in the locality. In how many ways can the thief plan such that no two houses are next to each other? * 56 73 80 120 9. In how many ways can you group 12 people into 2 groups of 3 people and 3 groups of 2 people? * 1, 663, 200 2, 796, 330 4, 862, 200 5, 681, 030 .arrow_forwardA group of cruise guests were surveyed about their taste in music. They were asked how they liked 3 types of music: rock, classical, and jazz. Here are the results: no one disliked all three types of music. Four liked all three types. Eleven didn’t like classical; sixteen liked jazz; three liked classical and jazz, but not rock. Six didn’t like rock. Eight liked rock and classical. Seven didn’t like jazz. How many people liked jazz and rock but not classical? -venn diagram strategy-arrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
- Linear Algebra: A Modern IntroductionAlgebraISBN:9781285463247Author:David PoolePublisher:Cengage Learning
Linear Algebra: A Modern Introduction
Algebra
ISBN:9781285463247
Author:David Poole
Publisher:Cengage Learning
Find number of persons in a part with 66 handshakes Combinations; Author: Anil Kumar;https://www.youtube.com/watch?v=33TgLi-wp3E;License: Standard YouTube License, CC-BY
Discrete Math 6.3.1 Permutations and Combinations; Author: Kimberly Brehm;https://www.youtube.com/watch?v=J1m9sB5XZQc;License: Standard YouTube License, CC-BY
How to use permutations and combinations; Author: Mario's Math Tutoring;https://www.youtube.com/watch?v=NEGxh_D7yKU;License: Standard YouTube License, CC-BY
Permutations and Combinations | Counting | Don't Memorise; Author: Don't Memorise;https://www.youtube.com/watch?v=0NAASclUm4k;License: Standard Youtube License
Permutations and Combinations Tutorial; Author: The Organic Chemistry Tutor;https://www.youtube.com/watch?v=XJnIdRXUi7A;License: Standard YouTube License, CC-BY