Advanced Economic Theory Lecture 9. Bilateral Asymmetric Information. Double Auction (Chatterjee and Samuelson, 1983).

Size: px
Start display at page:

Download "Advanced Economic Theory Lecture 9. Bilateral Asymmetric Information. Double Auction (Chatterjee and Samuelson, 1983)."

Transcription

1 Leonardo Felli 6 December, 2002 Advanced Economic Theory Lecture 9 Bilateral Asymmetric Information Double Auction (Chatterjee and Samuelson, 1983). Two players, a buyer and a seller: N = {b, s}. The seller names an asking price: p s. The buyer names an offer price: p b. The action spaces: A s = {p s 0}, A b = {p b 0}. 1

2 Advanced Economic Theory 2 The seller owns and attaches value to an indivisible unit of a good. The buyer attaches value to the unit of the good and is willing to pay up to for it. The valuations for the unit of the good of the seller and the buyer are their private information. The type spaces: T s = {0 1}, T b = {0 1}

3 Advanced Economic Theory 3 Both the buyer and the seller believe that the valuation of the opponent is uniformly distributed on [0, 1]. The believes are: µ s = 1, µ b = 1. The rules of the game are such that: If p b p s then they trade at the average price: p = (p s + p b ). 2 If p b < p s then no trade occurs.

4 Advanced Economic Theory 4 The payoffs to both the seller and the buyer are then: u s (p s, p b ;, ) = { (ps +p b ) 2 if p b p s if p b < p s and u b (p s, p b ;, ) = { vb (p s+p b ) 2 if p b p s 0 if p b < p s The strategies for this game are p s ( ) and p b ( ). We restrict attention once again to strictly monotonic and differentiable strategies for the two players.

5 Advanced Economic Theory 5 Consider now the seller s best reply. This is defined by the following maximization problem: max p s E vb {u s (p s, p b ;, ), p b ( )} consider now the seller s payoff, substituting p b ( ) we have: u s (p s, p b ;, ) = { (ps +p b ( )) 2 if p b ( ) p s if p b ( ) < p s

6 Advanced Economic Theory 6 or u s (p s, p b ;, ) = { (ps +p b ( )) 2 if p 1 b (p s ) if < p 1 b (p s ) max p s p 1 b (p s ) =0 d + 1 =p 1 b (p s ) (p s + p b ( ) d 2 Recall that: y ( ) β(y) G(x, y)dx α(y) = β(y) = G(β(y), y) β (y) G(α(y), y)α (y)+ α(y) G(x, y) dx y

7 Advanced Economic Theory 7 Therefore the first order condition of the seller s best reply maximization problem are then: dp 1 b (p s ) dp s 1 2 [ ps + p b (p 1 b (p s )) ] dp 1 b (p s ) + dp s + 1 p 1 b (p s ) 1 2 d = 0 or from p s = p b (p 1 b (p s )): ( p s ) dp 1 b (p s ) + 1 [ ] 1 vb dp s 2 p 1 b (p s ) = 0 which gives: ( p s ) dp 1 b (p s ) dp s [ 1 p 1 b (p s ) ] = 0

8 Advanced Economic Theory 8 The buyer s best reply is instead defined by the following maximization problem: max p b E vs {u b (p s, p b ;, ), p s ( )} Consider now the buyer s payoff obtained substituting p s ( ): u b (p s, p b ;, ) = { vb (p s( )+p b ) 2 if p 1 s (p b ) 0 if < p 1 s (p b ) we then get max p b p 1 s (p b ) =0 [ (p ] s( ) + p b ) d 2

9 Advanced Economic Theory 9 Therefore the first order condition of the buyer s best reply maximization problem are then: [ (p s(p 1 s (p b )) + p b ) 2 ] dp 1 s (p b ) dp b 1 2 p 1 s (p b ) =0 d = 0 or which gives: [ p b ] dp 1 s (p b ) 1 [ ] p 1 s (p b ) vs = 0 dp b 2 0 ( p b ) dp 1 s (p b ) dp b 1 2 p 1 s (p b ) = 0 To simplify notation we re-write p 1 b ( ) = q b ( ) and p 1 s ( ) = q s ( ).

10 Advanced Economic Theory 10 The two differential equations that define the best reply of the seller and the buyer are then: [q s (p s ) p s ]q b(p s ) [1 q b(p s )] = 0 [q b (p b ) p b ]q s(p b ) 1 2 q s(p b ) = 0 Solving the second equation for q b (p b ) we obtain: q b (p b ) = p b + q s(p b ) 2 q s(p b ) differentiating yields: q b(p b ) = 1 2 [3 q s(p b )q s(p ] b ) [q s(p b )] 2 Substituting both formulae into the first differential equation we get: [q s (p s ) p s ] [3 q s(p s )q s(p s ) [q s(p s )] 2 ] [ + 1 p s q ] s(p s ) 2 q s(p s ) = 0

11 Advanced Economic Theory 11 This is a second-order differential equation in q s ( ) that has a two parameter family of solutions. The simplest family of solution takes the form: q s (p s ) = α p s + β solves the second- Then the values α = 3 2 and β = 3 8 order differential equation. Therefore substituting into q b (p b ) we obtain: q s (p s ) = 3 2 p s 3 8, q b(p b ) = 3 2 p b 1 8 Given that = q s (p s ) and = q b (p b ) we conclude that: p s = p b =

12 Advanced Economic Theory 12 This is the unique Bayesian Nash equilibrium of this game. Notice now that it is efficient to trade whenever: However in this double auction game trade occurs whenever: p b p s or

13 In other words: Advanced Economic Theory Trade = = (0, 0) 1

14 Advanced Economic Theory 14 Consider now a general bilateral trade model (Myerson and Satterthwaite 1983). The key question is whether the inefficiency we found in the previous example can be eliminated by choosing a different trading mechanism. The revelation principle provides the right tool to get an answer to the question above. Obviously, there is no principal, but the two parties at an ex-ante stage, before they learn their private information act as the mechanism designer. Assume further that this is a pure bilateral contract transfers cannot involve a third party. In jargon the mechanism has to be budget balancing.

15 Advanced Economic Theory 15 A seller and a buyer trade a single unit of a good. The seller s valuation for the good is and it is the seller s private information: P s ( ), [, ] The buyer s valuation for the good is and it is the buyer s private information: P b ( ), [, ] A contract in this environment is a pair (φ, t) where φ is the probability of trade, t is the transfer from the buyer to the seller. Revelation principle implies that wlog we can restrict attention to truth-telling direct mechanisms (φ(ˆ, ˆ ), t(ˆ, ˆ ))

16 Advanced Economic Theory 16 The seller s indirect utility is then: U s (ˆ, ˆ ) = ( +) t(ˆ, ˆ ) φ(ˆ, ˆ ) The buyer s indirect utility is instead: U b (ˆ, ˆ ) = φ(ˆ, ˆ ) t(ˆ, ˆ ) Denote: U s (ˆ ) = E vb [t(, ˆ ) φ(, ˆ ) ] = t s (ˆ ) φ s (ˆ ) U b (ˆ ) = E vs [φ(ˆ, ) t(ˆ, )] = φ b (ˆ ) t b (ˆ ) The following, by now standard, result, helps us to have (IC) and (IR) constraints in a manageable form.

17 Advanced Economic Theory 17 Result: (Myerson and Satterthwaite 1983) For any probability φ(, ) there exists a transfer function t(, ) that satisfies (IR) and (IC) if and only if: E vb, [φ(, ) (J b ( ) J s ( ))] 0 (1) where and J b ( ) = J s ( ) = dφ s ( ) d 0, ( 1 P ) b( ) p b ( ) ( + P ) s( ) p s ( ) (2) (3) dφ b ( ) d 0 (4) Proof: The standard transformation we used twice before gives us that the FOC and SOC of the truthtelling constraints imply:

18 Advanced Economic Theory 18 and Therefore U b ( ) = φ b ( ) U s ( ) = φ s ( ) 2 U b ( ) ˆ = dφ b( ) d 0, 2 U s ( ) ˆ = dφ s( ) d 0 and U b ( ) = U b ( ) + φ b (ν)dν U s ( ) = U s ( ) + vs φ s (γ)dγ

19 Advanced Economic Theory 19 Budget balancing implies that in equilibrium E vb [t b ( )] = E vs [t s ( )] Since we have t s ( ) = U s ( ) + φ s ( ) and t b ( ) = φ b ( ) U b ( ) We obtain: 0 = E vs [t s ( )] E vb [t b ( )] = = U s ( ) + U b ( ) + vs ( vs ) + φ s ( ) + φ s (γ)dγ p s ( ) d + + ( ) φ b (ν)dν φ( ) p b ( )d

20 Advanced Economic Theory 20 Integrating by parts we get: U s ( ) + U b ( ) = ( = 1 P ) b( ) φ p b ( ) b ( ) p b ( )d + vs ( + P ) s( ) φ p s ( ) s ( ) p s ( ) d (5) or U s ( ) + U b ( ) = = E vb, [φ(, ) (J b ( ) J s ( ))] (6) Since (IR) constraints are implies by U s ( ) 0 and U b ( ) 0 together with the monotonicity conditions we then have: E vb, [φ(, ) (J b ( ) J s ( ))] 0

21 Advanced Economic Theory 21 Sufficiency is a bit more complex to prove it requires us to solve the partial differential equation that is represented by the FOC of the (IC) constraints. The parties ex-ante problem is now: max φ i E vb, [φ(, ) ( )] s.t. E vb, [φ(, ) (J b ( ) J s ( ))] 0 dφ s ( ) d 0, dφ b ( ) d 0 Ignoring monotonicity conditions and denoting µ the lagrange multiplier of the remaining constraint we get a lagrangian function that is linear in φ i : [ E vb, {φ(, ) ( ) (1+µ) + µ ( 1 Pb ( ) p b ( ) + P ) s( ) ]} p s ( )

22 Advanced Economic Theory 22 The solution is to set φ = 1 if and only if the term in brackets is strictly positive. In other words trade occurs if and only if: µ ( ) 1 Pb ( ) + µ ( ) Ps ( ) 1 + µ p b ( ) 1 + µ p s ( ) where µ 0. This φ(c, v) is weakly monotonic in: µ ( ) 1 Pb ( ) 1 + µ p b ( ) and + µ 1 + µ ( ) Ps ( ) p s ( )

23 Advanced Economic Theory 23 Then MHRP implies that both monotonicity conditions are satisfied and hence local and global (IC) holds. Clearly if µ > 0 there will be inefficiencies in trade. Result: (Myerson and Satterthwaite 1983) Let > and > then necessarily µ > 0 Proof: We consider the case < < < the proof in the other cases is similar in structure.

24 Advanced Economic Theory 24 From equation (5) above we have that: U s ( ) + U b ( ) = vs [ p b ( ) 1 + P b ( )] φ(, ) p s ( )d d vs [ p s ( ) + P s ( )] φ(, ) p b ( ) d d Consider now the first best probability of trade: φ (, ) = { 1 if vb 0 if < If we substitute φ (, ) into the formula for U s ( ) + U b ( ) we obtain that the first integral can be written as: min{vb, } p s ( )d [ p b ( ) 1 + P b ( )] d

25 Advanced Economic Theory 25 or P s ( ) [ p b ( ) 1 + P b ( )] d while the second integral is: ( vb min{vb, } ) [ p s ( ) + P s ( )] d p b ( )d or min{ P s ( ), } p b ( ) d Notice that P s ( ) = 1 for, which implies that: min{ P s ( ), } = { vb P s ( ) if if >

26 Advanced Economic Theory 26 We can therefore re-write U s ( ) + U b ( ) as: U s ( ) + U b ( ) = P s ( ) p b ( ) d + P s ( ) [1 P b ( )] d + vs P s ( ) p b ( ) d + p b ( ) d In other words: U s ( ) + U b ( ) = ( ) p b ( ) d + P s ( ) [1 P b ( )] d

27 Advanced Economic Theory 27 Integrating by parts the first of the two integrals above we get: U s ( ) + U b ( ) = [1 P b ( )] d + P s ( ) [1 P b ( )] d Recall now that P s ( ) = 1 if > we obtain that U s ( ) + U b ( ) = = vs P s ( ) [1 P b ( )] d Clearly this last expression is strictly negative provided that, as we assumed, <. In other words, efficient trading φ (, ) does not satisfies constraint (5). This an important result: with bilateral asymmetric information even the optimal mechanism will lead to inefficient outcomes with strictly positive probability.

EC319 Economic Theory and Its Applications, Part II: Lecture 2

EC319 Economic Theory and Its Applications, Part II: Lecture 2 EC319 Economic Theory and Its Applications, Part II: Lecture 2 Leonardo Felli NAB.2.14 23 January 2014 Static Bayesian Game Consider the following game of incomplete information: Γ = {N, Ω, A i, T i, µ

More information

Game Theory. Monika Köppl-Turyna. Winter 2017/2018. Institute for Analytical Economics Vienna University of Economics and Business

Game 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 information

Mechanism Design: Bargaining

Mechanism Design: Bargaining Mechanism Design: Bargaining Dilip Mookherjee Boston University Ec 703b Lecture 5 (text: FT Ch 7, pp 275-279) DM (BU) Mech Design 703b.5 2019 1 / 13 The Bargaining Problem Two agents: S, seller and B,

More information

EC476 Contracts and Organizations, Part III: Lecture 2

EC476 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 information

Mechanism Design: Bayesian Incentive Compatibility

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 information

Lecture Note II-3 Static Games of Incomplete Information. Games of incomplete information. Cournot Competition under Asymmetric Information (cont )

Lecture Note II-3 Static Games of Incomplete Information. Games of incomplete information. Cournot Competition under Asymmetric Information (cont ) Lecture Note II- Static Games of Incomplete Information Static Bayesian Game Bayesian Nash Equilibrium Applications: Auctions The Revelation Principle Games of incomplete information Also called Bayesian

More information

NTU 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,

NTU 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 information

Introduction to Game Theory

Introduction to Game Theory Introduction to Game Theory Part 3. Static games of incomplete information Chapter 2. Applications Ciclo Profissional 2 o Semestre / 2011 Graduação em Ciências Econômicas V. Filipe Martins-da-Rocha (FGV)

More information

Notes on Mechanism Designy

Notes 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 information

Mechanism Design: Basic Concepts

Mechanism 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 information

Mechanism Design: Dominant Strategies

Mechanism Design: Dominant Strategies May 20, 2014 Some Motivation Previously we considered the problem of matching workers with firms We considered some different institutions for tackling the incentive problem arising from asymmetric information

More information

Bayesian-Nash Equilibrium

Bayesian-Nash Equilibrium Bayesian-Nash Equilibrium A Bayesian game models uncertainty over types of opponents a player faces The game was defined in terms of players, their types, their available actions A player s beliefs about

More information

Mechanism Design. Christoph Schottmüller / 27

Mechanism 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 information

The Revenue Equivalence Theorem 1

The 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 information

Bayesian Games and Auctions

Bayesian Games and Auctions Bayesian Games and Auctions Mihai Manea MIT Games of Incomplete Information Incomplete information: players are uncertain about the payoffs or types of others Often a player s type defined by his payoff

More information

Mechanism Design: Review of Basic Concepts

Mechanism 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 information

Microeconomics 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 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 information

Informed Principal in Private-Value Environments

Informed 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 information

Lecture Slides - Part 4

Lecture 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 information

Outline for Static Games of Incomplete Information

Outline for Static Games of Incomplete Information Outline for Static Games of Incomplete Information I. Example 1: An auction game with discrete bids II. Example 2: Cournot duopoly with one-sided asymmetric information III. Definition of Bayesian-Nash

More information

EconS Microeconomic Theory II Midterm Exam #2 - Answer Key

EconS 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 information

Lecture 4. 1 Examples of Mechanism Design Problems

Lecture 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 information

Bayesian Games and Mechanism Design Definition of Bayes Equilibrium

Bayesian 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 information

On the Informed Principal Model with Common Values

On the Informed Principal Model with Common Values On the Informed Principal Model with Common Values Anastasios Dosis ESSEC Business School and THEMA École Polytechnique/CREST, 3/10/2018 Anastasios Dosis (ESSEC and THEMA) Informed Principal with Common

More information

Mechanism 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 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 information

CPS 173 Mechanism design. Vincent Conitzer

CPS 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 information

Classic Mechanism Design (III)

Classic Mechanism Design (III) Parkes Mechanism Design 1 Classic Mechanism Design (III) David C. Parkes Division of Engineering and Applied Science, Harvard University CS 286r Spring 2002 Parkes Mechanism Design 2 Vickrey-Clarke-Groves

More information

Revenue Maximization in Multi-Object Auctions

Revenue 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 information

Lecture 10: Mechanism Design

Lecture 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 information

Game 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 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 information

Lecture Notes in Information Economics

Lecture 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 information

A Preliminary Introduction to Mechanism Design. Theory

A 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 information

Introduction to Mechanism Design

Introduction 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 information

Game 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 Game Theory Lecture Notes By Y. Narahari Department of Computer Science and Automation Indian Institute of Science Bangalore, India July 01 Incentive Compatibility and Revelation Theorem Note: This is

More information

Advanced Microeconomics

Advanced Microeconomics Advanced Microeconomics Leonardo Felli EC441: Room D.106, Z.332, D.109 Lecture 8 bis: 24 November 2004 Monopoly Consider now the pricing behavior of a profit maximizing monopolist: a firm that is the only

More information

Mechanism Design. Terence Johnson. December 7, University of Notre Dame. Terence Johnson (ND) Mechanism Design December 7, / 44

Mechanism 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 information

Msc Micro I exam. Lecturer: Todd Kaplan.

Msc Micro I exam. Lecturer: Todd Kaplan. Msc Micro I 204-205 exam. Lecturer: Todd Kaplan. Please answer exactly 5 questions. Answer one question from each of sections: A, B, C, and D and answer one additional question from any of the sections

More information

Graph Theoretic Characterization of Revenue Equivalence

Graph 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 information

CS599: Algorithm Design in Strategic Settings Fall 2012 Lecture 12: Approximate Mechanism Design in Multi-Parameter Bayesian Settings

CS599: Algorithm Design in Strategic Settings Fall 2012 Lecture 12: Approximate Mechanism Design in Multi-Parameter Bayesian Settings CS599: Algorithm Design in Strategic Settings Fall 2012 Lecture 12: Approximate Mechanism Design in Multi-Parameter Bayesian Settings Instructor: Shaddin Dughmi Administrivia HW1 graded, solutions on website

More information

An Efficient Solution to the Informed Principal Problem

An 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 information

Vasilis Syrgkanis Microsoft Research NYC

Vasilis Syrgkanis Microsoft Research NYC Vasilis Syrgkanis Microsoft Research NYC 1 Large Scale Decentralized-Distributed Systems Multitude of Diverse Users with Different Objectives Large Scale Decentralized-Distributed Systems Multitude of

More information

Analyzing Games with Ambiguous Player Types Using the MINthenMAX Decision Model

Analyzing Games with Ambiguous Player Types Using the MINthenMAX Decision Model Analyzing Games with Ambiguous Player Types Using the MINthenMAX Decision Model (work in progress) Ilan Nehama Tel-Aviv University ilan.nehama@mail.huji.ac.il April 2017 Abstract In many common interactive

More information

Theory of Auctions. Carlos Hurtado. Jun 23th, Department of Economics University of Illinois at Urbana-Champaign

Theory of Auctions. Carlos Hurtado. Jun 23th, Department of Economics University of Illinois at Urbana-Champaign Theory of Auctions Carlos Hurtado Department of Economics University of Illinois at Urbana-Champaign hrtdmrt2@illinois.edu Jun 23th, 2015 C. Hurtado (UIUC - Economics) Game Theory On the Agenda 1 Formalizing

More information

Micro II. Benny Moldovanu. Summer Term University of Bonn. Benny Moldovanu (University of Bonn) Micro II Summer Term / 109

Micro II. Benny Moldovanu. Summer Term University of Bonn. Benny Moldovanu (University of Bonn) Micro II Summer Term / 109 Micro II Benny Moldovanu University of Bonn Summer Term 2015 Benny Moldovanu (University of Bonn) Micro II Summer Term 2015 1 / 109 Quasi-Linear Utility x = (k, t 1,.., t I ), where: k K (physical outcomes,

More information

Lecture 6 Games with Incomplete Information. November 14, 2008

Lecture 6 Games with Incomplete Information. November 14, 2008 Lecture 6 Games with Incomplete Information November 14, 2008 Bayesian Games : Osborne, ch 9 Battle of the sexes with incomplete information Player 1 would like to match player 2's action Player 1 is unsure

More information

Microeconomic Theory (501b) Problem Set 10. Auctions and Moral Hazard Suggested Solution: Tibor Heumann

Microeconomic Theory (501b) Problem Set 10. Auctions and Moral Hazard Suggested Solution: Tibor Heumann 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..

More information

Second Price Auctions with Differentiated Participation Costs

Second Price Auctions with Differentiated Participation Costs Second Price Auctions with Differentiated Participation Costs Xiaoyong Cao Department of Economics Texas A&M University College Station, TX 77843 Guoqiang Tian Department of Economics Texas A&M University

More information

MS&E 246: Lecture 12 Static games of incomplete information. Ramesh Johari

MS&E 246: Lecture 12 Static games of incomplete information. Ramesh Johari MS&E 246: Lecture 12 Static games of incomplete information Ramesh Johari Incomplete information Complete information means the entire structure of the game is common knowledge Incomplete information means

More information

Core-selecting package auctions. Han Dong, Hajir Roozbehani

Core-selecting package auctions. Han Dong, Hajir Roozbehani Core-selecting package auctions Han Dong, Hair Roozbehani 11.11.2008 Direct Impression to the paper proposes QoS for mechanism design connects stable matching with mechanism analyses theorem deeply and

More information

EconS Advanced Microeconomics II Handout on Mechanism Design

EconS 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 information

Working Paper EQUILIBRIUM SELECTION IN COMMON-VALUE SECOND-PRICE AUCTIONS. Heng Liu

Working Paper EQUILIBRIUM SELECTION IN COMMON-VALUE SECOND-PRICE AUCTIONS. Heng Liu Working Paper EQUILIBRIUM SELECTION IN COMMON-VALUE SECOND-PRICE AUCTIONS Heng Liu This note considers equilibrium selection in common-value secondprice auctions with two bidders. We show that for each

More information

Some Notes on Adverse Selection

Some 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 information

On the Informed Principal Model with Common Values

On the Informed Principal Model with Common Values On the Informed Principal Model with Common Values Anastasios Dosis September 23, 2016 Abstract In the informed principal model with common values, I identify as key in the characterisation of equilibrium

More information

Vickrey-Clarke-Groves Mechanisms

Vickrey-Clarke-Groves Mechanisms Vickrey-Clarke-Groves Mechanisms Jonathan Levin 1 Economics 285 Market Design Winter 2009 1 These slides are based on Paul Milgrom s. onathan Levin VCG Mechanisms Winter 2009 1 / 23 Motivation We consider

More information

Ex post renegotiation-proof mechanism design

Ex post renegotiation-proof mechanism design Ex post renegotiation-proof mechanism design Zvika Neeman Gregory Pavlov February 4, 2012 Abstract We study a mechanism design problem under the assumption that ex post renegotiation cannot be prevented.

More information

An auction with finite types

An auction with finite types This is a draft; email me with comments, typos, clarifications, etc. An auction with finite types Let s consider the simplest case of an auction with finite types: there are two players i {1, 2} with types

More information

Interdependent Value Auctions with an Insider Bidder 1

Interdependent Value Auctions with an Insider Bidder 1 Interdependent Value Auctions with an Insider Bidder Jinwoo Kim We study the efficiency of standard auctions with interdependent values in which one of two bidders is perfectly informed of his value while

More information

Mechanism Design with Correlated Types

Mechanism 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 information

Game 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 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 information

Lecture Notes in Contract Theory

Lecture Notes in Contract Theory Lecture Notes in Contract Theory Holger M. Müller Stockholm School of Economics May 1997 preliminary and incomplete Contents 1 Introduction 3 2 Mechanism Design 5 2.1 TheImplementationProblem... 5 2.2

More information

Definitions and Proofs

Definitions and Proofs Giving Advice vs. Making Decisions: Transparency, Information, and Delegation Online Appendix A Definitions and Proofs A. The Informational Environment The set of states of nature is denoted by = [, ],

More information

University 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 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 information

Solution: Since the prices are decreasing, we consider all the nested options {1,..., i}. Given such a set, the expected revenue is.

Solution: 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 information

Chapter 2. Equilibrium. 2.1 Complete Information Games

Chapter 2. Equilibrium. 2.1 Complete Information Games Chapter 2 Equilibrium Equilibrium attempts to capture what happens in a game when players behave strategically. This is a central concept to these notes as in mechanism design we are optimizing over games

More information

1 Basic Game Modelling

1 Basic Game Modelling Max-Planck-Institut für Informatik, Winter 2017 Advanced Topic Course Algorithmic Game Theory, Mechanism Design & Computational Economics Lecturer: CHEUNG, Yun Kuen (Marco) Lecture 1: Basic Game Modelling,

More information

Overview. Producer Theory. Consumer Theory. Exchange

Overview. Producer Theory. Consumer Theory. Exchange Overview Consumer Producer Exchange Edgeworth Box All Possible Exchange Points Contract Curve Overview Consumer Producer Exchange (Multiplicity) Walrasian Equilibrium Walrasian Equilibrium Requirements:

More information

EC487 Advanced Microeconomics, Part I: Lecture 2

EC487 Advanced Microeconomics, Part I: Lecture 2 EC487 Advanced Microeconomics, Part I: Lecture 2 Leonardo Felli 32L.LG.04 6 October, 2017 Properties of the Profit Function Recall the following property of the profit function π(p, w) = max x p f (x)

More information

EconS Microeconomic Theory II Homework #9 - Answer key

EconS Microeconomic Theory II Homework #9 - Answer key EconS 503 - Microeconomic Theory II Homework #9 - Answer key 1. WEAs with market power. Consider an exchange economy with two consumers, A and B, whose utility functions are u A (x A 1 ; x A 2 ) = x A

More information

Behavioral Mechanism Design

Behavioral Mechanism Design Behavioral Mechanism Design Serkan Kucuksenel January 2010 Abstract This paper studies the mechanism design problem for the class of Bayesian environments where agents do care for the well-being of others.

More information

2 Making the Exponential Mechanism Exactly Truthful Without

2 Making the Exponential Mechanism Exactly Truthful Without CIS 700 Differential Privacy in Game Theory and Mechanism Design January 31, 2014 Lecture 3 Lecturer: Aaron Roth Scribe: Aaron Roth Privacy as a Tool for Mechanism Design for arbitrary objective functions)

More information

Symmetric Separating Equilibria in English Auctions 1

Symmetric Separating Equilibria in English Auctions 1 Games and Economic Behavior 38, 19 27 22 doi:116 game21879, available online at http: wwwidealibrarycom on Symmetric Separating Equilibria in English Auctions 1 Sushil Bihchandani 2 Anderson Graduate School

More information

Mechanism design and allocation algorithms for energy-network markets with piece-wise linear costs and quadratic externalities

Mechanism design and allocation algorithms for energy-network markets with piece-wise linear costs and quadratic externalities 1 / 45 Mechanism design and allocation algorithms for energy-network markets with piece-wise linear costs and quadratic externalities Alejandro Jofré 1 Center for Mathematical Modeling & DIM Universidad

More information

The participatory Vickrey-Clarke-Groves mechanism*

The participatory Vickrey-Clarke-Groves mechanism* The participatory Vickrey-Clarke-Groves mechanism* Kiho Yoon Department of Economics, Korea University Anam-dong, Sungbuk-gu, Seoul, Korea 136-701 kiho@korea.ac.kr http://econ.korea.ac.kr/~kiho This version:

More information

Game Theory and Algorithms Lecture 2: Nash Equilibria and Examples

Game Theory and Algorithms Lecture 2: Nash Equilibria and Examples Game Theory and Algorithms Lecture 2: Nash Equilibria and Examples February 24, 2011 Summary: We introduce the Nash Equilibrium: an outcome (action profile) which is stable in the sense that no player

More information

Informed principal problems in generalized private values environments

Informed principal problems in generalized private values environments Informed principal problems in generalized private values environments Tymofiy Mylovanov and Thomas Tröger January 27, 2009 Abstract We show that a solution to the problem of mechanism selection by an

More information

Advanced Microeconomic Analysis, Lecture 6

Advanced Microeconomic Analysis, Lecture 6 Advanced Microeconomic Analysis, Lecture 6 Prof. Ronaldo CARPIO April 10, 017 Administrative Stuff Homework # is due at the end of class. I will post the solutions on the website later today. The midterm

More information

COOPERATIVE GAME THEORY: CORE AND SHAPLEY VALUE

COOPERATIVE GAME THEORY: CORE AND SHAPLEY VALUE 1 / 54 COOPERATIVE GAME THEORY: CORE AND SHAPLEY VALUE Heinrich H. Nax hnax@ethz.ch & Bary S. R. Pradelski bpradelski@ethz.ch February 26, 2018: Lecture 2 2 / 54 What you did last week... There appear

More information

Game Theory: Spring 2017

Game 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 information

Existence of Equilibrium in Large Double Auctions

Existence of Equilibrium in Large Double Auctions Existence of Equilibrium in Large Double Auctions The Harvard community has made this article openly available. Please share how this access benefits you. Your story matters Citation Fudenberg, Drew, Markus

More information

Strategy-Proof Approximations of Optimal Efficiency in Bilateral Trade

Strategy-Proof Approximations of Optimal Efficiency in Bilateral Trade Strategy-Proof Approximations of Optimal Efficiency in Bilateral Trade ZI YANG KANG, Stanford University JAN VONDRÁK, Stanford University We consider strategy-proof mechanisms for the bilateral trade problem

More information

Robust Mechanism Design and Robust Implementation

Robust 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 information

Module 18: VCG Mechanism

Module 18: VCG Mechanism Module 18: VCG Mechanism Information conomics c 515) George Georgiadis Society comprising of n agents. Set A of alternatives from which to choose. Agent i receives valuation v i x) if alternative x 2 A

More information

Mechanism Design: Implementation. Game Theory Course: Jackson, Leyton-Brown & Shoham

Mechanism Design: Implementation. Game Theory Course: Jackson, Leyton-Brown & Shoham Game Theory Course: Jackson, Leyton-Brown & Shoham Bayesian Game Setting Extend the social choice setting to a new setting where agents can t be relied upon to disclose their preferences honestly Start

More information

Monopoly with Resale. Supplementary Material

Monopoly 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 information

Bilateral Trading in Divisible Double Auctions

Bilateral Trading in Divisible Double Auctions Bilateral Trading in Divisible Double Auctions Songzi Du Haoxiang Zhu March, 014 Preliminary and Incomplete. Comments Welcome Abstract We study bilateral trading between two bidders in a divisible double

More information

Level-k Mechanism Design

Level-k Mechanism Design Level-k Mechanism Design Geoffroy de Clippel Brown University Roberto Serrano Brown University Rene Saran Yale-NUS College July 2016 Revised May 2017 Abstract Models of choice where agents see others as

More information

Hybrid All-Pay and Winner-Pay Contests

Hybrid All-Pay and Winner-Pay Contests Hybrid All-Pay and Winner-Pay Contests Seminar at DICE in Düsseldorf, June 5, 208 Johan N. M. Lagerlöf Dept. of Economics, U. of Copenhagen Email: johan.lagerlof@econ.ku.dk Website: www.johanlagerlof.com

More information

Economics 3012 Strategic Behavior Andy McLennan October 20, 2006

Economics 3012 Strategic Behavior Andy McLennan October 20, 2006 Economics 301 Strategic Behavior Andy McLennan October 0, 006 Lecture 11 Topics Problem Set 9 Extensive Games of Imperfect Information An Example General Description Strategies and Nash Equilibrium Beliefs

More information

THEORIES ON AUCTIONS WITH PARTICIPATION COSTS. A Dissertation XIAOYONG CAO

THEORIES ON AUCTIONS WITH PARTICIPATION COSTS. A Dissertation XIAOYONG CAO THEORIES ON AUCTIONS WITH PARTICIPATION COSTS A Dissertation by XIAOYONG CAO Submitted to the Office of Graduate Studies of Texas A&M University in partial fulfillment of the requirements for the degree

More information

Solution to Tutorial 9

Solution to Tutorial 9 Solution to Tutorial 9 2011/2012 Semester I MA4264 Game Theory Tutor: Xiang Sun October 27, 2011 Exercise 1. A buyer and a seller have valuations v b and v s. It is common knowledge that there are gains

More information

Second Price Auctions with Valuations and Participation Costs Both Privately Informed

Second Price Auctions with Valuations and Participation Costs Both Privately Informed Second Price Auctions with Valuations and Participation Costs Both Privately Informed Xiaoyong Cao Department of Economics University of International Business and Economics Beijing, China 129 Guoqiang

More information

Preliminary notes on auction design

Preliminary notes on auction design Division of the Humanities and Social Sciences Preliminary notes on auction design kcb Revised Winter 2008 This note exposits a simplified version of Myerson s [8] paper on revenue-maximizing auction design

More information

Contracts under Asymmetric Information

Contracts under Asymmetric Information Contracts under Asymmetric Information 1 I Aristotle, economy (oiko and nemo) and the idea of exchange values, subsequently adapted by Ricardo and Marx. Classical economists. An economy consists of a set

More information

Ambiguity aversion solves the conflict between efficiency and incentive compatibility

Ambiguity aversion solves the conflict between efficiency and incentive compatibility Ambiguity aversion solves the conflict between efficiency and incentive compatibility Luciano De Castro Nicholas C. Yannelis First Version: December 2008 This Version: November 2010 Abstract The conflict

More information

Advanced Microeconomics II

Advanced 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 information

Mechanism Design Tutorial David C. Parkes, Harvard University Indo-US Lectures Week in Machine Learning, Game Theory and Optimization

Mechanism Design Tutorial David C. Parkes, Harvard University Indo-US Lectures Week in Machine Learning, Game Theory and Optimization 1 Mechanism Design Tutorial David C. Parkes, Harvard University Indo-US Lectures Week in Machine Learning, Game Theory and Optimization 2 Outline Classical mechanism design Preliminaries (DRMs, revelation

More information

Bayes Correlated Equilibrium and Comparing Information Structures

Bayes 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 information

Some Lecture Notes on Auctions

Some Lecture Notes on Auctions Some Lecture Notes on Auctions John Morgan Haas School of Business and Department of Economics Uniersity of California, Berkeley Preliminaries Perhaps the most fruitful area for the application of optimal

More information

Sealed-bid first-price auctions with an unknown number of bidders

Sealed-bid first-price auctions with an unknown number of bidders Sealed-bid first-price auctions with an unknown number of bidders Erik Ekström Department of Mathematics, Uppsala University Carl Lindberg The Second Swedish National Pension Fund e-mail: ekstrom@math.uu.se,

More information

Game theory lecture 4. September 24, 2012

Game theory lecture 4. September 24, 2012 September 24, 2012 Finding Nash equilibrium Best-response or best-reply functions. We introduced Nash-equilibrium as a profile of actions (an action for each player) such that no player has an incentive

More information