Two hunters have set off to get food from the forest. They have two possible games that they can hunt: either a stag or rabbits. If both players hunt the stag, then they succeed in bringing it down; this gives them both a payoff of 2 units of food. If one player hunts the stag and the other hunts rabbits, then the stag hunter will fail while the rabbit hunter will succeed; i.e. the stag hunter gets a payoff of O while the rabbit hunter gets a payoff of 1. Finally, if both hunters pursue rabbits, they both receive a payoff of 1. The payoff matrix for this game is shown below. Determine all the Nash equilibria of this game (if there are any). O (Stag, Stag) and (Rabbit, Rabbit) The game has no Nash equilibrium. (Rabbit, Rabbit) O (Stag, Stag) STAG RABBIT STAG (2, 2) (1,0) RABBIT (0, 1) (1, 1)

Two hunters have set off to get food from the forest. They have two possible games that they can hunt: either a stag or rabbits. If both players hunt the stag, then they succeed in bringing it down; this gives them both a payoff of 2 units of food. If one player hunts the stag and the other hunts rabbits, then the stag hunter will fail while the rabbit hunter will succeed; i.e. the stag hunter gets a payoff of O while the rabbit hunter gets a payoff of 1. Finally, if both hunters pursue rabbits, they both receive a payoff of 1. The payoff matrix for this game is shown below. Determine all the Nash equilibria of this game (if there are any). O (Stag, Stag) and (Rabbit, Rabbit) The game has no Nash equilibrium. (Rabbit, Rabbit) O (Stag, Stag) STAG RABBIT STAG (2, 2) (1,0) RABBIT (0, 1) (1, 1)

Operations Research : Applications and Algorithms

4th Edition

ISBN:9780534380588

Author:Wayne L. Winston

Publisher:Wayne L. Winston

Chapter21: Simulation

Section21.4: An Example Of Monte Carlo Simulation

Problem 3P

See similar textbooks

Similar questions

Raghu and Sayan both like to eat (a lot) but since they are also looking after their health, they can only eat a limited amount of calories per day. So when Kuldeep invites them to a party, both Raghu and Sayan decide to play a game. The game is simple, both Raghu and Sayan will eat the dishes served at the party till they are full, and the one who eats maximum number of distinct dishes is the winner. However, both of them can only eat a dishes if they can finish it completely i.e. if Raghu can eat only 50 kCal in a day and has already eaten dishes worth 40 kCal, then he can't eat a dish with calorie value greater than 10 kCal.Given that all the dishes served at the party are infinite in number, (Kuldeep doesn't want any of his friends to miss on any dish) represented by their calorie value(in kCal) and the amount of kCal Raghu and Sayan can eat in a day, your job is to find out who'll win, in case of a tie print “Tie” (quotes for clarity). Input:First line contains number of test…
A high school has 1000 students and 1000 lockers, one locker for each student. On the first day of school, theprincipal plays the following game: She asks the first student to open all the lockers. She then asks the secondstudent to close all the even-numbered lockers. The third student is asked to check every third locker. If it isopen, the student closes it; if it is closed, the student opens it. The fourth student is asked to check every fourthlocker. If it is open, the student closes it; if it is closed, the student opens it. The remaining students continuethis game. In general, the nth student checks every nth locker. If it is open, the student closes it; if it is closed,the student opens it. After all the students have taken turns, some of the lockers are open and some are closed.The program below, when ran, will prompt the user to enter the number of lockers in the school. After thegame is over, the program will output the number of lockers and the lockers numbers of the lockers…
A city police department and a gang of drug dealers play a game every day where the police must decide whether to focus their department resources on either street patrol or parks patrol, and the drug gang must make the same decision regarding where to focus their drug selling activities. If both focus on street sales the police make 90 arrests and the dealers avoid 10 arrests. If both focus on park selling. The police arrest 80 dealers and 20 dealers avoid capture. If the PD focuses on streets, while the DDs focus on parks, 5 arrests are made and 95 dealers escape arrest. If the PD focuses on parks while the DD focus on streets, then 10 arrests are made and 90 dealers get away. a) Find the Nash equilibrium in mixed strategies for the police department and for the drug dealers. b) Explain in simple terms what will play out in this game between the PD and the DDs. c) If the PD gets better at park patrol (measured by more arrests in parks than before), in which direction will the…
Jack and Jill will play a game called Hotter, Colder. Jill chooses a number from 0 to 100, and Jack makes repeated attempts to guess it. For each guess, Jill will respond with: hotter - if the current guess is closer to her number than the previous guess is colder - if the current guess is farther to her number than the previous guess is same - if the current guess is as far (to her number) as the previous guess is For Jack’s first guess, since there is no previous guess yet, Jill will just answer same. Describe an algorithm or a systematic approach that Jack can follow to win the games faster (fewer guesses). Example: Jill chooses number 40. Note: Jack can guess any number from 0 to 100 at any point of the game. Jack guesses 100. Jill responds same (first guess) Jack guesses 60. Jill responds hotter (60 is closer to 40 than previous guess 100) Jack guesses 80. Jill responds colder (80 is farther from 40 than previous guess 60) Jack guesses…
Consider a game in which two players take turns removing any positive number of matches they want from one of two piles of matches. The player who removes the last match wins the game. Show that if the two piles contain the same number of matches initially, the second player can always guarantee a win.
You are playing a card game. In this game, your opponent places n monster cards onto the board, the i th of which has hi health points. You in turn have m ≥ n hero cards in your hand, the j th of which deals dj damage per turn. To begin the game, you will choose n heroes from your hand and assign each of them to a different enemy monster. Each turn, your heroes will deal damage equal to their damage power to the opposing enemy. If at any point an opponent’s monster reaches 0 health or less, then it is destroyed. You are given a limited number of turns k to destroy all enemy monsters. Design an algorithm which runs in O(m + n log n) time and determines whether it is possible to assign your heroes in such a way as to destroy all enemy monsters in k turns or fewer First develop a Θ(m log m) time algorithm, then improve it to Θ(m + n log n) Do not write the code, give steps and methods. Explain the steps of algorithm, and the logic behind these steps in plain English input is The number of…
Stick or roll is a game involving two players, A and B, and a die with four faces (numbered 1, 2, 3, 4). The faces are equally likely to occur when the die is rolled. Player A rolls the die once and sticks with that number as the score or rolls it again and scores the sum of the two numbers. • If A's score is greater than 4 then A loses. • If A's score is 4 then A wins. If A's score is less than 4, then B rolls the die once and sticks with that number as the score or rolls it again and scores the sum of the two numbers. • If B's score is greater than 4 then B loses. • If B's score is 4 or less and equal to A's or less, then B loses. • If B's score is 4 or less and greater than A's, then B wins. Player B sticks on the first roll if that number wins and rolls again if it doesn't win and it is possible to win with a second roll. Some example games might be: • A rolls a 2, chooses to roll again and rolls a 3. A's score is then 5 so A loses and B wins. * A rolls a 2 and chooses not to roll…
Stick or roll is a game involving two players, A and B, and a die with four faces (numbered 1, 2, 3, 4). The faces are equally likely to occur when the die is rolled. Player A rolls the die once and sticks with that number as the score or rolls it again and scores the sum of the two numbers. • If A's score is greater than 4 then A loses. • If A's score is 4 then A wins. If A's score is less than 4, then B rolls the die once and sticks with that number as the score or rolls it again and scores the sum of the two numbers. • If B's score is greater than 4 then B loses. • If B's score is 4 or less and equal to A's or less, then B loses. • If B's score is 4 or less and greater than A's, then B wins. Player B sticks on the first roll if that number wins and rolls again if it doesn't win and it is possible to win with a second roll. Some example games might be: • A rolls a 2, chooses to roll again and rolls a 3. A's score is then 5 so A loses and B wins. * A rolls a 2 and chooses not to roll…
In a card game, your opponent places n monster cards onto the board, the i th of which has hi health points. You in turn have m ≥ n hero cards in your hand, the j th of which deals dj damage per turn. To begin the game, you will choose n heroes from your hand and assign each of them to a different enemy monster. Each turn, your heroes will deal damage equal to their damage power to the opposing enemy. If at any point an opponent’s monster reaches 0 health or less, then it is destroyed. You are given a limited number of turns k to destroy all enemy monsters. Design an algorithm which runs in O(m + n log n) time and determines whether it is possible to assign your heroes in such a way as to destroy all enemy monsters in k turns or fewer First develop a Θ(m log m) time algorithm, then improve it to Θ(m + n log n) Do not write the code, give steps and methods. Explain the steps of algorithm, time complexity, and the logic behind these steps in plain English Input is the number of monsters…
In a card game, your opponent places n monster cards onto the board, the i th of which has hi health points. You in turn have m ≥ n hero cards in your hand, the j th of which deals dj damage per turn. To begin the game, you will choose n heroes from your hand and assign each of them to a different enemy monster. Each turn, your heroes will deal damage equal to their damage power to the opposing enemy. If at any point an opponent’s monster reaches 0 health or less, then it is destroyed. You are given a limited number of turns k to destroy all enemy monsters. Design an algorithm which runs in O(m + n log n) time and determines whether it is possible to assign your heroes in such a way as to destroy all enemy monsters in k turns or fewer First develop a Θ(m log m) time algorithm, then improve it to Θ(m + n log n) Do not write the code, give steps and methods. Explain the steps of algorithm, and the logic behind these steps in plain English input is The number of monsters n, the health…
There are four medals (Gold, Silver, Bronze and Wood) on a table, but they are all wrapped with dark wrapping paper, such that it is impossible to distinguish them. You would like to find the gold medal.The game starts as follows. You pick one medal without unwrapping it, and then the game host unwraps one of the remaining medals and reveals that it is a silver medal. (Assume here that the host unwraps a medal with equal probability, but knowing where the gold medal was and avoiding unwrapping the gold medal if still on the table, to keep the game interesting to watch until the end.)You have now three medals left to unwrap (one in your hand, two on the table). At this point, the host gives you the option to change your mind and swap your medal for one of the two left on the table. What would you do at this point? Would you keep your medal, or swap it with one of the two medals left on the table? If so, which one? Hints: Find the solution by using Bayes’ theorem, calculating all the…
Build a two-player Tic-Tac-Toe game, and use a loop to keep the game running until a player wins or the board is full. Use if statements to check for win conditions and to validate player moves.