Mechanism Design. Christoph Schottmüller / 27

Similar documents
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,

Mechanism Design: Basic Concepts

CPS 173 Mechanism design. Vincent Conitzer

Lecture 4. 1 Examples of Mechanism Design Problems

Mechanism Design II. Terence Johnson. University of Notre Dame. Terence Johnson (ND) Mechanism Design II 1 / 30

A Preliminary Introduction to Mechanism Design. Theory

Lecture 10: Mechanism Design

Game Theory: Spring 2017

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

Mechanism Design: Bargaining

Lecture Slides - Part 4

Game Theory. Lecture Notes By Y. Narahari. Department of Computer Science and Automation Indian Institute of Science Bangalore, India July 2012

Introduction to Mechanism Design

Notes on Mechanism Designy

APPLIED MECHANISM DESIGN FOR SOCIAL GOOD

Mechanism Design: Dominant Strategies

Mechanism Design: Bayesian Incentive Compatibility

Bayesian Games and Mechanism Design Definition of Bayes Equilibrium

Mechanism Design and Truthful Algorithms

Revenue Maximization in Multi-Object Auctions

Vickrey Auction VCG Characterization. Mechanism Design. Algorithmic Game Theory. Alexander Skopalik Algorithmic Game Theory 2013 Mechanism Design

Lecture Notes in Contract Theory

Sequential Bidding in the Bailey-Cavallo Mechanism

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

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

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

Motivation. Game Theory 24. Mechanism Design. Setting. Preference relations contain no information about by how much one candidate is preferred.

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

Mechanism Design: Review of Basic Concepts

Vickrey Auction. Mechanism Design. Algorithmic Game Theory. Alexander Skopalik Algorithmic Game Theory 2013 Mechanism Design

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

EconS Advanced Microeconomics II Handout on Mechanism Design

Algorithmic Game Theory and Applications

EconS Microeconomic Theory II Homework #9 - Answer key

Generalizing mechanism design theory to a case where agents types are adjustable

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

2 Making the Exponential Mechanism Exactly Truthful Without

Module 18: VCG Mechanism

Pre-Bayesian Games. Krzysztof R. Apt. CWI, Amsterdam, the Netherlands, University of Amsterdam. (so not Krzystof and definitely not Krystof)

On Random Sampling Auctions for Digital Goods

Voting and Mechanism Design

6.207/14.15: Networks Lecture 24: Decisions in Groups

Full Surplus Extraction and Costless Information Revelation in Dynamic Environments. Shunya NODA (University of Tokyo)

CS 573: Algorithmic Game Theory Lecture date: April 11, 2008

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

On the Impossibility of Black-Box Truthfulness Without Priors

Informed Principal in Private-Value Environments

Bayes Correlated Equilibrium and Comparing Information Structures

Welfare Undominated Groves Mechanisms

Algorithmic Game Theory Introduction to Mechanism Design

Robust Predictions in Games with Incomplete Information

A Strict Ex-post Incentive Compatible Mechanism for Interdependent Valuations

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

A Strict Ex-post Incentive Compatible Mechanism for Interdependent Valuations

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

Automated mechanism design. Vincent Conitzer

Microeconomics II Lecture 4: Incomplete Information Karl Wärneryd Stockholm School of Economics November 2016

Theory of Mechanism Design

Bayesian Games and Auctions

Intermediate public economics 6 Public goods Hiroaki Sakamoto

Field Exam: Advanced Theory

CS599: Algorithm Design in Strategic Settings Fall 2012 Lecture 7: Prior-Free Multi-Parameter Mechanism Design. Instructor: Shaddin Dughmi

Undominated Groves Mechanisms

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

Game Theory Lecture 10+11: Knowledge

Advanced Microeconomics II

Game Theory. Lecture Notes By Y. Narahari. Department of Computer Science and Automation Indian Institute of Science Bangalore, India July 2012

Monopoly with Resale. Supplementary Material

An Efficient Solution to the Informed Principal Problem

Some Notes on Adverse Selection

Optimal Revenue Maximizing Mechanisms in Common-Value Position Auctions. Working Paper

Classic Mechanism Design (III)

Vickrey-Clarke-Groves Mechanisms

On Decentralized Incentive Compatible Mechanisms for Partially Informed Environments

Mechanism Design with Ambiguous Transfers

Optimal Provision of Multiple Excludable Public Goods

CS599: Algorithm Design in Strategic Settings Fall 2012 Lecture 1: Introduction and Class Overview. Instructor: Shaddin Dughmi

NASH IMPLEMENTATION USING SIMPLE MECHANISMS WITHOUT UNDESIRABLE MIXED-STRATEGY EQUILIBRIA

Correlated Equilibrium in Games with Incomplete Information

Robert Gary-Bobo. NOTES ON MECHANISM DESIGN Implementation of Choice Rules

PUBLIC ECONOMICS Lecture Notes 2

Topics of Algorithmic Game Theory

CS599: Algorithm Design in Strategic Settings Fall 2012 Lecture 11: Ironing and Approximate Mechanism Design in Single-Parameter Bayesian Settings

"Arrow s Theorem and the Gibbard-Satterthwaite Theorem: A Unified Approach", by Phillip Reny. Economic Letters (70) (2001),

Graph Theoretic Characterization of Revenue Equivalence

Lecture Notes in Information Economics

CS 598RM: Algorithmic Game Theory, Spring Practice Exam Solutions

Mechanism Design with Ambiguous Transfers

The communication cost of selfishness

Two hours UNIVERSITY OF MANCHESTER SCHOOL OF COMPUTER SCIENCE. Date: Thursday 17th May 2018 Time: 09:45-11:45. Please answer all Questions.

Algorithmic Mechanism Design

Graduate Microeconomics II Lecture 5: Cheap Talk. Patrick Legros

Chapter 2. Equilibrium. 2.1 Complete Information Games

Information Design. Dirk Bergemann and Stephen Morris. Johns Hopkins University April 2017

Static Information Design

Public Good Provision in a Large Economy

Chapter 2. Equilibrium. 2.1 Complete Information Games

Fault Tolerant Mechanism Design

Some problems related to the Progressive Second Price Auction Mechanism

Transcription:

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 so far: dominant strategy equilibrium problem 1: Gibbard-Satterthwaite theorem for general preferences problem 2: budget balance problem even with quasilinear preferences from now on: Bayesian Nash equilibrium instead of dominant strategy equilibrium upside: weaker concept more social choice functions can be implemented downside: weaker concept less confident that players adhere to it in reality φ becomes relevant same problems/examples as before 3 / 27

Bayesian implementation I agents set of alternatives X nature draws types from the probability distribution φ type θ i Θ i is private information of i given the distribution φ each agent uses Bayes rule to form a belief over other agents types prob(θ i, θ i θ i ) = φ(θ i, θ i ) θ i Θ i φ(θ i, θ i ) 4 / 27

Bayesian Nash equilibrium Definition (Bayesian Nash equilibrium) The strategy profile s = (s1,..., si ) is a Bayesian Nash equilibrium of the mechanism Γ = (S 1,..., S I, g) if, for all i and all θ i Θ i, E θ i [ ui (g(s i (θ i ), s i(θ i )), θ i ) θ i ] Eθ i [ ui (g(ŝ i, s i(θ i )), θ i ) θ i ] for all ŝ i S i. roughly: a strategy profile is a BNE if no type of no player can increase his expected payoff by deviating 5 / 27

Bayesian implementation Definition (Bayesian implementation) The mechanism Γ = (S 1,..., S I, g) implements the social choice function f in Bayesian Nash equilibrium if there is a Bayesian Nash equilibrium s = (s1,..., si ) of Γ such that f (θ) = g(s (θ)) for all θ Θ. roughly: there has to be a BNE such that in this BNE the desired outcome results for every possible type vector 6 / 27

Truthful Bayesian implementation recall direct mechanism: every player is asked for his type and the outcome is f (announcement) Definition (Truthful Bayesian implementation) The social choice function f is truthfully implementable (or incentive compatible) in Bayesian Nash equilibrium if s i (θ i) = θ i is a Bayesian Nash equilbrium in the direct revelation Γ = (Θ 1,..., Θ I, f ). That is, for all i and all θ i E θ i [u i (f (θ i, θ i ), θ i ) θ i ] E θ i [ u i (f (ˆθ i, θ i ), θ i ) θ i ] for all ˆθ i Θ i. roughly: no type of no player can get a higher expected payoff by announcing a wrong type in the direct mechanism 7 / 27

Example Example (A public project) 2 agents value a public project either with 2 or 4 (Θ 1 = Θ 2 = {2, 4}) φ(2, 2) = φ(2, 4) = φ(4, 2) = φ(4, 4) = 1/4 costs of project are c=5 social choice function f : undertake project if θ 1 + θ 2 c split costs equally if both have valuation 4 low (high) valuation agent pays 2 (3) if project is undertaken and valuations are not the same is f truthfully implementable in dominant strategy equilibrium? is f truthfully implementable in Bayesian Nash equilibrium? 8 / 27

Revelation principle for Bayesian Nash equilibrium Theorem (Revelation principle for Bayesian Nash equilibrium) Suppose there exists a mechanism Γ = (S 1,..., S I, g) that implements f in Bayesian Nash equilibrium. Then f is truthfully implementable in Bayesian Nash equilibrium. very roughly: if some mechanism works, then the direct mechanism works as well 9 / 27

Revelation principle: idea and implication idea: same as before: tell me your type and I will play the equilibrium strategy of this type in Γ = (S 1,..., S I, g) as deviating was not profitable in the equilibrium of Γ = (S 1,..., S I, g), telling the true type is optimal implication: we can concentrate on direct mechanisms: if the direct mechanism is not incentive compatible, then there is no mechanism that can implement f 10 / 27

Revelation principle: Proof I say Γ = (S 1,..., S I, g) implements f in BNE then there is a BNE s = (s1,..., si ) such that f (θ) = g(s (θ)) for all θ Θ this implies that for all i and θ i [ ] E θ i ui (g(si (θ i ), s i(θ i )), θ i ) θ i for all ŝ i S i in particular for all i and θ i E θ i [ ui (g(ŝ i, s i(θ i )), θ i ) θ i ] E θ i [ ui (g(s i (θ i ), s i(θ i )), θ i ) θ i ] E θ i [ u i (g(s i (ˆθ i ), s i(θ i )), θ i ) θ i ] for all ˆθ i Θ i 11 / 27

Revelation principle: Proof II which is equivalent to: for all i and θ i E θ i [u i (f (θ i, θ i ), θ i ) θ i ] E θ i [ u i (f (ˆθ i, θ i ), θ i ) θ i ] for all ˆθ i Θ i. (because f (θ) = g(s (θ))) Hence, the direct mechanism is incentive compatible. 12 / 27

Towards expected externality mechanism Example (Provision of a public good or: Should CPH host Olympics?) decision whether to provide a public good (host or not) costs of public good (hosting Olympics) are c I agents (citizens) agent i values the good θ i which is his private information and possibly negative agent i has utility t i + θ i + m i if the good is provided and t i + m i if it is not t i is transfer to i (additional tax); most likely t i 0 13 / 27

Towards expected externality mechanism Is there a mechanism such that... 1... we host Olympics if and only if i θ i c 2... the budget is balanced: i t i = c if host and i t i = 0 otherwise 3... the mechanism is incentive compatible in Bayesian Nash equilibrium. note: Clarke-Groves mechanism satisfies 1 and 3 (even in dominant strategies) but did not satisfy 2! we can focus on incentive compatible, direct revelation mechanisms because of the revelation principle 14 / 27

Expected externality mechanism: preliminaries similar trick as in Clarke-Groves: design transfers that make each agent an expected welfare maximizer incentive to announce type truthfully Assumption: The agents types are statistically independent. nature draws type of agent i from distribution φ i and there is no correlation between the draws of any agents i and j Simple case: c=0 notation: define the efficient choice function k (θ) as k (θ) = { 1 if 0 else I i=1 θ i c = 0 15 / 27

Expected externality mechanism (c = 0) ] t i (θ) = E θ i [ j i θ j k (θ i, θ i ) + h i (θ i ) where h i is an arbitrary function of the other agents types that we will specify later (in a clever way that will give us budget balance) note: only expected value of other agents features in transfers actual types/announcements of other players are only relevant for h i the first term (E θ i [ ]) depends only on own type not on other agents type 16 / 27

Expected externality mechanism (c = 0) Theorem (Expected externality mechanism) The social choice function f (θ) = (k (θ), t 1,..., t I ) is Bayesian incentive compatible. Proof: In the direct mechanism, we have to show: If all other agents announce their true type, announcing my true type is optimal. Agent i of type θ i gets the following expected utility if he announces ˆθ i and the other agents announce truthfully ˆθ i = θ i : 17 / 27

Expected externality mechanism (c = 0) U i (ˆθ i, θ i ) = E θ i { t i (ˆθ i, θ i ) + θ i k (ˆθ i, θ i ) + m i } = E θ i { θ i k (ˆθ i, θ i ) + E θ i [ j i +h i (θ i ) + m i } = E θ i [ θ i k (ˆθ i, θ i ) + j i θ j k (ˆθ i, θ i ) ] θ j k (ˆθ i, θ i ) + h i (θ i ) ] + m i note that ˆθ i influences U i (ˆθ i, θ i ) only through k U i (ˆθ i, θ i ) is maximal if k (ˆθ i, θ i ) = 1 if and only if E θ i [θ i + ] j i θ j 0 agent i can ensure this by announcing his true type! 18 / 27

Expected externality mechanism (c = 0) we found a mechanism that is incentive compatible and undertakes the project only if it is efficient what about budget balance? we choose h i such that the mechanism satisfies budget balance denote by χ i (θ i ) the first part of t i : χ i (θ i ) = E θ i θ j k (θ i, θ i ) j i set h i (θ i ) as ( ) 1 h i (θ i ) = χ j (θ j ) I 1 j i agent i receives χ i (θ i ) and this amount is paid for by the other agents (in equal shares) 19 / 27

Expected externality mechanism: comments expected externality: agent i gets transfers χ i equal to the expected benefit of the other agents if he changes his type announcement the change in χ i reflects the expected externality this change imposes on the other agents 20 / 27

Expected externality mechanism: extensions for c > 0 a similar trick as in the Clarke-Groves mechanism works leading to transfers ] ( θ j c ) k (θ i, θ i ) I t i (θ) = E θ i [ j i k (θ i, θ i ) c I +h i(θ i ) as in the Clarke-Groves mechanism it can be easily generalized to several possible levels of, say, a public good (k can be more than just 0 and 1) and utility functions leading to transfers ( t i (θ) = E θ i [ j i u i (k, t i, θ i ) = v(k, θ i ) + t i + m i v(k (θ i, θ i ), θ j ) c(k (θ i, θ i )) I k (θ i, θ i ) c(k (θ i, θ i ) I + h i (θ i ) )] 21 / 27

Example Example (Hosting the Olympics) group 1 values hosting the Olympics with value θ 1 = 5 group 2 dislikes the Olympics (and all the noise that comes with it) either much θ 2 = 7 (with prob 1/2) or a little θ 2 = 1 (with prob 1/2) costs are 0 what are the expected externality transfers in this example? 22 / 27

Problem: Participation in the previous example: group 1 always had to pay more to group 2 than it actually valued the Olympics group 1 would prefer not to participate in the mechanism (e.g. forget about Olympics) this is a general problem in the expected externality mechanism government might be able to force agents to participate in private settings (trade, auctions etc.) forcing agents to participate is impossible next lecture: Is there an efficient mechanism if participation is voluntary? 23 / 27

Expected externality mechanism: Take aways and economics if people have quasilinear preferences play Bayesian Nash equilibrium can be forced to participate we can achieve efficient, budget balanced allocation coercion and government vs. private actors what if people can walk away? 24 / 27

Teaser You are on a fleemarket and you are interested in a certain item (say an old copy of MWG). The seller has a certain valuation c for the book (which probably stems from his expectation when and at what price he can sell it if he does not sell it to you). You value the book at 150kr. It would be efficient if you got the book if and only if c 150kr. Will the bargaining between you and the seller be efficient? Can there be an efficient mechanism? (Why can in this setting the expected externality mechanism not be used to ensure efficiency?) 25 / 27

Review questions What is the main advantage and disadvantage of Bayesian Nash equilibrium implementation compared to dominant strategy implementation? State the revelation principle for Bayesian Nash equilibrium implementation and give the intuition behind the result! What is the main motivation for the expected externality mechanism? In what sense, does the expected externality mechanism extend the Clarke-Groves mechanism? 26 / 27

Exercises There are two agents and one indivisible good. An alternative x X specifies who gets the good and which transfer payments the agents make. The transfer payments have to add up to 0 (that is the costs of the good are zero). The valuations of the two agents are independently and uniformly distributed on [0, 1]. The efficient allocation rule k gives the good to the agent with the highest valuation (you can ignore that agents might have the same valuation). Can you compute the expected externality transfers? (Hint: Because of the uniform distribution you have a short cut: if agent 1 has valuation θ 1, then the probability that agent 2 has a higher valuation is 1 θ 1. Given that θ 2 > θ 1, agent 1 expects agent 2 to have valuation 1+θ 1 2 ) MWG 23.D.1 27 / 27