Ask Question, Ask an Expert

+61-413 786 465

info@mywordsolution.com

Ask Automata & Computation Expert

1. Consider a two player game in which player 1 can choose A or B. The game ends if he chooses A, while it continues to player 2 if he chooses B. After observing B, Player 2 can then choose C or D. If player 2 chooses C, the game ends. If player 2 chooses D the game
continues with player 1 after D. After observing D, Player 1 then can choose E or F. The game ends after each of these choices.

(a). Model this as an extensive form game tree. Is it a game of perfect or imperfect information?

(b). How many terminal nodes does the game have? How many information sets? How many pure strategies does each player have?

(c). Imagine that the payoffs following choice A by player 1 are (2, 0), following C by player 2 are (3, 1), following E by player 1 are (0, 0) and following F by player 1 are (1, 2). What are the Pure Strategy Nash Equilibria of this game? Does one strike you as more appealing than the other? If so, explain why.

(d). Characterize the Subgame Perfect Nash Equilibria of this game. Discuss the underlying assumptions made in the analysis.

2. Two staff managers in the ΠβΨ sorority, the house manager (player 1) and kitchen manager (player 2), are supposed to select a resident assistant (RA) from a pool of three candidates: {a, b, c}. Player 1 prefers a to b and b to c. Player 2 prefers b to a and a to c. The process that is imposed on them is as follows: First, the house manager vetoes one of the candidates, and announces the veto to the central office for staff selection, and to the kitchen manager. Next, the kitchen manager vetoes one of the remaining two candidates and announces it to the central office. Finally, the director of the central office assigns the remaining candidate to be an RA.

(a). Model this as an extensive form game where a player's most preferred candidate gives a payoff of 2, the second gives a payoff of 1, and the last gives 0.

(b). Find the subgame perfect equilibria of this game. Is it unique?

(c). Now assume that before the two players play the game, player 2 can send an alienating E-mail to one of the candidates, which would result in that candidate withdrawing her application. Would player 2 choose to do this, and if so, with which candidate?

3. Consider the following Extensive-Form Game with Imperfect Information. Characterize the Subgame Perfect Nash Equilibria.

2171_Extensive form game.jpg

4. Suppose there is a single good that is owned by a single seller who values it at c > 0 (he can consume the good and get a payoff of c). There is a single buyer who has a small transportation cost k > 0 to get to and back from the seller's store, and he values the good at v > c + k. The buyer first decides whether to make the commute or stay at home, not buy the good and receive a payoff of 0. If the buyers commutes to the store, the seller observes this and can then make the buyer a Take-It-Or-Leave-It price offer p ≥ 0. After observing this offer, the buyer can then accept the offer, pay p and get the good, or he can walk out and not buy the good. Assume that c, v, and k, are common knowledge to all players.

(a). As best as you can, draw the extensive form of this game.

(b). Find the Subgame Perfect Nash Equilibrium of the game. Could the players construct an outcome that would make both players strictly better-off (yielding a Pareto Improvement)?

(c). Now assume that before the game is played, the seller can, at a small cost  < v-c-k send the buyer a postcard that commits the seller to a certain price at which the buyer can buy the good (e.g., "bring this coupon and get the good at a price p" ). Would the seller choose to do so? Justify your answer with an equilibrium analysis.

Automata & Computation, Computer Science

  • Category:- Automata & Computation
  • Reference No.:- M91603241
  • Price:- $90

Guranteed 48 Hours Delivery, In Price:- $90

Have any Question?


Related Questions in Automata & Computation

Solve the question given belowprove the following statement

Solve the question given below Prove the following statement using Hall's Theorem. For any bipartite graph G=(U, V, E), if every node (either a left node or a right node) has exactly d neighbors, where d is an arbitrary ...

Prove or disprove the following proposed inference rules

Prove or disprove the following proposed inference rules for functional dependencies. A proof should be made by using the reflexive, augmentation, transitive, decomposition, union, and pseudotransitive rules. A disproof ...

Models of computation assignment -purpose - to improve and

Models of Computation Assignment - Purpose - To improve and consolidate your understanding of regular and context-free languages, finite-state and pushdown automata. To develop skills in analysis and formal reasoning abo ...

Question 1a digital computer has a memory unit with 16 bits

Question 1: A digital computer has a memory unit with 16 bits per word. The instruction set consists of 122 different operations. All instructions have an operation code part (opcode) and an address part (allowing for on ...

Question - design a task or function that will check the

Question - Design a task or function that will check the parity of a word for odd parity. The input to the task/function is a 5-bit word called data_in. If the parity of input data_in is not odd increment an error count ...

Regular expressions automatacomputabilitytheory of

Regular expressions, automata/computability/theory of computation How would I go about interpreting regular expressions? For example, how would I interpret the following in English: (0+1)*011 0*1*2* 0^(+)1^(+)2^(+)

Models of computation assignment -purpose - to improve and

Models of Computation Assignment - Purpose - To improve and consolidate your understanding of regular and context-free languages, finite-state and pushdown automata. To develop skills in analysis and formal reasoning abo ...

Prove or disprove the following proposed inference rules

Prove or disprove the following proposed inference rules for functional dependencies. A proof should be made by using the reflexive, augmentation, transitive, decomposition, union, and pseudotransitive rules. A disproof ...

Question - design a state machine that will control a

Question - Design a state machine that will control a vending machine. The vending machine has 4 inputs, N, D indicating a nickel or dime was inserted as well as clk and an active high asynchronous reset. The vending mac ...

Question 1hoare logic semantics for each of the parts below

Question 1 Hoare Logic Semantics For each of the parts below, justify your answer briefly. 1. For which programs S does {False} S {True} hold? 2. For which programs S does {True} S {False} hold? 3. For which programs S d ...

  • 4,153,160 Questions Asked
  • 13,132 Experts
  • 2,558,936 Questions Answered

Ask Experts for help!!

Looking for Assignment Help?

Start excelling in your Courses, Get help with Assignment

Write us your full requirement for evaluation and you will receive response within 20 minutes turnaround time.

Ask Now Help with Problems, Get a Best Answer

Why might a bank avoid the use of interest rate swaps even

Why might a bank avoid the use of interest rate swaps, even when the institution is exposed to significant interest rate

Describe the difference between zero coupon bonds and

Describe the difference between zero coupon bonds and coupon bonds. Under what conditions will a coupon bond sell at a p

Compute the present value of an annuity of 880 per year

Compute the present value of an annuity of $ 880 per year for 16 years, given a discount rate of 6 percent per annum. As

Compute the present value of an 1150 payment made in ten

Compute the present value of an $1,150 payment made in ten years when the discount rate is 12 percent. (Do not round int

Compute the present value of an annuity of 699 per year

Compute the present value of an annuity of $ 699 per year for 19 years, given a discount rate of 6 percent per annum. As