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
Videos
Textbook Question
Chapter 9.2, Problem 7E
Two players, Robert and Carol, play a game with payoff matrix (to Robert)
a. Is the game strictly determined? Why?
b. Suppose that Robert has strategy
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solution
Students have asked these 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.
two players A and B agree to play until one of them wins a certain number of games. P(A wins a game)=p and P(B wins a game)=1-p=q. However, they are forced to quit when A still has a games to win and B still has b games to win. How should they divide their stance to be fair?
A roulette wheel has 30 slots, consisting of 2 blues, 8 whites, and 20 red slots. You will receive
P100 if the roulette stops spinning on a blue slot, you will receive P50 on a white slot, but you will
be penalized P10 if the roulette stops spinning on a red slot. Let X be the amount you will recieve
(or pay). The probaility of receiving P50 is 2/30 or 1/15, and of receiving P50 is 8/30 or 4/15.
What is the probability of penalty of P10?
2/3
1/3
-2/3
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
- 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_forwardConsider 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,2arrow_forwardEhsaan and TJ play a game in which Ehsaan flips 2 fair coins, and TJ flips 3 fair coins.Represent each outcome of the game as a pair (E, T ) where E is the number of headsEhsaan gets, and T is the number of heads TJ gets. (For example, the outcome (2,1)means that Ehsaan flipped two heads and TJ flipped one (E > T ))1. Consider the event that TJ flips more heads than Ehsaan, or E < T . Explicitlywrite out all outcomes where E < T . (Your answer should be a set consisting ofordered pairs).2. Compute the probability that Ehsaan flipped fewer heads than TJ.arrow_forward
- Consider the following game. Players 1 and 2 are partners in a firm. If they both invest 10 ina project, the project will achieve an income of 13 per person, so both will get net earningsof 3. If only one of them invests, the project earns only 5 per person, leading to a payoff of-5 for the person who invested and 5 for the other. If none of them invests, both get nothing.They can only choose to invest 10 or not invest at all. 1. Write down the payoff matrix of the game.2. Assume that both players only care about their own material payoffs. Suppose thesepreferences are commonly known to both players. Derive the Nash equilibrium/equilibriaof the game. Does a player’s best choice depend on the strategy chosen by the otherplayer?arrow_forwardConsider the following game of ’divide the dollar.’ There is a dollar to be split between two players. Player 1 can make any offer to player 2 in increments of 25 cents; that is, player 1 can make offers of 0 cents, 25 cents, 50 cents, 75 cents, and $1. An offer is the amount of the original dollar that player 1 would like player 2 to have. After player 2 gets an offer, she has the option of either accepting or rejecting the offer. If she accepts, she gets the offered amount and player 1 keeps the remainder. If she rejects, neither player gets anything. Draw the game tree.arrow_forwardConsider the following game. Two construction firms are thinking about bidding cable stayed bridge in one of the lakes near to Warangal. The take from the bridge construction would be Rs. 20 lakhs each, but the job requires two firms (one to design and one to build the structure). Each firm could instead build apartment in smart city project. The take from apartment in smart city project is only Rs. 5 Lakhs but can be done with one firm acting alone. i. Write down the payoff matrix for this game. ii. What are the strategies for this game? ii. What are the equilibria for this game?.arrow_forward
- . The table below states the payoffs in political points (measured in billions of rubles) to two nations that are rivals in world politics, Russia and Ukraine. Each country can take one of two courses: peace; or war. In each cell, the first payoff is for Russia, and the second payoff is for Ukraine. (a) Assume that neither country observes the military strategy of its rival, and solve the game (if it can be solved). Explain your solution step-by-step. Does this outcome maximize total political points? (b) In general, what is a Nash equilibrium? Is the solution to this game a Nash equilibrium? (c) Suppose that each country deposits a fund of two billion rubles with the United Nations. Either country would forfeit this fund if it wages war. What is the solution now to the game? Is this a Nash equilibrium? Russia, Ukraine Peace War Peace 4,4 1, 5 War 5, 1 2,2arrow_forwardConsider 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.arrow_forwardA construction company has a bid on two large construction projects. The president believes that the chances of winning the first contract is 55% and the chances of winning the second contract is 30% and that winning either contract is independent of winning the other. What are the chances the company will not win either contract?arrow_forward
- Suppose you are going to Las Vegas to play Keno. Your favorite bet is dollar on a single number. When you win, they give you the dollar back and two dollars more. When you lose, they keep the dollar. There is 1 chance in 4 to win. The box model for this problem is as follows: The box contains 1 ticket numbered +$ and ickets numbered -$. Suppose you play Keno 100 times, betting a dollar on a number each time. Your net gain is like the sum of draws from the box described above. Suppose you play 5 times, betting a dollar on a number each time. Suppose the results of the 5 plays are as follows: win, win, lose, lose, win. Your net gain is +$.arrow_forwardThe 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.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_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
Glencoe Algebra 1, Student Edition, 9780079039897...AlgebraISBN:9780079039897Author:CarterPublisher:McGraw Hill
Glencoe Algebra 1, Student Edition, 9780079039897...
Algebra
ISBN:9780079039897
Author:Carter
Publisher:McGraw Hill
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