Microeconomic Theory (501b) Problem Set 10. Auctions and Moral Hazard Suggested Solution: Tibor Heumann
|
|
- Norah Dawson
- 5 years ago
- Views:
Transcription
1 Dirk Bergemann Department of Economics Yale University Microeconomic Theory (50b) Problem Set 0. Auctions and Moral Hazard Suggested Solution: Tibor Heumann 4/5/4 This problem set is due on Tuesday, 4//4.. Budget Balanced Mechanism. We say that the mechanism (x ( ), t ( )) satisfies ex-post budget balance if for all θ, N t i (θ) = 0. i= For an environment with independently distributed types, we define the D Aspremont Gerard-Varet mechanism or expected externality mechanism by x (m), the social choice function that maximizes the sum of the utilityes, and transfers t i (m) = E θ i v j (x (m i, m i ), m j ) + τ i (m i ). j i In this direct mechanism, m i refers to the message and θ i is the type of agent i. The social choice function x ( ) maximizes the sum of the agents welfare. The term τ i (m i ) is function that depends only the messages of the other agents. (a) Establish that m i = θ i is an optimal announcement in a Bayesian Nash equilibrium. [Solution] We need to show that: θ i arg max E θ i [v(x (θ i, θ i ), θ i ) t i (θ i, θ i )] for all i N Note that, [ E θ i [v(x (θ i, θ i ), θ i ) t i (θ i, θ i )] = E θ i v(x (θ i, θ i ), θ i ) + ] v j (x (θ i, θ i ), θ j ) τ i (θ i ) j i [ ] = E θ i v j (x (θ i, θ i ), θ j ) τ i (θ i ) j N
2 Note that by definition x (θ i, θ i ) maximizes the sum of the utilities, thus: x (θ i, θ i ) arg max v j (x, θ j ) x X j N Thus, we have that for all θ i Θ i : θ i arg max v j (x (θ i, θ i ), θ j ) θ i Θi j N Since θ i maximizes for all θ i Θ i, it must also maximize if we take expectations, thus: [ ] θ i arg max E θ i v j (x (θ i, θ i ), θ j ) θ i Θi j N Since τ i (θ i ) does not depend on θ i we have that: [ ] θ i arg max E θ i v j (x (θ i, θ i ), θ j ) τ i (θ i ) θ i Θi Thus, we have that: j N θ i arg max E θ i [v(x (θ i, θ i ), θ i ) t i (θ i, θ i )] for all i N Thus, truth telling is a Bayes Nash equilibrium. (b) We can define the expected externality of agent i with type m i as: E i (m i ) = E θ i v j (x (m i, θ i ), θ j ), and set j i j i τ i (m i ) = E j (m j ). N Show that this mechanism satisfies the balanced budget requirement ex post for every type profile realization. [Solution] By definition, we have that:
3 t i (m) = E θ i v j (x (m i, m i ), m j ) + τ i (m i ) i N i N j i i N = E θ i v j (x (m i, m i ), m j ) + j i E j (m j ) N i N j i i N = E θ i v j (x (m i, m i ), m j ) + i j E j (m j ). N i N j i j N = E θ i v j (x (m i, m i ), m j ) + E j (m j ) i N j i j N = E θ i v j (x (m i, m i ), m j ) + [ E θ i v j (x (m i, θ i ), θ j ) i N j i i N j i = 0. Where in the last equality we use that if all agents report truthfully (which is a Bayes Nash equilibrium), then (m i, m i ) = (θ i, θ i ). (c) Is this mechanism also dominant strategy implementable? [Solution] No. Consider the standard auction environment with two agents. If one of the agent bids always zero, then the other agent will win the object with strictly positive bid. Yet, the transfers will now not be constant, independent of what the agent announces. Thus, truthful bidding cannot be optimal strategy for all possible types for an agent when the other agent is always bidding zero. Thus, it is not implementable in dominant strategies. (d) Compute the transfers exactly for the single unit auction with two bidders and uniformly distributed values. Do the transfers guarantee the individiual rationality constraints for all the type profile of the agents? [Solution] We assume that the types are uniformly distributed in [0,]. Thus: ] E i (m i ) = E θj v j (x (m i, θ j ), θ j ) = E θj [ θ j θj>m i ] = ( m i ) + m i = m i, Similarly, we also have: E θ i v j (x (m i, m i ), m j ) = m i j i 3
4 Thus, we have that: t i (m) = E θ i v j (x (m i, m i ), m j ) +τ i (m i ) = m i j i Thus, in the truthful Bayes Nash equilibrium, we have that: + m j. m i + m j = θ i + θ j Thus, the expected utility of agent i is given by: = θ i θ j E[θ i θi>θ j + θ i θ j ] = + θ i E[ θ j ] = θ i +E[θ j ] = θ i + 6 > 0. Thus, the individual rationality constraint is satisfied. Note that in a second price auction the expected utility of an agent is given by θ i. Yet, on a second price auction the seller runs a budget surplus, as he in general earns money. In this case the mechanism satisfied budget balance, and thus the agents must earn more expected rents. Moreover, from the revenue equivalence theorem, one can already know that the expected utility of a agent i of type i is given by θ i plus some constant. In this case the constant is /6 which corresponds to the additional rents the agents get with respect to a second price auction. 0. Nonlinear Pricing. Consider the problem of an optimal menu when v(θ, q) = θ q and c(q) = q and the distribution is given by the uniform distribution on the unit interval. (a) Compute the revenue maximizing direct mechanism, which associates to every reported type θ a pair (q(θ), t(θ)) of quantities q(θ) and prices t(θ), or θ (q(θ), t(θ)) The problem of the seller is (as we saw in class) max q(θ) θ 0 { q(θ) [ θ Which, in this case, implies max q(θ) θ 0 ] } ( F (θ)) c(q(θ)) df (θ) f(θ) { q(θ) [θ ] q(θ) } df (θ) First, note that q(θ) > 0 if and only if [ θ ] ( F (θ)) f(θ) = θ > 0 θ > /. We can conclude immediately that q(θ) = t(θ) = 0 if θ /. 4
5 Now, if θ > /, then, maximizing the above expression pointwise, we get: q(θ) / [θ ] = 0 q(θ) = (θ ) 4 Now, remember that the transfer t(θ) must satisfy the (IC) restriction: t (θ) = v(θ,q) q.q (θ). Therefore if θ > /, then, t (θ) = θ q(θ).q (θ) = θ = t(θ) = θ 8 where the last line comes from integrating t (.) form / to θ. Therefore the direct mechanism that maximizes expected profit is ( ( (θ ) θ (q(θ), t(θ)) =, 4 )).[θ > /] 8 where [.] is the indicator function. (b) Translate the direct mechanism into an indirect mechanism, in particular to a nonlinear pricing mechanism (q, t(q)) which associates to every q a t(q), or q, t(q). First of all, let s invert q(θ). If θ > /, then q = (θ ) 4 = θ = q +. Therefore, we must have that t(q) = ( q+ ) 8. Hence, ( ) q + q t(q) = and the direct mechanism is given by ( ( )) q + q. (q, t(q)) = q,, where q [0, 4 ] (c) What can you say about t(q)/q, i.e. the price per quantity as the quantity increases. We have that ( ) q + q t(q) q which is decreasing in q. = q = + q 5
6 (d) Establish that the revenue maximizing direct mechanism could also be implemented by a menu of two part-tariffs, (T (θ), p (θ)), where T (θ) is the fixed fee and p (θ) is the price per unit (i.e. if a customer chooses a particular two-part tariff then he has to pay T (θ) independent of the quantity he purchase, but can then buy as many units as he likes at the price p (θ) per unit. (The concavity of t (q) might be useful.) We just need to impose that the price is equal to the marginal utility of agents for the good at the optimal mechanism. That is, p(θ) = v (q(θ), θ) = θ = θ q θ. It is clear the when agents solve, max v(q, θ) p(θ)q q they will choose q(θ). The fixed transfer is chosen to match the total transfers in the optimal mechanism. That is, T (θ) + q(θ)p(θ) = t(θ). Thus, ( θ T (θ) = t(θ) q(θ)p(θ) = ) θ (θ ) 8 θ 4 ( θ = 8 ) θ(θ ) 4 It is clear that the mechanism (p(θ), T (θ)) implemented the same outcome as (q(θ), t(θ)).. Consider the regular moral hazard model with a risk-neutral principal and a risk averse agent. The agent can choose between two effort levels, a i {a, a} with associated cost c i {c, c} = {0, c}, with c > 0. Each action generates stochastically one of two possible profit levels, x i {x, x} with p (x a) > p (x a). The utility function of the agent is u (w, c i ) = ln w c i. The value of the outside option is normalized to 0. (Risk-neutrality of the principal implies that his payoff function is x w.) a. Carefully describe the principal-agent problem when the principal wishes to implement the high effort level a. The principal solves the following problem 6
7 such that max p (ā) (x w (x)) + ( p (ā)) (x w ( x)) w(x),w(x) p (ā) ln (w (x)) + ( p (ā)) ln (w ( x)) c 0 (IR) p (ā) ln (w (x))+( p (ā)) ln (w ( x)) c p (a) ln (w (x))+( p (a)) ln (w ( x)) (IC) b. Solve explicitly for the optimal wage schedule to be offered to the agent which implements the high effort level a. Consider the first-order conditions for the principal s problem in (a) : p (ā) + λp (ā) w (x) + µ [p (ā) p (a)] w (x) ( p (ā)) + λ ( p (ā)) w ( x) µ [p (ā) p (a)] w ( x) = 0 = 0. from which you can obtain w (x) = w ( x) = λp (ā) + µ (p (ā) p (a)) p (ā) λ ( p (ā)) µ [p (ā) p (a)] p (ā) p (ā) p (a) = λ + µ p (ā) p (ā) p (a) = λ µ p (ā) which implies w (x) < w ( x) since µ > 0. Notice however, that since both constraints are binding, you can directly solve for w (x), w ( x) from the constraints (since the objective function is decreasing in wages). Equating the RHS of the IR,IC: p (a) ln (w (x)) + ( p (a)) ln (w ( x)) = 0 one then obtains (from IR) ln (w (x)) = p (a) p (a) ln (w ( x)) p (a) p (ā) ln (w ( x)) + ( p (ā)) ln (w ( x)) p (a) = c ln (w ( x)) = p (a) c p (a) p (ā) ln (w (x)) = c p (a) p (a) p (ā). c. (Renegotiation ) Consider now the following extension to the moral hazard problem. After the principal has offered an (arbitrary) 7
8 wage schedule and the agent has chosen and performed an (arbitrary) effort level, but before x is revealed, the principal has the possibility to offer a new contract to the agent. The agent can either accept or reject the new offer. If he accepts the new contract, then it replaces the old contract, if he rejects the new contract, then the old one remains in place. Show that there is no subgame perfect equilibrium of the game where Pr (a = a) =. (Hint: Consider the optimal contract after a has been chosen but before x has been realized.) Consider an equilibrium candidate in which the agent chooses ā. In such a scenario, the principal can make a renegotiation offer by which he perfectly insures the agent at the level u the principal had previously offered him. For example, if the IR was binding in the first stage, u = c. A full-insurance contract maximizes the principal s profits and delivers the same expected utility level (under ā) to the agent. Hence, it Pareto-dominates any (previous) contractual arrangement. Anticipating this offer, the agent will shirk (cost=0) in the action choice stage and earn a guaranteed profit of u in the following stage. Since the principal cannot credibly commit not to renegotiate (and offer full insurance) there is no equilibrium in which the agent will choose to work hard. d. (Renegotiation ) Consider now the following modification to the renegotiation problem above. Suppose now that the agent can make the new proposal and the principal can either accept or reject the new offer. Suppose further that the principal can observe the action at the time of the new proposal but that the contract can only depend on x and not on a. The timing is otherwise unchanged. Derive the subgame perfect equilibrium of the principal-agent problem. What can you say about the efficiency of the arrangement. Backward induction. Knowing the action level (hence the actual probability distribution over outcomes), the principal will accept any offer that gives him a higher profit level than under the previous contract. For a given contract w 0 the agent will therefore demand perfect insurance at a wage w (a, w 0 ) = p (a) w 0 (x) + ( p (a)) w 0 ( x). Depending on w 0, the agent will choose whether or not to work hard. In particular, he will choose ā iff ln (p (ā) w 0 (x) + ( p (ā)) w 0 ( x)) c ln (p (a) w 0 (x) + ( p (a)) w 0 ( x)) Assume the principal still wants to induce high effort. The principal s problem in the first stage is now given by: max p (ā) (x w 0 (x)) + ( p (ā)) (x w 0 ( x)) w 0(x),w 0(x) 8
9 such that ln (p (ā) w 0 (x) + ( p (ā)) w 0 ( x)) c 0 (IR) ln (p (ā) w 0 (x) + ( p (ā)) w 0 ( x)) c ln (p (a) w 0 (x) + ( p (a)) w 0 ( x)) (IC) Again, solving directly from the constraints, w ( x) = ec p(a) p(ā) p(a) p(ā) w (x) = ec ( p(a)) ( p(ā)). p(ā) p(a) The agent thus receives the same ex-ante utility level as in the norenegotiation case. Ex-post, he is perfectly insured, hence efficiency is improved. Note also that the principal is much better off, since he appropriates the entire ex-ante surplus gain deriving from postrenegotiation insurance (to see this, just compare the expected payments under IR in the two cases - use Jensen s inequality). 3. (Moral Hazard in Teams, (Holmstrom 98)) Consider the following moral hazard problem with many agents. Suppose output is onedimensional, deterministic and concave in a i and depends on the effort of the n agents in the team: x = x(a, a,..., a n ). Each agent i has convex effort cost c i (a i ). Each agent observe his effort and the joint output x. A contract among the agents is a set of wages {w i (x)} n i=, which depend only on the publicly observable output x. The set of wages have to be budget balanced, or n w i (x) = x i= for all x. (Think of the team as a cooperative or partnership). The utility function of each agent is w i (x) c i (a i ). a. Describe the first-best allocation policy a. The social planner s problem is max (a i) n i= (w i (x (a,..., a n )) c i (a i )) i s.t. w i (x) = x i s.t. w i (x) c i (a i ) ū i i 9
10 rewriting this program neglecting for now the participation constraints gives [ ] max a i The st order condition is x (a,..., a n ) i x (a ) a i = c i (a i ) i c i (a i ) which simply prescribes marginal productivity=marginal cost. Note that - absent incentive problems - the wage allocation among the agents does not influence the planner s choice of a. Any vector of (wi )n i= that verifies the participation and resource constraints will do. b. Suppose (without loss of generality) that the team is restricted to using differentiable wages, or w i (x) exists for all x and i. Show that there is no wage schedule which allows the team to realize the first best policy. Suppose wage schedules are differentiable. Since each individual maximizes w i (x (a)) c i (a i ), she will choose a i : w i (x (a )) x (a ) a i c i (a i ) = 0 therefore w i (x (a )) = i. However, since the resource constraint must hold for any x, you can differentiate both sides and obtain i w i (x) =. This means that in order to induce the first best actions, each agents would have to be able to appropriate any production gains associated to anyone s effort. This is obviously not feasible. c. Next, introduce an n + th, who does not deliver any effort to the team, but can be entitled to transfers (the principal or budgetbreaker ). Show that you can now design a wage schedule, not necessarily differentiable, such that n+ w i (x) = x i= for all x. In fact, you can design the contract such that even n w i (x) = x i= holds on the equilibrium path, but not off the equilibrium path. 0
11 The idea is to punish the agents if they do not exert the optimal effort level. Hence, set the effort levels at a i. Then let the wages be given by { } w w i (x) = i if x = x (a ) 0 if x x (a i =,.., n ) { } 0 if x = x (a w n+ = ) x (a) if x x (a ) With these wages, no agent has incentives to deviate. Furthermore, actions need not be observable since technology is deterministic, and each deviation from a i will induce a non-optimal production level x x (a ). Therefore, a i i is an equilibrium of this game. 4. (First Order Stochastic Dominance versus Monotone Likelihood Ratio, (Milgrom 98)). a. Define monotone likelihood ratio and first-order stochastic dominance. Definitions: MLR : F OSD : p (x j a i ) p (x j a k ) increasing in x j k < i p (x j x a i ) x, k < i p (x j x a k ) b. Show that with two outcomes, the two notion are equivalent. Two outcomes: x < x, two actions a < a. Then MLR p (x a) p (x a ) > p (x a) p (x a ) p (x a) p (x a ) > p (x a) p (x a ) p (x a ) > p (x a) F OSD. c. Give an example to show that the equivalence does not hold in general. Show that the monotone likelihood ratio property implies first order stochastic dominance. Example: consider the following distributions (with a < a) x p 0 p (x a) 0 p (x a ) 0
12 The distribution under a is stochastically dominated by the one under a (the cdfs coincide after, but the former starts out lower) but the likelihood ratios are clearly non monotone in x. Proof. MLR F OSD : Let again a < a. Let x {x,..., x n }. Then MLR p(x a) p(x a ) < (since this ratio is monotone, if it were otherwise the two distributions could not both integrate to ). However, there p(x a) must exist an x : p(x a ). Let ˆx be the first such x. For all x < ˆx, it must be p (x j x a) < p (x j x a ) by definition of LR <. For all x ˆx it must also be the case that p (x j x a) p (x j x a ), else there would have to exist x k [ˆx, x n ] for which p (x k a) < p (x k a ) (otherwise the two distributions couldn t both integrate to ). This would however violate MLR, since LR at ˆx < x k. Reading MWG: 3, S (=Salanie) and 3
Mechanism Design: Bayesian Incentive Compatibility
May 30, 2013 Setup X : finite set of public alternatives X = {x 1,..., x K } Θ i : the set of possible types for player i, F i is the marginal distribution of θ i. We assume types are independently distributed.
More informationEC476 Contracts and Organizations, Part III: Lecture 2
EC476 Contracts and Organizations, Part III: Lecture 2 Leonardo Felli 32L.G.06 19 January 2015 Moral Hazard: Consider the contractual relationship between two agents (a principal and an agent) The principal
More informationMechanism Design: Basic Concepts
Advanced Microeconomic Theory: Economics 521b Spring 2011 Juuso Välimäki Mechanism Design: Basic Concepts The setup is similar to that of a Bayesian game. The ingredients are: 1. Set of players, i {1,
More informationNTU IO (I) : Auction Theory and Mechanism Design II Groves Mechanism and AGV Mechansim. u i (x, t i, θ i ) = V i (x, θ i ) + t i,
Meng-Yu Liang NTU O : Auction Theory and Mechanism Design Groves Mechanism and AGV Mechansim + 1 players. Types are drawn from independent distribution P i on [θ i, θ i ] with strictly positive and differentiable
More informationLecture Slides - Part 4
Lecture Slides - Part 4 Bengt Holmstrom MIT February 2, 2016. Bengt Holmstrom (MIT) Lecture Slides - Part 4 February 2, 2016. 1 / 65 Mechanism Design n agents i = 1,..., n agent i has type θ i Θ i which
More informationMechanism Design: Review of Basic Concepts
Juuso Välimäki Oslo Minicourse in Mechanism Design November 206 Mechanism Design: Review of Basic Concepts Single Agent We start with a review of incentive compatibility in the simplest possible setting:
More informationx ax 1 2 bx2 a bx =0 x = a b. Hence, a consumer s willingness-to-pay as a function of liters on sale, 1 2 a 2 2b, if l> a. (1)
Answers to Exam Economics 201b First Half 1. (a) Observe, first, that no consumer ever wishes to consume more than 3/2 liters (i.e., 1.5 liters). To see this, observe that, even if the beverage were free,
More informationEconS Microeconomic Theory II Midterm Exam #2 - Answer Key
EconS 50 - Microeconomic Theory II Midterm Exam # - Answer Key 1. Revenue comparison in two auction formats. Consider a sealed-bid auction with bidders. Every bidder i privately observes his valuation
More informationNotes on Mechanism Designy
Notes on Mechanism Designy ECON 20B - Game Theory Guillermo Ordoñez UCLA February 0, 2006 Mechanism Design. Informal discussion. Mechanisms are particular types of games of incomplete (or asymmetric) information
More informationModule 8: Multi-Agent Models of Moral Hazard
Module 8: Multi-Agent Models of Moral Hazard Information Economics (Ec 515) George Georgiadis Types of models: 1. No relation among agents. an many agents make contracting easier? 2. Agents shocks are
More informationA Preliminary Introduction to Mechanism Design. Theory
A Preliminary Introduction to Mechanism Design Theory Hongbin Cai and Xi Weng Department of Applied Economics, Guanghua School of Management Peking University October 2014 Contents 1 Introduction 3 2 A
More informationInformed Principal in Private-Value Environments
Informed Principal in Private-Value Environments Tymofiy Mylovanov Thomas Tröger University of Bonn June 21, 2008 1/28 Motivation 2/28 Motivation In most applications of mechanism design, the proposer
More informationGame Theory. Monika Köppl-Turyna. Winter 2017/2018. Institute for Analytical Economics Vienna University of Economics and Business
Monika Köppl-Turyna Institute for Analytical Economics Vienna University of Economics and Business Winter 2017/2018 Static Games of Incomplete Information Introduction So far we assumed that payoff functions
More informationCPS 173 Mechanism design. Vincent Conitzer
CPS 173 Mechanism design Vincent Conitzer conitzer@cs.duke.edu edu Mechanism design: setting The center has a set of outcomes O that she can choose from Allocations of tasks/resources, joint plans, Each
More informationGame Theory, Information, Incentives
Game Theory, Information, Incentives Ronald Wendner Department of Economics Graz University, Austria Course # 320.501: Analytical Methods (part 6) The Moral Hazard Problem Moral hazard as a problem of
More informationGame Theory. Lecture Notes By Y. Narahari. Department of Computer Science and Automation Indian Institute of Science Bangalore, India July 2012
Game Theory Lecture Notes By Y. Narahari Department of Computer Science and Automation Indian Institute of Science Bangalore, India July 2012 Myerson Optimal Auction Note: This is a only a draft version,
More informationSequential Bidding in the Bailey-Cavallo Mechanism
Sequential Bidding in the Bailey-Cavallo Mechanism Krzysztof R. Apt 1,2 and Evangelos Markakis 2 1 CWI, Science Park 123, 1098 XG Amsterdam 2 Institute of Logic, Language and Computation, University of
More informationThe Revenue Equivalence Theorem 1
John Nachbar Washington University May 2, 2017 The Revenue Equivalence Theorem 1 1 Introduction. The Revenue Equivalence Theorem gives conditions under which some very different auctions generate the same
More informationIntroduction to Mechanism Design
Introduction to Mechanism Design Xianwen Shi University of Toronto Minischool on Variational Problems in Economics September 2014 Introduction to Mechanism Design September 2014 1 / 75 Mechanism Design
More informationTeoria das organizações e contratos
Teoria das organizações e contratos Chapter 6: Adverse Selection with two types Mestrado Profissional em Economia 3 o trimestre 2015 EESP (FGV) Teoria das organizações e contratos 3 o trimestre 2015 1
More informationPh.D. Preliminary Examination MICROECONOMIC THEORY Applied Economics Graduate Program June 2016
Ph.D. Preliminary Examination MICROECONOMIC THEORY Applied Economics Graduate Program June 2016 The time limit for this exam is four hours. The exam has four sections. Each section includes two questions.
More informationMoral Hazard: Hidden Action
Moral Hazard: Hidden Action Part of these Notes were taken (almost literally) from Rasmusen, 2007 UIB Course 2013-14 (UIB) MH-Hidden Actions Course 2013-14 1 / 29 A Principal-agent Model. The Production
More informationHidden information. Principal s payoff: π (e) w,
Hidden information Section 14.C. in MWG We still consider a setting with information asymmetries between the principal and agent. However, the effort is now perfectly observable. What is unobservable?
More informationSolution: Since the prices are decreasing, we consider all the nested options {1,..., i}. Given such a set, the expected revenue is.
Problem 1: Choice models and assortment optimization Consider a MNL choice model over five products with prices (p1,..., p5) = (7, 6, 4, 3, 2) and preference weights (i.e., MNL parameters) (v1,..., v5)
More informationSome Notes on Adverse Selection
Some Notes on Adverse Selection John Morgan Haas School of Business and Department of Economics University of California, Berkeley Overview This set of lecture notes covers a general model of adverse selection
More informationMechanism Design II. Terence Johnson. University of Notre Dame. Terence Johnson (ND) Mechanism Design II 1 / 30
Mechanism Design II Terence Johnson University of Notre Dame Terence Johnson (ND) Mechanism Design II 1 / 30 Mechanism Design Recall: game theory takes the players/actions/payoffs as given, and makes predictions
More informationGame Theory and Economics of Contracts Lecture 5 Static Single-agent Moral Hazard Model
Game Theory and Economics of Contracts Lecture 5 Static Single-agent Moral Hazard Model Yu (Larry) Chen School of Economics, Nanjing University Fall 2015 Principal-Agent Relationship Principal-agent relationship
More informationLecture 10: Mechanism Design
Computational Game Theory Spring Semester, 2009/10 Lecture 10: Mechanism Design Lecturer: Yishay Mansour Scribe: Vera Vsevolozhsky, Nadav Wexler 10.1 Mechanisms with money 10.1.1 Introduction As we have
More informationGraph Theoretic Characterization of Revenue Equivalence
Graph Theoretic Characterization of University of Twente joint work with Birgit Heydenreich Rudolf Müller Rakesh Vohra Optimization and Capitalism Kantorovich [... ] problems of which I shall speak, relating
More informationAdvanced Microeconomics
Advanced Microeconomics ECON5200 - Fall 2012 Introduction What you have done: - consumers maximize their utility subject to budget constraints and firms maximize their profits given technology and market
More informationMonopoly with Resale. Supplementary Material
Monopoly with Resale Supplementary Material Giacomo Calzolari Alessandro Pavan October 2006 1 1 Restriction to price offers in the resale ultimatum bargaining game In the model set up, we assume that in
More informationIntroduction: Asymmetric Information and the Coase Theorem
BGPE Intensive Course: Contracts and Asymmetric Information Introduction: Asymmetric Information and the Coase Theorem Anke Kessler Anke Kessler p. 1/?? Introduction standard neoclassical economic theory
More informationG5212: Game Theory. Mark Dean. Spring 2017
G5212: Game Theory Mark Dean Spring 2017 Adverse Selection We have now completed our basic analysis of the adverse selection model This model has been applied and extended in literally thousands of ways
More informationPh.D. Preliminary Examination MICROECONOMIC THEORY Applied Economics Graduate Program May 2012
Ph.D. Preliminary Examination MICROECONOMIC THEORY Applied Economics Graduate Program May 2012 The time limit for this exam is 4 hours. It has four sections. Each section includes two questions. You are
More informationVickrey Auction. Mechanism Design. Algorithmic Game Theory. Alexander Skopalik Algorithmic Game Theory 2013 Mechanism Design
Algorithmic Game Theory Vickrey Auction Vickrey-Clarke-Groves Mechanisms Mechanisms with Money Player preferences are quantifiable. Common currency enables utility transfer between players. Preference
More informationWhat happens when there are many agents? Threre are two problems:
Moral Hazard in Teams What happens when there are many agents? Threre are two problems: i) If many agents produce a joint output x, how does one assign the output? There is a free rider problem here as
More informationMechanism Design. Christoph Schottmüller / 27
Mechanism Design Christoph Schottmüller 2015-02-25 1 / 27 Outline 1 Bayesian implementation and revelation principle 2 Expected externality mechanism 3 Review questions and exercises 2 / 27 Bayesian implementation
More informationDeceptive Advertising with Rational Buyers
Deceptive Advertising with Rational Buyers September 6, 016 ONLINE APPENDIX In this Appendix we present in full additional results and extensions which are only mentioned in the paper. In the exposition
More informationLecture Notes in Information Economics
Lecture Notes in Information Economics Juuso Valimaki February, 2014 Abstract These lecture notes are written for a rst-year Ph.D. course in Microeconomic Theory. They are based on teaching material from
More informationFinal Exam (Solution) Economics 501b Microeconomic Theory
Dirk Bergemann and Johannes Hoerner Department of Economics Yale Uniersity Final Exam (Solution) Economics 5b Microeconomic Theory May This is a closed-book exam. The exam lasts for 8 minutes. Please write
More informationMicroeconomics II Lecture 4: Incomplete Information Karl Wärneryd Stockholm School of Economics November 2016
Microeconomics II Lecture 4: Incomplete Information Karl Wärneryd Stockholm School of Economics November 2016 1 Modelling incomplete information So far, we have studied games in which information was complete,
More informationMechanism Design with Ambiguous Transfers
Mechanism Design with Ambiguous Transfers Huiyi Guo Texas A&M University December 31, 2018 1 / 27 Motivation In practice, some mechanism designers introduce uncertain rules to the mechanisms, e.g., Priceline
More information5. Relational Contracts and Career Concerns
5. Relational Contracts and Career Concerns Klaus M. Schmidt LMU Munich Contract Theory, Summer 2010 Klaus M. Schmidt (LMU Munich) 5. Relational Contracts and Career Concerns Contract Theory, Summer 2010
More informationDYNAMIC MECHANISM DESIGN: AN INTRODUCTION. Dirk Bergemann and Juuso Välimäki. August 2017 Revised June 2018
DYNAMIC MECHANISM DESIGN: AN INTRODUCTION By Dirk Bergemann and Juuso Välimäki August 2017 Revised June 2018 COWLES FOUNDATION DISCUSSION PAPER NO. 2102R COWLES FOUNDATION FOR RESEARCH IN ECONOMICS YALE
More informationThis is designed for one 75-minute lecture using Games and Information. October 3, 2006
This is designed for one 75-minute lecture using Games and Information. October 3, 2006 1 7 Moral Hazard: Hidden Actions PRINCIPAL-AGENT MODELS The principal (or uninformed player) is the player who has
More informationEconomics 2102: Final Solutions
Economics 10: Final Solutions 10 December, 006 1. Auctions with Correlated Values: Solutions (a) There are initially eight constraints. Clearly, IR hh and IR hl are redundant. Ignoring IC ll and IC lh
More informationRevenue Maximization in Multi-Object Auctions
Revenue Maximization in Multi-Object Auctions Benny Moldovanu April 25, 2017 Revenue Maximization in Multi-Object Auctions April 25, 2017 1 / 1 Literature Myerson R. (1981): Optimal Auction Design, Mathematics
More informationBayesian Games and Mechanism Design Definition of Bayes Equilibrium
Bayesian Games and Mechanism Design Definition of Bayes Equilibrium Harsanyi [1967] What happens when players do not know one another s payoffs? Games of incomplete information versus games of imperfect
More informationMoral Hazard: Part 1. April 9, 2018
Moral Hazard: Part 1 April 9, 2018 Introduction In a standard moral hazard problem, the agent A is characterized by only one type. As with adverse selection, the principal P wants to engage in an economic
More informationAn Efficient Solution to the Informed Principal Problem
An Efficient Solution to the Informed Principal Problem Sergei Severinov First version: May 2004, This Version: December 2006 Abstract In this paper I study mechanism design by an informed principal. I
More informationImplementability, Walrasian Equilibria, and Efficient Matchings
Implementability, Walrasian Equilibria, and Efficient Matchings Piotr Dworczak and Anthony Lee Zhang Abstract In general screening problems, implementable allocation rules correspond exactly to Walrasian
More informationMoral hazard in teams
Division of the Humanities and Social Sciences Moral hazard in teams KC Border November 2004 These notes are based on the first part of Moral hazard in teams by Bengt Holmström [1], and fills in the gaps
More informationDEPARTMENT OF ECONOMICS YALE UNIVERSITY P.O. Box New Haven, CT
DEPARTMENT OF ECONOMICS YALE UNIVERSITY P.O. Box 208268 New Haven, CT 06520-8268 http://www.econ.yale.edu/ Economics Department Working Paper No. 25 Cowles Foundation Discussion Paper No. 1619 Information
More informationGame Theory: Spring 2017
Game Theory: Spring 2017 Ulle Endriss Institute for Logic, Language and Computation University of Amsterdam Ulle Endriss 1 Plan for Today In this second lecture on mechanism design we are going to generalise
More informationRobert Gary-Bobo. NOTES ON MECHANISM DESIGN Implementation of Choice Rules
Robert Gary-Bobo NOTES ON MECHANISM DESIGN Implementation of Choice Rules ENSAE 218-219, revised in November 217 Some Implementation Theory We consider, as usual, a population of agents i = 1,..., n. Each
More informationMarket Participation under Delegated and. Intrinsic Common Agency Games
Market Participation under Delegated and Intrinsic Common Agency Games (Preliminary) David Martimort Lars A. Stole November 25, 2003 *We are grateful to Wouter Dessein, Bruno Jullien and Canice Prendergast
More informationAn Introduction to the Theory of Mechanism Design
An Introduction to the Theory of Mechanism Design Tilman Börgers December 1, 2008 Preliminary draft. Contents Preface v 1 Introduction 1 2 Screening 6 2.1 Introduction............................ 6 2.2
More informationNASH IMPLEMENTATION USING SIMPLE MECHANISMS WITHOUT UNDESIRABLE MIXED-STRATEGY EQUILIBRIA
NASH IMPLEMENTATION USING SIMPLE MECHANISMS WITHOUT UNDESIRABLE MIXED-STRATEGY EQUILIBRIA MARIA GOLTSMAN Abstract. This note shows that, in separable environments, any monotonic social choice function
More informationGeneralizing mechanism design theory to a case where agents types are adjustable
MPRA Munich Personal RePEc Archive Generalizing mechanism design theory to a case where agents types are adjustable Haoyang Wu Wan-Dou-Miao Research Lab 27 December 2018 Online at https://mpra.ub.uni-muenchen.de/90941/
More informationCS 598RM: Algorithmic Game Theory, Spring Practice Exam Solutions
CS 598RM: Algorithmic Game Theory, Spring 2017 1. Answer the following. Practice Exam Solutions Agents 1 and 2 are bargaining over how to split a dollar. Each agent simultaneously demands share he would
More informationAdverse Selection, Signaling, and Screening in Markets
BGPE Intensive Course: Contracts and Asymmetric Information Adverse Selection, Signaling, and Screening in Markets Anke Kessler Anke Kessler p. 1/27 Stylized Facts: Market Failure used cars, even if they
More informationG5212: Game Theory. Mark Dean. Spring 2017
G5212: Game Theory Mark Dean Spring 2017 Adverse Selection We are now going to go back to the Adverse Selection framework Mechanism Design with 1 agent Though that agent may be of many types Note that
More information1 Web Appendix: Equilibrium outcome under collusion (multiple types-multiple contracts)
1 Web Appendix: Equilibrium outcome under collusion (multiple types-multiple contracts) We extend our setup by allowing more than two types of agent. The agent s type is now β {β 1, β 2,..., β N }, where
More informationAdvanced Microeconomics II
Advanced Microeconomics II by Jinwoo Kim November 24, 2010 Contents II Mechanism Design 3 1 Preliminaries 3 2 Dominant Strategy Implementation 5 2.1 Gibbard-Satterthwaite Theorem........................
More informationUndominated Groves Mechanisms
Journal of Artificial Intelligence Research 46 (2013) 129-163 Submitted 09/12; published 01/13 Mingyu Guo University of Liverpool, UK Evangelos Markakis Athens University of Economics and Business, Greece
More informationMoral Hazard: Characterization of SB
Moral Hazard: Characterization of SB Ram Singh Department of Economics March 2, 2015 Ram Singh (Delhi School of Economics) Moral Hazard March 2, 2015 1 / 19 Characterization of Second Best Contracts I
More informationMechanism Design with Correlated Types
Mechanism Design with Correlated Types Until now, types θ i have been assumed 1. Independent across i, 2. Private values: u i (a, θ) = u i (a, θ i ) for all i, θ i, θ. In the next two lectures, we shall
More informationVickrey Auction VCG Characterization. Mechanism Design. Algorithmic Game Theory. Alexander Skopalik Algorithmic Game Theory 2013 Mechanism Design
Algorithmic Game Theory Vickrey Auction Vickrey-Clarke-Groves Mechanisms Characterization of IC Mechanisms Mechanisms with Money Player preferences are quantifiable. Common currency enables utility transfer
More informationLecture Notes on Solving Moral-Hazard Problems Using the Dantzig-Wolfe Algorithm
Lecture Notes on Solving Moral-Hazard Problems Using the Dantzig-Wolfe Algorithm Edward Simpson Prescott Prepared for ICE 05, July 2005 1 Outline 1. Why compute? Answer quantitative questions Analyze difficult
More informationRobust Mechanism Design and Robust Implementation
Robust Mechanism Design and Robust Implementation joint work with Stephen Morris August 2009 Barcelona Introduction mechanism design and implementation literatures are theoretical successes mechanisms
More informationContracts in informed-principal problems with moral hazard
Contracts in informed-principal problems with moral hazard Nicholas C Bedard January 20, 2016 Abstract In many cases, an employer has private information about the potential productivity of a worker, who
More informationUniversity of Warwick, Department of Economics Spring Final Exam. Answer TWO questions. All questions carry equal weight. Time allowed 2 hours.
University of Warwick, Department of Economics Spring 2012 EC941: Game Theory Prof. Francesco Squintani Final Exam Answer TWO questions. All questions carry equal weight. Time allowed 2 hours. 1. Consider
More informationGame Theory. Lecture Notes By Y. Narahari. Department of Computer Science and Automation Indian Institute of Science Bangalore, India July 2012
Game Theory Lecture Notes By Y. Narahari Department of Computer Science and Automation Indian Institute of Science Bangalore, India July 2012 Properties of Social Choice Functions Note: This is a only
More informationStatic Information Design
Static Information Design Dirk Bergemann and Stephen Morris Frontiers of Economic Theory & Computer Science, Becker-Friedman Institute, August 2016 Mechanism Design and Information Design Basic Mechanism
More informationFull Surplus Extraction and Costless Information Revelation in Dynamic Environments. Shunya NODA (University of Tokyo)
Full Surplus Extraction and Costless Information Revelation in Dynamic Environments Shunya NODA (University of Tokyo) Outline 1. Introduction. Two-Period Example 3. Three-Period Example 4. Model 5. Main
More informationGame Theory. Lecture Notes By Y. Narahari. Department of Computer Science and Automation Indian Institute of Science Bangalore, India July 2012
Game Theory Lecture Notes By Y. Narahari Department of Computer Science and Automation Indian Institute of Science Bangalore, India July 2012 The Vickrey-Clarke-Groves Mechanisms Note: This is a only a
More informationInformation Acquisition in Interdependent Value Auctions
Information Acquisition in Interdependent Value Auctions Dirk Bergemann Xianwen Shi Juuso Välimäki July 16, 2008 Abstract We consider an auction environment with interdependent values. Each bidder can
More informationLecture 4. 1 Examples of Mechanism Design Problems
CSCI699: Topics in Learning and Game Theory Lecture 4 Lecturer: Shaddin Dughmi Scribes: Haifeng Xu,Reem Alfayez 1 Examples of Mechanism Design Problems Example 1: Single Item Auctions. There is a single
More informationThe Design of Ambiguous Mechanisms
The Design of Ambiguous Mechanisms Alfredo Di Tillio Bocconi University Nenad Kos Bocconi University Matthias Messner Bocconi University and CESifo January 9, 2012 First version: April 2011 Abstract This
More informationThe Principal-Agent Problem
Andrew McLennan September 18, 2014 I. Introduction Economics 6030 Microeconomics B Second Semester Lecture 8 The Principal-Agent Problem A. In the principal-agent problem there is no asymmetric information
More informationWelfare Undominated Groves Mechanisms
Welfare Undominated Groves Mechanisms Krzysztof Apt 1,2, Vincent Conitzer 3, Mingyu Guo 3, and Evangelos Markakis 1 1 Centre for Math and Computer Science (CWI, Amsterdam, The Netherlands {apt, vangelis}@cwi.nl
More informationMoral Hazard in Teams
Moral Hazard in Teams Ram Singh Department of Economics September 23, 2009 Ram Singh (Delhi School of Economics) Moral Hazard September 23, 2009 1 / 30 Outline 1 Moral Hazard in Teams: Model 2 Unobservable
More informationBayes Correlated Equilibrium and Comparing Information Structures
Bayes Correlated Equilibrium and Comparing Information Structures Dirk Bergemann and Stephen Morris Spring 2013: 521 B Introduction game theoretic predictions are very sensitive to "information structure"
More informationOptimal Auctions with Correlated Bidders are Easy
Optimal Auctions with Correlated Bidders are Easy Shahar Dobzinski Department of Computer Science Cornell Unversity shahar@cs.cornell.edu Robert Kleinberg Department of Computer Science Cornell Unversity
More informationDecision, Risk and Operations Working Papers Series
Decision, Risk and Operations Working Papers Series The cost of moral hazard and limited liability in the principal-agent problem F. Balmaceda, S. R. Balseiro, J. R. Correa, N. E. Stier-Moses July 2010;
More informationRedistribution Mechanisms for Assignment of Heterogeneous Objects
Redistribution Mechanisms for Assignment of Heterogeneous Objects Sujit Gujar Dept of Computer Science and Automation Indian Institute of Science Bangalore, India sujit@csa.iisc.ernet.in Y Narahari Dept
More informationSupplementary material to Procurement with specialized firms
Supplementary material to Procurement with specialized firms Jan Boone and Christoph Schottmüller January 27, 2014 In this supplementary material, we relax some of the assumptions made in the paper and
More information1.1 A Simple Model of Price Discrimination Full Information Benchmark: First-Best Outcome or Perfect Price
Contract Theory Contents 1 Hidden Information: Screening 6 1.1 A Simple Model of Price Discrimination................... 8 1.1.1 Full Information Benchmark: First-Best Outcome or Perfect Price Discrimination.............................
More informationECON 2060 Contract Theory: Notes
ECON 2060 Contract Theory: Notes Richard Holden Harvard University Littauer 225 Cambridge MA 02138 rholden@harvard.edu September 6, 2016 Contents 1 Introduction 2 1.1 Situating Contract Theory.............................
More informationOnline Appendix for "Auctions in Markets: Common Outside Options and the Continuation Value Effect" Not intended for publication
Online Appendix for "Auctions in Markets: Common Outside Options and the Continuation Value Effect" Not intended for publication Stephan Lauermann Gabor Virag March 19, 2012 1 First-price and second-price
More informationMoral hazard with discrete soft information
Moral hazard with discrete soft information September 2012 Abstract I study a simple model of moral hazard with soft information. The risk-averse agent takes an action and she alone observes the stochastic
More informationEconS Advanced Microeconomics II Handout on Mechanism Design
EconS 503 - Advanced Microeconomics II Handout on Mechanism Design 1. Public Good Provision Imagine that you and your colleagues want to buy a co ee machine for your o ce. Suppose that some of you may
More informationPUBLIC ECONOMICS Lecture Notes 2
Robert Gary-Bobo PUBLIC ECONOMICS Lecture Notes 2 218-219, revised in November 217 ENSAE Chapter II Externalities 1 Some Implementation Theory We consider, as usual, a population of agents i = 1,..., n.
More informationAlgorithmic Game Theory Introduction to Mechanism Design
Algorithmic Game Theory Introduction to Mechanism Design Makis Arsenis National Technical University of Athens April 216 Makis Arsenis (NTUA) AGT April 216 1 / 41 Outline 1 Social Choice Social Choice
More informationMechanism Design. Terence Johnson. December 7, University of Notre Dame. Terence Johnson (ND) Mechanism Design December 7, / 44
Mechanism Design Terence Johnson University of Notre Dame December 7, 2017 Terence Johnson (ND) Mechanism Design December 7, 2017 1 / 44 Market Design vs Mechanism Design In Market Design, we have a very
More informationThe Relation Between Implementability and the Core
The Relation Between Implementability and the Core Eiichi Miyagawa Department of Economics, Columbia University 420 West 118th Street, New York, NY 10027, U.S.A. em437@columbia.edu June 11, 2002 Abstract
More informationAgents Mental Models
Agents Mental Models by Andreas Duus Pape A dissertation submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy (Economics) in The University of Michigan 2008 Doctoral
More informationOn the Pareto Efficiency of a Socially Optimal Mechanism for Monopoly Regulation
MPRA Munich Personal RePEc Archive On the Pareto Efficiency of a Socially Optimal Mechanism for Monopoly Regulation Ismail Saglam Ipek University 4 May 2016 Online at https://mpra.ub.uni-muenchen.de/71090/
More informationAPPLIED MECHANISM DESIGN FOR SOCIAL GOOD
APPLIED MECHANISM DESIGN FOR SOCIAL GOOD JOHN P DICKERSON Lecture #3 09/06/2016 CMSC828M Tuesdays & Thursdays 12:30pm 1:45pm REMINDER: SEND ME TOP 3 PRESENTATION PREFERENCES! I LL POST THE SCHEDULE TODAY
More informationKnapsack Auctions. Sept. 18, 2018
Knapsack Auctions Sept. 18, 2018 aaacehicbvdlssnafj34rpuvdelmsigvskmkoasxbtcuk9ghncfmjpn26gqszibsevojbvwvny4ucevsnx/jpm1cww8mndnnxu69x08ylcqyvo2v1bx1jc3svnl7z3dv3zw47mg4fzi0ccxi0forjixy0lzumdjlbegrz0jxh93kfvebceljfq8mcxejnoa0pbgplxnmwxxs2tu49ho16lagvjl/8hpoua6dckkhrizrtt2zytwtgeaysqtsaqvanvnlbdfoi8ivzkjkvm0lys2qubqzmi07qsqjwim0ih1noyqidlpzqvn4qpuahrhqjys4u393zcischl5ujjfus56ufif109veovmlcepihzpb4upgyqgetowoijgxsaaicyo3hxiiriik51hwydgl568tdqnum3v7bulsvo6ikmejsejqaibxiimuaut0ayypijn8arejcfjxxg3pualk0brcwt+wpj8acrvmze=
More information