Mechanism Design II CS 886:Electronic Market Design Sept 27, 2004.

Slides:



Advertisements
Similar presentations
(Single-item) auctions Vincent Conitzer v() = $5 v() = $3.
Advertisements

Chapter Thirty-Five Public Goods. Public Goods -- Definition u A good is purely public if it is both nonexcludable and nonrival in consumption. –Nonexcludable.
Chapter Thirty-Five Public Goods. u 35: Public Goods u 36: Asymmetric Information u 17: Auctions u 33: Law & Economics u 34: Information Technology u.
6.896: Topics in Algorithmic Game Theory Lecture 20 Yang Cai.
Algorithmic Game Theory Uri Feige Robi Krauthgamer Moni Naor Lecture 10: Mechanism Design Lecturer: Moni Naor.
CPS Bayesian games and their use in auctions Vincent Conitzer
The Voting Problem: A Lesson in Multiagent System Based on Jose Vidal’s book Fundamentals of Multiagent Systems Henry Hexmoor SIUC.
Game Theory in Wireless and Communication Networks: Theory, Models, and Applications Lecture 6 Auction Theory Zhu Han, Dusit Niyato, Walid Saad, Tamer.
Auction. Types of Auction  Open outcry English (ascending) auction Dutch (descending) auction  Sealed bid First-price Second-price (Vickrey)  Equivalence.
Optimal auction design Roger Myerson Mathematics of Operations research 1981.
Sep. 8, 2014 Lirong Xia Introduction to MD (mooncake design or mechanism design)
Variable Public Good Quantities E.g. how many broadcast TV programs, or how much land to include into a national park.
Game Theory 1. Game Theory and Mechanism Design Game theory to analyze strategic behavior: Given a strategic environment (a “game”), and an assumption.
1 Regret-based Incremental Partial Revelation Mechanism Design Nathanaël Hyafil, Craig Boutilier AAAI 2006 Department of Computer Science University of.
1. problem set 12 from Binmore’s Fun and Games. p.564 Ex. 41 p.565 Ex. 42.
Bundling Equilibrium in Combinatorial Auctions Written by: Presented by: Ron Holzman Rica Gonen Noa Kfir-Dahav Dov Monderer Moshe Tennenholtz.
Adverse Selection Asymmetric information is feature of many markets
Algorithmic Applications of Game Theory Lecture 8 1.
Mechanism Design and Auctions Jun Shu EECS228a, Fall 2002 UC Berkeley.
Agent Technology for e-Commerce Chapter 10: Mechanism Design Maria Fasli
An Algorithm for Automatically Designing Deterministic Mechanisms without Payments Vincent Conitzer and Tuomas Sandholm Computer Science Department Carnegie.
Economics and Computer Science Introduction to Game Theory
Multi-unit auctions & exchanges (multiple indistinguishable units of one item for sale) Tuomas Sandholm Computer Science Department Carnegie Mellon University.
Mechanisms for a Spatially Distributed Market Moshe Babaioff, Noam Nisan and Elan Pavlov School of Computer Science and Engineering Hebrew University of.
Auctioning one item PART 2 Tuomas Sandholm Computer Science Department Carnegie Mellon University.
Exchanges = markets with many buyers and many sellers Let’s consider a 1-item 1-unit exchange first.
Automated Mechanism Design: Complexity Results Stemming From the Single-Agent Setting Vincent Conitzer and Tuomas Sandholm Computer Science Department.
Yang Cai Sep 15, An overview of today’s class Myerson’s Lemma (cont’d) Application of Myerson’s Lemma Revelation Principle Intro to Revenue Maximization.
Multi-unit auctions & exchanges (multiple indistinguishable units of one item for sale) Tuomas Sandholm Computer Science Department Carnegie Mellon University.
Social Welfare, Arrow + Gibbard- Satterthwaite, VCG+CPP 1 TexPoint fonts used in EMF. Read the TexPoint manual before you delete this box.: AAA A A A A.
Auction Theory Class 2 – Revenue equivalence 1. This class: revenue Revenue in auctions – Connection to order statistics The revelation principle The.
Yang Cai Sep 8, An overview of the class Broad View: Mechanism Design and Auctions First Price Auction Second Price/Vickrey Auction Case Study:
CPS 173 Mechanism design Vincent Conitzer
Auction Seminar Optimal Mechanism Presentation by: Alon Resler Supervised by: Amos Fiat.
More on Social choice and implementations 1 TexPoint fonts used in EMF. Read the TexPoint manual before you delete this box.: AAA A Using slides by Uri.
6.853: Topics in Algorithmic Game Theory Fall 2011 Constantinos Daskalakis Lecture 21.
Mechanism Design CS 886 Electronic Market Design University of Waterloo.
Auction Theory תכנון מכרזים ומכירות פומביות Topic 7 – VCG mechanisms 1.
Mechanism design for computationally limited agents (previous slide deck discussed the case where valuation determination was complex) Tuomas Sandholm.
Yang Cai Oct 08, An overview of today’s class Basic LP Formulation for Multiple Bidders Succinct LP: Reduced Form of an Auction The Structure of.
Mechanism design. Goal of mechanism design Implementing a social choice function f(u 1, …, u |A| ) using a game Center = “auctioneer” does not know the.
CPS Application of Linear and Integer Programming: Automated Mechanism Design Guest Lecture by Mingyu Guo.
Mechanism Design Ruta Mehta. Game design (not video games!) to achieve a desired goal, like fairness, social welfare maximization, etc.
1 (One-shot) Mechanism Design with Partial Revelation Nathanaël Hyafil, Craig Boutilier IJCAI 2007 Department of Computer Science University of Toronto.
Automated Mechanism Design Tuomas Sandholm Presented by Dimitri Mostinski November 17, 2004.
Incentives and Mechanism Design Introduction ; An important features of any setting in which collective decisions must be made is that individual actual.
Mechanism design (strategic “voting”) Tuomas Sandholm Professor Computer Science Department Carnegie Mellon University.
6.853: Topics in Algorithmic Game Theory Fall 2011 Constantinos Daskalakis Lecture 22.
Automated mechanism design Vincent Conitzer
CS Foundations of Electronic Marketplaces Summary & future research directions Tuomas Sandholm Computer Science Department Carnegie Mellon University.
Web-Mining Agents Multiple Agents and Rational Behavior: Mechanism Design Ralf Möller Institut für Informationssysteme Universität zu Lübeck.
Automated mechanism design
Bayesian games and mechanism design
Ralf Möller Institut für Informationssysteme Universität zu Lübeck
Comp/Math 553: Algorithmic Game Theory Lecture 08
CPS Mechanism design Michael Albert and Vincent Conitzer
Tuomas Sandholm Computer Science Department Carnegie Mellon University
Arbitration and Mediation
Implementation in Bayes-Nash equilibrium
Game Theory in Wireless and Communication Networks: Theory, Models, and Applications Lecture 6 Auction Theory Zhu Han, Dusit Niyato, Walid Saad, Tamer.
Implementation in Bayes-Nash equilibrium
Social choice theory = preference aggregation = voting assuming agents tell the truth about their preferences Tuomas Sandholm Professor Computer Science.
Vincent Conitzer Mechanism design Vincent Conitzer
Vincent Conitzer CPS 173 Mechanism design Vincent Conitzer
Automated mechanism design
Chapter Thirty-Five Public Goods.
Auctions Lirong Xia. Auctions Lirong Xia Sealed-Bid Auction One item A set of bidders 1,…,n bidder j’s true value vj bid profile b = (b1,…,bn) A sealed-bid.
Implementation in Bayes-Nash equilibrium
Auction Theory תכנון מכרזים ומכירות פומביות
Vincent Conitzer CPS Mechanism design Vincent Conitzer
Presentation transcript:

Mechanism Design II CS 886:Electronic Market Design Sept 27, 2004

Clarke tax mechanism… Pros –Social welfare maximizing outcome –Truth-telling is a dominant strategy –Feasible in that it does not need a benefactor (  i m i  0)

Clarke tax mechanism… Cons Budget balance not maintained (in pool example, generally  i m i < 0) –Have to burn the excess money that is collected –Thrm. [Green & Laffont 1979]. Let the agents have quasilinear preferences u i (x, m) = m i + v i (x) where v i (x) are arbitrary functions. No social choice function that is (ex post) welfare maximizing (taking into account money burning as a loss) is implementable in dominant strategies Vulnerable to collusion –Even by coalitions of just 2 agents

Implementation in Bayes-Nash equilibrium

Goal is to design the rules of the game (aka mechanism) so that in Bayes-Nash equilibrium (s 1, …, s n ), the outcome of the game is f(  1,…,  n ) Weaker requirement than dominant strategy implementation –An agent’s best response strategy may depend on others’ strategies Agents may benefit from counterspeculating each others’ –Preferences, rationality, endowments, capabilities… –Can accomplish more than under dominant strategy implementation E.g., budget balance & Pareto efficiency (social welfare maximization) under quasilinear preferences …

Expected externality mechanism [d’Aspremont & Gerard-Varet 79; Arrow 79] Like Groves mechanism, but sidepayment is computed based on agent’s revelation v i, averaging over possible true types of the others v -i * Outcome (x, t 1,t 2,…,t n ) Quasilinear preferences: u i (x, t i ) = v i (x)-t i Utilitarian setting: Social welfare maximizing choice –Outcome x(v 1, v 2,..., v n ) = max x  i v i (x) Others’ expected welfare when agent i announces v i is  (v i ) =  v -i p(v -i )  j  i v j (x(v i, v -i )) –Measures change in expected externality as agent i changes her revelation * Assume that an agent’s type is its value function

Expected externality mechanism [d’Aspremont & Gerard-Varet 79; Arrow 79] Thrm. Assume quasilinear preferences and statistically independent valuation functions v i. A utilitarian social choice function f: v -> (x(v), t(v)) can be implemented in Bayes-Nash equilibrium if t i (v i )=  (v i ) + h i (v -i ) for arbitrary function h Unlike in dominant strategy implementation, budget balance is achievable –Intuitively, have each agent contribute an equal share of others’ payments –Formally, set h i (v -i ) = - [1 / (n-1)]  j  i  (v j ) Does not satisfy participation constraints (aka individual rationality constraints) in general –Agent might get higher expected utility by not participating

Participation Constraints Agents can not be forced to participate in a mechanism –It must be in their own best interest A mechanism is individually rational if an agent’s (expected) utility from participating is (weakly) better than what it could get by not participating

Participation Constraints Let u i * (  i ) be an agent’s utility if it does not participate and has type  i Ex ante IR: An agent must decide to participate before it knows its own type E  2  [u i (f(  ),  i )] ¸ E  i 2  i [u i * (  i )] Interim IR: An agent decides whether to participate once it knows its own type, but no other agent’s type E  -i 2  -i [u i (f(  i,  -i ),  i )] ¸ u i * (  i ) Ex post IR: An agent decides whether to participate after it knows everyone’s types (after the mechanism has completed) u i (f(  ),  i ) ¸ u i * (  i )

Quick Review Gibbard-Satterthwaite –Impossible to get non-dictatorial mechanisms if using dominant strategy implementation and general preferences Groves –Possible to get dominant strategy implementation with quasi-linear utilities Efficient Clarke (or VCG) –Possible to get dominant strat implementation with quasi-linear utilities Efficient, interim IR D’AVGA –Possible to get Bayesian-Nash implementation with quasi-linear utilities Efficient, budget balanced, ex ante IR

Other mechanisms We know what to do with –Voting –Auctions –Public projects Are there any other “markets” that are interesting?

Bilateral Trade Heart of any exchange 2 agents (one buyer, one seller), quasi-linear utilities Each agent knows its own value, but not the other’s Probability distributions are common knowledge Want a mechanism that is –Ex post budget balanced –Ex post Pareto efficient: exchange to occur if v b ¸ v s –(Interim) IR: Higher expected utility from participating than by not participating

Myerson-Satterthwaite Thm Thm: In the bilateral trading problem, no mechanism can implement an ex-post BB, ex post efficient, and interim IR social choice function (even in Bayes- Nash equilibrium).

Proof Seller’s valuation is s L w.p.  and s H w.p. (1-  ) Buyer’s valuation is b L w.p.  and b H w.p. (1-  ). Say b H > s H > b L > s L By revelation principle, can focus on truthful direct revelation mechanisms p(b,s) = probability that car changes hands given revelations b and s –Ex post efficiency requires: p(b,s) = 0 if (b = b L and s = s H ), otherwise p(b,s) = 1 –Thus, E[p|b=b H ] = 1 and E[p|b = b L ] =  –E[p|s = s H ] = 1-  and E[p|s = s L ] =  m(b,s) = expected price buyer pays to seller given revelations b and s –Since parties are risk neutral, equivalently m(b,s) = actual price buyer pays to seller –Since buyer pays what seller gets paid, this maintains budget balance ex post –E[m|b] = (1-  ) m(b, s H ) +  m(b, s L ) –E[m|s] = (1-  ) m(b H, s) +  m(b L, s)

Proof Individual rationality (IR) requires –b E[p|b] – E[m|b]  0 for b = b L, b H –E[m|s] – s E[p|s]  0 for s = s L, s H Bayes-Nash incentive compatibility (IC) requires –b E[p|b] – E[m|b]  b E[p|b’] – E[m|b’] for all b, b’ –E[m|s] – s E[m|s]  E[m|s’] – s E[m|s’] for all s, s’ Suppose  = ½, s L =0, s H =y, b L =x, b H =x+y, where 0 < 3x < y. Now, IR(b L ): ½ x – [ ½ m(b L,s H ) + ½ m(b L,s L )]  0 IR(s H ): [½ m(b H,s H ) + ½ m(b L,s H )] - ½ y  0 Summing gives m(b H,s H ) - m(b L,s L )  y-x Also, IC(s L ): [½ m(b H,s L ) + ½ m(b L,s L )]  [½ m(b H,s H ) + ½ m(b L,s H )] –I.e., m(b H,s L ) - m(b L,s H )  m(b H,s H ) - m(b L,s L ) IC(b H ): (x+y) - [½ m(b H,s H ) + ½ m(b H,s L )]  ½ (x+y) - [½ m(b L,s H ) + ½ m(b L,s L )] –I.e., x+y  m(b H,s H ) - m(b L,s L ) + m(b H,s L ) - m(b L,s H ) –So, x+y  2 [m(b H,s H ) - m(b L,s L )]  2(y-x). So, 3x  y, contradiction. QED

Does market design matter? You often here “The market will take care of “it”, if allowed to.” Myerson-Satterthwaite shows that under reasonable assumptions, the market will NOT take care of efficient allocation For example, if we introduced a disinterested 3 rd party (auctioneer), we could get an efficient allocation