a) Consider a set of monetary outcomes X = {x1, .. , xK} where the outcomes are arranged in increasing order x, < < xx. Let p and q be simple lotteries. We say that lottery p ... first-order stochastically dominates lottery q, if the following holds: K K 2 P(x,) > E9(x,) for all i = 1, ... K, j=i j=i with at least one of the inequalities being strict. Explain the intuition of first-order stochas- tic dominance. Show that, for expected utility preferences with vNM utility u that is strictly increasing in money, if p first-order stochastically dominates q then p > q.

a) Consider a set of monetary outcomes X = {x1, .. , xK} where the outcomes are arranged in increasing order x, < < xx. Let p and q be simple lotteries. We say that lottery p ... first-order stochastically dominates lottery q, if the following holds: K K 2 P(x,) > E9(x,) for all i = 1, ... K, j=i j=i with at least one of the inequalities being strict. Explain the intuition of first-order stochas- tic dominance. Show that, for expected utility preferences with vNM utility u that is strictly increasing in money, if p first-order stochastically dominates q then p > q.

ENGR.ECONOMIC ANALYSIS

14th Edition

ISBN:9780190931919

Author:NEWNAN

Publisher:NEWNAN

Chapter1: Making Economics Decisions

Section: Chapter Questions

Problem 1QTC

See similar textbooks

Similar questions

(b) Assume that utility U is a function of wealth X given by U = X.5 and that X = $1,000,000. In this part of the question, assume that the game ends if the first head has not occurred after 40 tosses of the coin. In that case, the payoff is 240 and the game is over. What is the expected payout of this game?
Consider the game in the image attached below, which is infinitely repeated at t = 1, 2, ... Both players discount the future at rate: delta E (0, 1). The stage game is in the image attached. "Grim Trigger" strategies: Describe the "Grim Trigger" strategy profile of this game. Draw the finite automata representation of this strategy profile. Find the lowest value of delta for this strategy profile to form a subgame perfect equilibrium.
(The All-Pay Auction). The seller has an item for sale. The valuations of the bidders are independently and identically distributed on R+ with a c.d.f. F. Find the symmetric equilibrium of an auction with two bidders in which both bidders pay their own bids but only the highest bidder wins the object. Show that each bidder’s expected payment is the same in this auction and in the first-price auction.
Suppose there are two bidders for a single object. Each bidder has a value for the object, v1 and v2, which is randomly drawn uniformly from 0 to 80. (Note that this means the probability that a value is 25 or lower is 25/80, and more generally, the probability that a value is k or lower is k/80). Bidders see their own values but not the values of their rival bidders. Consider a first price sealed bid auction where the winner of the object is the bidder who submits the highest bid and pays the price that he bid. Suppose that you are bidder 1 and you believe that your rival always bids a constant fraction α of his value. (For example, if bidder 2’ value is 15, he will bid 15α.). 1. What is your expected winning probability of the auction from any given bid b1? (Hint, you win the auction when your bid amount b1 is greater than your opponent’s bid). 2. What is your expected payoff from any given bid, b1? (You need to write your answer as a function of v1, b1, and α). 3. Compute your best…
Exercise 1.8. Consider the following "third-price" auction. There are n≥ 3 bidders. A single object is auctioned and Player / values the object $v,, with V, > 0. The bids are simultaneous and secret. The utility of Player / is: 0 if she does not win and (v-p) if she wins and pays $p. Every non-negative number is an admissible bid. Let b, denote the bid of Player i. The winner is the highest bidder. In case of ties the bidder with the lowest index among those who submitted the highest bid wins (e.g. if the highest bid is $120 and it is submitted by players 6, 12 and 15, then the winner is Player 6). The losers don't get anything and don't pay anything. The winner gets the object and pays the third highest bid, which is defined as follows. Let be the winner and fix a Player j such that b₁ = max({b,,...,b,}\ {b}) [if GAME THEORY - Giacomo Bonanno 39 max({b,...,b}\{b;}) contains more than one element, then we pick one of them]. Then the third price is defined as max({b₁,...,b}\{b,,b;}).…
a) Consider a set of monetary outcomes X = {x1,...,Xk} where the outcomes are arranged in increasing order x, E q(x,) for all i = 1, ... K, j=i j=i with at least one of the inequalities being strict. Explain the intuition of first-order stochas- tic dominance. Show that, for expected utility preferences with vNM utility u that is strictly increasing in money, if p first-order stochastically dominates q then p > q.
Let A be an m x n matrix representing the payoff of n securities in m states of the world. If the market is complete, which of the following statements are true? Provide counter examples in case not. (a) A is of full rank (b) A is invertible (c) The prices of n securities are free of arbitrage
Please try to solve it in 30 minute
Repeated Game Consider the game below, which is infinitely repeated at t = 1,2, .... Both players discount the future at rate d E (0, 1). The stage game is C C 5,5 0,6 D 6,0 1,1 1. The following three questions are about "Grim Trigger" strategies. (a) Describe the "Grim Trigger" strategy profile of this game. (b) Draw the finite automata representation of this strategy profile. (c) Find the lowest value of 8 for this strategy profile to form a subgame perfect equilibrium. 2. Suppose that the players play (C,C) in period t = 1, 3, 5, ... and plays (D,D) in period t = 2,4, 6, ... Compute the discounted payoff of each player. 3. Find a subgame perfect equilibrium such that, on the equilibrium path, (D,D) is played at periods t = 1, 3, 5, ..., and (C,C) is played at periods t = 2, 4, 6, ... Write down the finite automata representation for the strategy profile you proposed. Find the lowest value of d for the profile to form a subgame perfect equilibrium.
Consider the version of the Beauty Contest game from the class, in which the players are trying to guess the average guess minus one. More precisely, the utilities now are: ui (si; sj ) = -|si-(-1)| where sj/#l forj belong tI (a) Which strategies are strictly dominated in this game, and by which alternative strategies? And so, what is the set of strategies BR11 (b) What is the set BR21 ? What is the set BRni for any n > 0?
There are three bidders participating in a first-price auction for a painting. Each bidder has a private, independent value vi for such a painting that is drawn uniformly from [0,1] Assume that each bidder i has a linear bidding function bi=avi, where a>0. What is the bidding strategy of bidder i , namely bi in the Bayesian equilibrium?
Consider the following payoff matrix B R U 7, 7 4,17 A 17,4 6,6 Players A and B repeatedly play this game with an infinite horizon. Future payoffs are discounted with 1/(1+r), where r is the long-term interest rate. Determine the interval of r for which the Carrot-and-Stick strategy does form a Nash-equilibrium when the opponent can discover any deviation immediately. Remember the following relation TA+Lt-1 (14+t) TB TB = TA + O r>0.1 O r0.2 Or-1 O r1