Reference no: EM131252870
Asymmetric Nash equilibria of second-price sealed-bid common value auctions:-
Show that when α = γ = 1, for any value of λ > 0 the game studied above has an (asymmetric) Nash equilibrium in which each type t1 of player 1 bids (1 + λ)t1 and each type t2 of player 2 bids (1 + 1/λ)t2.
Note that when player 1 calculates her expected value of the object, she finds the expected value of player 2's signal given that her bid wins.
If her bid is low then she is unlikely to be the winner, but if she is the winner, player 2's signal must be low, and so she should impute a low value to the object. She should not base her bid simply on an estimate of the valuation derived from her own signal and the (unconditional) expectation of the other player's signal. If she does so, then over all the cases in which she wins, she more likely than not overvalues the object.
A bidder who incorrectly behaves in this way is said to suffer the winner's curse. (Bidders in real auctions know this problem: when a contractor gives you a quotation to renovate your house, she does not base her price simply on an unbiased estimate out how much it will cost her to do the job, but takes into account that you will select her only if her competitors' estimates are all be higher than hers, in which case her estimate may be suspiciously low.)
Nash equilibrium in a first-price sealed-bid auction I claim that under the assumptions on the players' signals and valuations in the previous section, a first-price sealed-bid auction has a Nash equilibrium in which each type ti of each player i bids ½ (α + γ)ti. This claim may be verified by arguments like those in the previous section. In the next exercise, you are asked to supply the details.
Evaluating web sources and identifying the audience
: "Evaluating Web Sources and Identifying the Audience" Please respond to the following: Identify three (3) Websites that you plan to use for your research on a paper to convince
|
Discuss merits and demerits of prim''s algorithms
: Design and conduct an experiment to empirically compare the efficiencies of Prim's and Kruskal's algorithms on random graphs of different sizes and densities.
|
Designing a creativity training program
: What are the key elements you would consider when designing a creativity training program? Justify your answer with an example.
|
Satisfaction by consuming bagels and donuts
: The price of a bagel with cream cheese equals $2 and the price of a donut equals 50 cents. The marginal utility to Joaquin of the last bagel consumed equals 16 utils. If Joaquin maximizes his satisfaction by consuming both bagels and donuts, we wo..
|
Asymmetric nash equilibria of second price sealed bid
: Show that when α = γ = 1, for any value of λ > 0 the game studied above has an (asymmetric) Nash equilibrium in which each type t1 of player 1 bids (1 + λ)t1 and each type t2 of player 2 bids (1 + 1/λ)t2.
|
Comparing two candidates from the perspective of business
: For the Midterm Assignment, write a 1,500 - 1,750 word paper comparing and contrasting the two candidates from the perspective of business. The paper should provide a recommendation for business to consider
|
Analyze the inherent risks at a methamphetamine laboratory
: Analyze commonly accepted forensic and contemporary specialized techniques. Consider the following questions when composing your response: What is the level of personal protective equipment that you would recommend at this scene? Why do you think ..
|
Describe the rise of mankind from the earliest hominid
: Describe the rise of mankind from the earliest hominid to the city of Jericho. At a minimum include Proconsul, genus Australopithecus, genus Homo, the Leakys and the Orduvai Gorge, "Lucy," Donald Johanson, Neanderthal Man, Cro-Magnon Man, Catal ..
|
Write a program generating a random maze based on prism
: Steiner tree Four villages are located at the vertices of a unit square in the Euclidean plane. You are asked to connect them by the shortest network of roads so that there is a path between every pair of the villages along those roads. Find such ..
|