Maximization problem, Game Theory

Assignment Help:

Two individuals (i ∈ {1, 2}) work independently on a joint project. They each independently decide how much e ort ei they put. E ort choice has to be any real number between 0 and 1 (ei ∈ [0, 1] not just 0 or 1). The cost of putting an amount of e ffort ei is n e2i/2, where n is a parameter greater or equal than 2. If individual i puts e ffort ei, then he succeeds with probability ei and fails with probability 1 - ei. The probability of success of the two agents are independent; this means that both succeed with probability e1x e2, 1 succeeds and 2 fails with probability e1 x(1 - e2), 1 fails and 2 succeeds with probability (1 - e1)e2, and both fail with probability (1 - e1)  (1 - e2).

If at least one of the individuals succeeds then, independently of who did succeed, both individuals get a payo of 1. If none of them succeeds, both individuals get 0. Therefore, each individual is a ected by the action of the other. However, individuals choose the level of e ort that maximizes their own expected utility (bene t minus cost of e ort).

(a) Write down the expected utility of individuals 1 and 2 (note that the utility of 1 depends on the e orts of 1 and 2 and the utility of 2 depends on the e orts of 1 and 2). [Hint. The expected bene t of 1 is the probability that 1 and/or 2 succeed times the payo if 1 and/or 2 succeed plus the probability that both 1 and 2 fail times the payo if both 1 and 2 fail.]

(b) Find the Nash equilibrium of this game, that is, the optimal level of e ort. Find the expected utility of each individual in equilibrium (use the rst-order condition and make sure that the second-order condition is satis ed). Suppose that a benevolent dictator can choose the  level of e ort that both individuals must exert. He chooses the e ort levels that maximize the sum of the expected utilities of both agents (these e orts are also called socially optimal levels).

(c) Write down the maximization problem of the benevolent dictator.

(d) Find the e ort levels that the dictator imposes on each individual (use the rst-order condition and assume that the second-order condition is satis ed). Find the expected utility of each individual.

(e) Compare the e ort level and nal utility of each individual in the cases of Nash Equilibrium (sel sh individual maximization) and benevolent dictatorship.

 


Related Discussions:- Maximization problem

Proxy bidder , A proxy bidder represents the interests of a bidder not phys...

A proxy bidder represents the interests of a bidder not physically gift at the auction. Typically, the bidder can inform his proxy of the most quantity he's willing to pay, and als

Consolidation, For the section on dynamic games of competition, you can beg...

For the section on dynamic games of competition, you can begin by asking if anyone in the class has played competi- tive tennis (club or collegiate or better); there is usually one

First price auction, Two individuals, Player 1 and Player 2, are competing ...

Two individuals, Player 1 and Player 2, are competing in an auction to obtain a valuable object. Each player bids in a sealed envelope, without knowing the bid of the other player.

Quiz to generate a grid, 1.a.out 2 1 Here is the grid that has been gene...

1.a.out 2 1 Here is the grid that has been generated: 1 1 1 0 0 0 0 0 1 1 0 1 0 0 1 1 1 1 0 0 1 1 1 1 0 1 1 0 0 1 1 0 0 1 0 1 1 1 1 1 1 0 1 0 1 1 0 1 0 1 1 1 0

Game 3 bargaining, GAME 3 Bargaining Two players A and B are chosen. P...

GAME 3 Bargaining Two players A and B are chosen. Player A offers a split of a dollar (whole dimes only). If B agrees, both get paid the agreed coins and the game is over. If

Bidding increment, A bidding increment is defined by the auctioneer as the ...

A bidding increment is defined by the auctioneer as the least amount above the previous bid that a new bid must be in order to be adequate to the auctioneer. For example, if the in

Straight auction, A common term for an English auction, a sort of sequentia...

A common term for an English auction, a sort of sequential auction during which an auctioneer directs participants to beat the present, standing bid. New bids should increase the p

All pure nash equilibrium for strategic form game, write a program in c tha...

write a program in c that takes n number finite players using gambit format and output is to be all pure strategy nash equilibrium

Heuristic, A heuristic is an aid to learning, casually brought up as a rule...

A heuristic is an aid to learning, casually brought up as a rule of thumb. Formally, a heuristic may be a mechanism capable of altering its internal model of the surroundings in re

Positive add, In a positive add game, the combined payoffs of all players a...

In a positive add game, the combined payoffs of all players aren't identical in each outcome of the sport. This differs from constant add (or zero add) games during which all outco

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd