Three brothers, Huey, Dewey, and Louie, are playing a game. The game uses a 3x3 pegboard....
Brothers: Consider the following game that proceeds in two stages: In the first stage one brother (player 2) has two $10 bills and can choose one of two options: he can give his younger brother (player 1) $20 or give him one of the $10 bills (giving nothing is inconceivable given the way they were raised). This money will then be used to buy snacks at the show they will see, and each $1 of snacks purchased yields one unit...
Choose a,b,c,d
12. In the game above, who has dominant strategy? A) Player A has a dominant strategy C) B) Player B has a dominant strategy Both players have dominant strategies. D) Neither player has a dominant strategy 13. Which one is the Nash equilibrium? A) firm A competition, firm B competition. C) firm A collusion, firm B competition. B) firm A competition, firm B collusion. D) firm A collusion, firm B collusion. In the following game, all payoffs are...
4. (a) (10%) A player has three information sets in the game tree. He has four choices in his first information set, four in his second and three in his third. How many strategies does he have in the strategic form? Circle one: (i) 11, (ii) 28 (iii) 48 (iv) 18. (b) (10%) Is it true that the following game is a Prisoners' Dilemma? Explain which features of a Prisoners' Dilemma hold and which do not. (Remember each player must...
Problem 4. (20 points) Pebbles Game. Two players play a game, starting with three piles of n pebbles each. Players alternate turns. On each turn, a player may do one of the following: take one pebble from any pile take two pebbles each from two different piles The player who takes the last pebble(s) wins the game. Write an algorithm that, given n, determines whether the first player can "force" a win. That is, can the first player choose moves...
Assignment 2 – The two player game of Poaka The game of Poaka is a dice game played by two players. Each player takes turns at rolling the dice. At each turn, the player repeatedly rolls a dice until either the player rolls a 1 (in which case the player scores 0 for their turn) or the player chooses to end their turn (in which case the player scores the total of all their dice rolls). At any time during...
(C++) Please create a tic tac toe game. Must write a Player class to store each players’ information (name and score) and to update their information (increase their score if appropriate) and to retrieve their information (name and score).The players must be called by name during the game. The turns alternate starting with player 1 in the first move of round 1. Whoever plays last in a round will play second in the next round (assuming there is one).The rows...
C or C++ Project Overview Wild, Wild, West! Dice Game The Wild, Wild, West! is an elimination dice game. It can be played by any number of players, but it is ideal to have three or more players. Wild, Wild, West! Requires the use of two dice. At the start of the game, each player receives a paper that will track the number of lives that player has. Each player starts the game with 6 lives. In the first round,...
1. Consider the coupon game. But suppose that instead of
decisions being made simultaneously, they are made sequentially,
with Firm 1 choosing first, and its choice observed by Firm 2
before Firm 2 makes its choice.
a. Draw a game tree representing this game.
b. Use backward induction to find the solution. (Remember that
your solution should include both firms’ strategies, and that Firm
2’s strategy should be complete!)
2. Two duopolists produce a homogeneous product, and each has a...
11. The demand for a monopolist's product is given by Q - 400 4P while the monopolist's marginal cost is given by MC-2Q The profit-maximizing quantity of output for this monopolist is A) 100 C) 40 B) 44-44 D) 20 There is a payoff matrix of two firms; their different profits are listed when they choose collusion or competition (answer 14-15). firm B collusion 27.5 19, 19 competition competition14, 14 5. 28 firm A collusion 12. In the game above,...
Two player Dice game In C++ The game of ancient game of horse, not the basketball version, is a two player game in which the first player to reach a score of 100 wins. Players take alternating turns. On each player’s turn he/she rolls a six-sided dice. After each roll: a. If the player rolls a 3-6 then he/she can either Roll again or Hold. If the player holds then the player gets all of the points summed up during...