Mechanism design with correlated distributions. Michael Albert and Vincent Conitzer and
|
|
- Hannah Wilkinson
- 5 years ago
- Views:
Transcription
1 Mechanism design with correlated distributions Michael Albert and Vincent Conitzer and
2 Impossibility results from mechanism design with independent valuations Myerson auction is revenue optimal for independent valuations This is an impossibility result in disguise! Myerson auction doesn t always allocate the item, and it doesn t always charge the bidders valuation Bidder s virtual valuation ψ(v i )= v i - (1 - F i (v i ))/f i (v i ) The bidder with the highest virtual valuation (according to his reported valuation) wins (unless all virtual valuations are below 0, in which case nobody wins) Winner pays value of lowest bid that would have made him win Combined with the revenue equivalence theorem, we have an impossibility result. The impossibility result is: we can t efficiently allocate an item and maximize revenue at the same time. More than that, we have to give some of the utility to the bidders because they have private information.
3 Why should we care about maximizing revenue? Auctions are one of the fundamental tools of the modern economy In 2012 four government agencies purchased $800 million through reverse auctions (Government Office of Accountability 2013) In 2014, NASA awarded contracts to Boeing and Space-X worth $4.2 billion and $2.6 billion through an auction process (NASA 2014) In 2014, $10 billion of ad revenue was generated through auctions (IAB 2015) The FCC spectrum auction, currently in the final round, expects to allocate between $60 and $80 billion worth of broadcast spectrum It is important that the mechanisms we use are revenue optimal!
4 Do current techniques get us close enough? Standard simple mechanisms do very well with large numbers of bidders VCG mechanism revenue with n+1 bidders optimal revenue mechanism with n bidders, for IID bidders (Bulow and Klemperer 1996) For thin markets, must use knowledge of the distribution of bidders We use the distribution to set the reserve price for a Myerson auction Thin markets are a large concern Sponsored search auctions with rare keywords or ad quality ratings Of 19,688 reverse auctions by four governmental organizations in 2012, one third had only a single bidder (GOA 2013)
5 What if Types are Correlated? This result is for all possible distributions over bidder valuations Specifically, the impossibility of efficient allocation and revenue maximization must encompass the case where the agents types are independent. This is unlikely to hold in many situations Oil drilling rights Sponsored search auctions Anything with a common value component (like similar inputs) Under correlation, we can break this impossibility result Cremer and McLean (1985, 1988), Albert, Conitzer, Lopomo (2016)
6 Example: Divorce arbitration Outcomes: Each agent is of high type w.p..2 and low type w.p..8 Preferences of high type: u(get the painting) = 11,000 u(museum) = 6,000 u(other gets the painting) = 1,000 u(burn) = 0 Preferences of low type: u(get the painting) = 1,200 u(museum) = 1,100 u(other gets the painting) = 1,000 H L H.2*.2 =.04.2*.8 =.16 Distribution under independent valuations u(burn) = 0 Maximum Expected Revenue = 4,320 Maximum Utility = 5,728 L.8*.2 =.16.8*.8 =.64
7 Perfectly Correlated Distribution high low high.2 0 low 0.8 Maximum Social Welfare = 12,000*.2 + 2,200*.8 = 4,160
8 Clarke (VCG) mechanism high low high Both pay 5,000 Husband pays 200 low Wife pays 200 Both pay 100 Expected sum Revenue of divorcees = 10,000*.2 utilities + 200*.8 = (12, )*.2 = 2,160 + ( )*.8 = 2000
9 Mechanism with Perfect Correlation high low high Both pay nothing Both pay nothing low Both pay nothing Both pay nothing Expected sum of divorcees utilities = (12,000)*.2 + (2200)*.8 = 4,160
10 Maximum Revenue with Perfect Correlation high low high Both pay $6000 Both pay nothing low Both pay nothing Both pay $1100 Expected sum Revenue of divorcees = 4160 utilities = (12,000 12,000)*.2 + ( )*.8 = 0
11 Clarke (VCG) mechanism + side payments high low high Both pay 5,000 & both pay 1,000 Husband pays 200 & husband pays 1,000, Wife pays 1,000 low Wife pays 200 & husband pays 1,000, Wife pays 1,000 Both pay 100 & both pay 1,000 Expected sum Revenue of divorcees = 4160 utilities = (12,000 12,000)*.2 + ( )*.8 = 0
12 How much correlation do we need to maximize revenue? Need to look at ex-interim individually rational (IR) mechanisms: θ i π(θ i θ i )(p o, θ i, θ i v o, θ i x θ i, θ i ) 0 For now we will use dominant strategy (ex-post) incentive compatible: p o, θ i, θ i v o, θ i x θ i, θ i p o, θ i, θ i v o, θ i x θ i, θ i Nearly any correlation will do! In fact, for bidders with two types each, any correlation at all will do! We can do this with a Groves mechanism!
13 Slightly Correlated Valuations H L H L high low high Both pay 5,000 Both pay 106,300 Husband pays 200 Husband receives 23,300 Wife pays 106,300 low Wife pays 200 Wife receives 23,300 Husband pays 106,300 Both pay 100 Both receive 23,300 Maximum Expected Utility = 5,630 Expected revenue = 5,630
14 Cremer-McLean Condition
15
16
17
18
19
20
21 Can we do better than Cremer-McLean? The Cremer-McLean condition is sufficient, but not necessary While the condition is generic for two (or more) bidders with the same number of types, is this always going to be the case? What if we really have an external signal that we are using to condition payments, so that there is only one bidder? Ad auctions with click through rates of related ads Prices of commodities that are used as part of the production process What if we don t know the distribution well? Maybe we want to bin the other bidders bids in order to estimate a smaller distribution What is both necessary and sufficient?
22
23
24
25
26
27
28 Necessary and Sufficient Condition for Ex- Interim IR and Dominant Strategy IC Full Revenue
29 Why restrict ourselves to Dominant Strategy IC? While dominant strategy IC is sufficient to give us a generic condition when there are sufficient bidders, we ve already seen that is not necessarily the case. Can we relax the necessary conditions if we consider BNE incentive compatibility? θ i π(θ i θ i )(p o, θ i, θ i v o, θ i x θ i, θ i ) θ i π(θ i θ i )(p o, θ i, θ i v o, θ i x θ i, θ i ) This gives us the ability to have multiple lotteries over the external signal.
30
31
32
33
34
35
36
37
38
39 Necessary and Sufficient Condition for Ex- Interim IR and BNE IC Full Revenue
40 A whirlwind tour of other interesting results in this area
41 Impossibility results from mechanism design with independent valuations Myerson-Satterthwaite Impossibility Theorem [1983]: We would like a mechanism that: is efficient, is budget-balanced (all the money stays in the system), is BNE incentive compatible, and is ex-interim individually rational This is impossible! v( ) = x v( ) = y
42 Sufficient Conditions for Strongly Budget Balanced Mechanisms with Correlated Distributions For Interim IR and BNE IC mechanisms, it is possible to construct an efficient and budget balanced mechanism! (Kosenok and Severinov 2008) Given the following conditions: The Cremer-McLean condition holds. For any distribution over bidder types π that is not the true distribution π, it is impossible for at least one bidder to replicate their conditional distribution under the fake distribution, π i θ i, by strategically misreporting their own type. This ensures that the mechanism designer always has someone who he knows isn t lying to give the excess payments to. Both of these conditions are generic for three bidders, i.e. any random distribution will satisfy these conditions with probability 1.
43 Correlated vs Interdependent Values So far, we have been discussing correlated valuations: Mineral rights problem However, valuations may instead be interdependent: Common resale value Suppose that there are two bidders bidding for a lawnmower, each receiving an independent signal, s i, and the winning bidder can sell the lawnmower to the losing bidder at half his value. s i U[0,1], and the valuation for each bidder is v i (s 1, s 2 ) = s i s i. Then bidders can t report their valuations only their signals! Signals are independent but values are not! Can t extract full surplus (doesn t satisfy the Cremer-McLean Condition). What is the optimal mechanism in this example? However, signals can also be correlated, and we recover the Cremer-McLean result.
44 Correlated Mechanism Design with Ex-Post Mechanisms Note that BNE mechanisms have a few undesirable properties: May require the bidder to pay more than his valuation for the item What if the bidder is risk averse? Requires that the bidder knows the true distribution in order to reason about his best report Is susceptible to forming coalitions (like peer prediction with scoring rules) We can sidestep these issues if we use ex-post mechanisms Always guarantees positive and maximal utility for reporting truthfully Bidder doesn t need to know the distributions to know that he would not be better off mis-reporting Any member of a coalition always has a weakly dominant strategy to deviate and tell the truth Note that we can do arbitrarily bad by using ex-post vs interim mechanisms See Albert, Conitzer, and Lopomo (2016)
45 1-Lookahead Auction (Generalized English Auction) The 1-Lookahead auction is a simple ex-post mechanism Run a Japanese auction until only one person is in the room, bidder i. The time where everyone else leaves tells you their valuation When only one person is left in the room, compute π(θ i θ i ). Calculate the optimal reserve price for bidder i given π(θ i θ i ), r i. If bidder i s valuation is larger than the reserve price, bidder i pays either the second highest bid or the reserve price, whichever is higher. Otherwise, the item is not allocated. For general correlated valuation settings, this is a 2-approximation to the optimal ex-post mechanism (Ronen 2001). For symmetric distributions, this is the optimal mechanism (Lopomo 2000). For interdependent valuations, this is also optimal with a couple of additional assumptions (Lopomo 2000).
46 Can we do anything prior free? All of the mechanisms that we have discussed have relied strongly on the assumption that we know the prior distribution What if we don t know the prior and we can t estimate it? The Dhangwatnotai et. al. [2010] single sample mechanism Elicit reports from bidders θ i. Choose a reserve bidder uniformly at random, denote his report by θ r. Find the highest bidder whose report is above the reserve report. If this bidder doesn t exist, don t allocate the item. Charge the highest bidder the value that he would have had to report to win the item (like in the Myerson auction). This simple prior-free mechanism is a constant factor approximation to the optimal revenue of an ex-post IR and IC mechanism for both correlated and interdependent valuations (Roughgarden and Talgam- Cohen 2013). This requires a few assumptions symmetric, matroid, affiliated
47 Open questions What is the optimal mechanism for distributions that do not satisfy the Albert-Conitzer-Lopomo condition? Conjecture that with affiliation this becomes something like a Myerson auction where the reserve price is a menu of lotteries What is the optimal mechanism that is weakly strategyproof for coalitions without side payments? What is the computational complexity of calculating this mechanism? What is the optimal prior-independent mechanism Single sample is a constant factor approximation, but it s not necessarily the best approximation Will require restrictive assumptions
Bayesian games and their use in auctions. Vincent Conitzer
Bayesian games and their use in auctions Vincent Conitzer conitzer@cs.duke.edu What is mechanism design? In mechanism design, we get to design the game (or mechanism) e.g. the rules of the auction, marketplace,
More informationMechanism Design and Auctions
Mechanism Design and Auctions Game Theory Algorithmic Game Theory 1 TOC Mechanism Design Basics Myerson s Lemma Revenue-Maximizing Auctions Near-Optimal Auctions Multi-Parameter Mechanism Design and the
More informationConsider the following (true) preference orderings of 4 agents on 4 candidates.
Part 1: Voting Systems Consider the following (true) preference orderings of 4 agents on 4 candidates. Agent #1: A > B > C > D Agent #2: B > C > D > A Agent #3: C > B > D > A Agent #4: D > C > A > B Assume
More informationMechanism Design and Auctions
Multiagent Systems (BE4M36MAS) Mechanism Design and Auctions Branislav Bošanský and Michal Pěchouček Artificial Intelligence Center, Department of Computer Science, Faculty of Electrical Engineering, Czech
More informationParkes Auction Theory 1. Auction Theory. Jacomo Corbo. School of Engineering and Applied Science, Harvard University
Parkes Auction Theory 1 Auction Theory Jacomo Corbo School of Engineering and Applied Science, Harvard University CS 286r Spring 2007 Parkes Auction Theory 2 Auctions: A Special Case of Mech. Design Allocation
More informationDay 3. Myerson: What s Optimal
Day 3. Myerson: What s Optimal 1 Recap Last time, we... Set up the Myerson auction environment: n risk-neutral bidders independent types t i F i with support [, b i ] and density f i residual valuation
More informationMatching Markets and Google s Sponsored Search
Matching Markets and Google s Sponsored Search Part III: Dynamics Episode 9 Baochun Li Department of Electrical and Computer Engineering University of Toronto Matching Markets (Required reading: Chapter
More informationNotes on Auctions. Theorem 1 In a second price sealed bid auction bidding your valuation is always a weakly dominant strategy.
Notes on Auctions Second Price Sealed Bid Auctions These are the easiest auctions to analyze. Theorem In a second price sealed bid auction bidding your valuation is always a weakly dominant strategy. Proof
More information1 Theory of Auctions. 1.1 Independent Private Value Auctions
1 Theory of Auctions 1.1 Independent Private Value Auctions for the moment consider an environment in which there is a single seller who wants to sell one indivisible unit of output to one of n buyers
More informationOptimal Auctions. Game Theory Course: Jackson, Leyton-Brown & Shoham
Game Theory Course: Jackson, Leyton-Brown & Shoham So far we have considered efficient auctions What about maximizing the seller s revenue? she may be willing to risk failing to sell the good she may be
More informationAuctions. Episode 8. Baochun Li Professor Department of Electrical and Computer Engineering University of Toronto
Auctions Episode 8 Baochun Li Professor Department of Electrical and Computer Engineering University of Toronto Paying Per Click 3 Paying Per Click Ads in Google s sponsored links are based on a cost-per-click
More informationAuctions. Michal Jakob Agent Technology Center, Dept. of Computer Science and Engineering, FEE, Czech Technical University
Auctions Michal Jakob Agent Technology Center, Dept. of Computer Science and Engineering, FEE, Czech Technical University AE4M36MAS Autumn 2015 - Lecture 12 Where are We? Agent architectures (inc. BDI
More informationECON Microeconomics II IRYNA DUDNYK. Auctions.
Auctions. What is an auction? When and whhy do we need auctions? Auction is a mechanism of allocating a particular object at a certain price. Allocating part concerns who will get the object and the price
More informationAlgorithmic Game Theory
Algorithmic Game Theory Lecture 10 06/15/10 1 A combinatorial auction is defined by a set of goods G, G = m, n bidders with valuation functions v i :2 G R + 0. $5 Got $6! More? Example: A single item for
More informationAuctions. Michal Jakob Agent Technology Center, Dept. of Computer Science and Engineering, FEE, Czech Technical University
Auctions Michal Jakob Agent Technology Center, Dept. of Computer Science and Engineering, FEE, Czech Technical University AE4M36MAS Autumn 2014 - Lecture 12 Where are We? Agent architectures (inc. BDI
More informationFrom Bayesian Auctions to Approximation Guarantees
From Bayesian Auctions to Approximation Guarantees Tim Roughgarden (Stanford) based on joint work with: Jason Hartline (Northwestern) Shaddin Dughmi, Mukund Sundararajan (Stanford) Auction Benchmarks Goal:
More informationAuction Theory: Some Basics
Auction Theory: Some Basics Arunava Sen Indian Statistical Institute, New Delhi ICRIER Conference on Telecom, March 7, 2014 Outline Outline Single Good Problem Outline Single Good Problem First Price Auction
More informationAssessing the Robustness of Cremer-McLean with Automated Mechanism Design
Assessing the Robustness of Cremer-McLean with Automated Mechanism Design Michael Albert The Ohio State University Fisher School of Business 2100 Neil Ave., Fisher Hall 844 Columbus, OH 43210, USA Michael.Albert@fisher.osu.edu
More informationCS364B: Frontiers in Mechanism Design Lecture #18: Multi-Parameter Revenue-Maximization
CS364B: Frontiers in Mechanism Design Lecture #18: Multi-Parameter Revenue-Maximization Tim Roughgarden March 5, 2014 1 Review of Single-Parameter Revenue Maximization With this lecture we commence the
More informationRecap First-Price Revenue Equivalence Optimal Auctions. Auction Theory II. Lecture 19. Auction Theory II Lecture 19, Slide 1
Auction Theory II Lecture 19 Auction Theory II Lecture 19, Slide 1 Lecture Overview 1 Recap 2 First-Price Auctions 3 Revenue Equivalence 4 Optimal Auctions Auction Theory II Lecture 19, Slide 2 Motivation
More informationMechanism Design and Auctions
Mechanism Design and Auctions Kevin Leyton-Brown & Yoav Shoham Chapter 7 of Multiagent Systems (MIT Press, 2012) Drawing on material that first appeared in our own book, Multiagent Systems: Algorithmic,
More informationMultiunit Auctions: Package Bidding October 24, Multiunit Auctions: Package Bidding
Multiunit Auctions: Package Bidding 1 Examples of Multiunit Auctions Spectrum Licenses Bus Routes in London IBM procurements Treasury Bills Note: Heterogenous vs Homogenous Goods 2 Challenges in Multiunit
More informationRevenue Equivalence and Mechanism Design
Equivalence and Design Daniel R. 1 1 Department of Economics University of Maryland, College Park. September 2017 / Econ415 IPV, Total Surplus Background the mechanism designer The fact that there are
More informationAuctions. Agenda. Definition. Syllabus: Mansfield, chapter 15 Jehle, chapter 9
Auctions Syllabus: Mansfield, chapter 15 Jehle, chapter 9 1 Agenda Types of auctions Bidding behavior Buyer s maximization problem Seller s maximization problem Introducing risk aversion Winner s curse
More informationOn Approximating Optimal Auctions
On Approximating Optimal Auctions (extended abstract) Amir Ronen Department of Computer Science Stanford University (amirr@robotics.stanford.edu) Abstract We study the following problem: A seller wishes
More informationAd Auctions October 8, Ad Auctions October 8, 2010
Ad Auctions October 8, 2010 1 Ad Auction Theory: Literature Old: Shapley-Shubik (1972) Leonard (1983) Demange-Gale (1985) Demange-Gale-Sotomayor (1986) New: Varian (2006) Edelman-Ostrovsky-Schwarz (2007)
More informationUp till now, we ve mostly been analyzing auctions under the following assumptions:
Econ 805 Advanced Micro Theory I Dan Quint Fall 2007 Lecture 7 Sept 27 2007 Tuesday: Amit Gandhi on empirical auction stuff p till now, we ve mostly been analyzing auctions under the following assumptions:
More informationAuctions Introduction
Auctions Introduction CPSC 532A Lecture 20 November 21, 2006 Auctions Introduction CPSC 532A Lecture 20, Slide 1 Lecture Overview 1 Recap 2 VCG caveats 3 Auctions 4 Standard auctions 5 More exotic auctions
More informationParkes Mechanism Design 1. Mechanism Design I. David C. Parkes. Division of Engineering and Applied Science, Harvard University
Parkes Mechanism Design 1 Mechanism Design I David C. Parkes Division of Engineering and Applied Science, Harvard University CS 286r Spring 2003 Parkes Mechanism Design 2 Mechanism Design Central question:
More informationOptimal Mixed Spectrum Auction
Optimal Mixed Spectrum Auction Alonso Silva Fernando Beltran Jean Walrand Electrical Engineering and Computer Sciences University of California at Berkeley Technical Report No. UCB/EECS-13-19 http://www.eecs.berkeley.edu/pubs/techrpts/13/eecs-13-19.html
More informationDynamic Marginal Contribution Mechanism
Dynamic Marginal Contribution Mechanism Dirk Bergemann and Juuso Välimäki DIMACS: Economics and Computer Science October 2007 Intertemporal Efciency with Private Information random arrival of buyers, sellers
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 Revenue Equivalence Theorem Note: This is a only a draft
More informationProblem Set 3: Suggested Solutions
Microeconomics: Pricing 3E00 Fall 06. True or false: Problem Set 3: Suggested Solutions (a) Since a durable goods monopolist prices at the monopoly price in her last period of operation, the prices must
More informationECO 426 (Market Design) - Lecture 9
ECO 426 (Market Design) - Lecture 9 Ettore Damiano November 30, 2015 Common Value Auction In a private value auction: the valuation of bidder i, v i, is independent of the other bidders value In a common
More informationSPECTRUM MARKETS. Randall Berry, Michael Honig Department of EECS Northwestern University. DySPAN Conference, Aachen, Germany
1 SPECTRUM MARKETS Randall Berry, Michael Honig Department of EECS Northwestern University DySPAN Conference, Aachen, Germany Spectrum Management 2 Economics Policy Communications Engineering Why This
More informationOn the Competitive Effects of Bidding Syndicates
On the Competitive Effects of Bidding Syndicates Mike Shor Vlad Mares October 2008 Midwest Theory (October 2008) Syndicates 1 / 17 Motivation Industry Motivation Mergers in auction markets Joint exploration
More informationRecalling that private values are a special case of the Milgrom-Weber setup, we ve now found that
Econ 85 Advanced Micro Theory I Dan Quint Fall 27 Lecture 12 Oct 16 27 Last week, we relaxed both private values and independence of types, using the Milgrom- Weber setting of affiliated signals. We found
More informationOn Existence of Equilibria. Bayesian Allocation-Mechanisms
On Existence of Equilibria in Bayesian Allocation Mechanisms Northwestern University April 23, 2014 Bayesian Allocation Mechanisms In allocation mechanisms, agents choose messages. The messages determine
More informationAgent-Based Systems. Agent-Based Systems. Michael Rovatsos. Lecture 11 Resource Allocation 1 / 18
Agent-Based Systems Michael Rovatsos mrovatso@inf.ed.ac.uk Lecture 11 Resource Allocation 1 / 18 Where are we? Coalition formation The core and the Shapley value Different representations Simple games
More informationAuctions. N i k o l a o s L i o n i s U n i v e r s i t y O f A t h e n s. ( R e v i s e d : J a n u a r y )
Auctions 1 N i k o l a o s L i o n i s U n i v e r s i t y O f A t h e n s ( R e v i s e d : J a n u a r y 2 0 1 7 ) Common definition What is an auction? A usually public sale of goods where people make
More informationOptimal selling rules for repeated transactions.
Optimal selling rules for repeated transactions. Ilan Kremer and Andrzej Skrzypacz March 21, 2002 1 Introduction In many papers considering the sale of many objects in a sequence of auctions the seller
More informationCountering the Winner s Curse: Optimal Auction Design in a Common Value Model
Countering the Winner s Curse: Optimal Auction Design in a Common Value Model Dirk Bergemann Benjamin Brooks Stephen Morris November 16, 2018 Abstract We characterize revenue maximizing mechanisms in a
More informationLecture 3: Information in Sequential Screening
Lecture 3: Information in Sequential Screening NMI Workshop, ISI Delhi August 3, 2015 Motivation A seller wants to sell an object to a prospective buyer(s). Buyer has imperfect private information θ about
More informationMicroeconomic Theory II Preliminary Examination Solutions
Microeconomic Theory II Preliminary Examination Solutions 1. (45 points) Consider the following normal form game played by Bruce and Sheila: L Sheila R T 1, 0 3, 3 Bruce M 1, x 0, 0 B 0, 0 4, 1 (a) Suppose
More informationApril 29, X ( ) for all. Using to denote a true type and areport,let
April 29, 2015 "A Characterization of Efficient, Bayesian Incentive Compatible Mechanisms," by S. R. Williams. Economic Theory 14, 155-180 (1999). AcommonresultinBayesianmechanismdesignshowsthatexpostefficiency
More informationCS269I: Incentives in Computer Science Lecture #14: More on Auctions
CS69I: Incentives in Computer Science Lecture #14: More on Auctions Tim Roughgarden November 9, 016 1 First-Price Auction Last lecture we ran an experiment demonstrating that first-price auctions are not
More informationGame Theory Lecture #16
Game Theory Lecture #16 Outline: Auctions Mechanism Design Vickrey-Clarke-Groves Mechanism Optimizing Social Welfare Goal: Entice players to select outcome which optimizes social welfare Examples: Traffic
More information2534 Lecture 10: Mechanism Design and Auctions
2534 Lecture 10: Mechanism Design and Auctions Mechanism Design re-introduce mechanisms and mechanism design key results in mechanism design, auctions as an illustration we ll briefly discuss (though we
More informationMicroeconomic Theory II Preliminary Examination Solutions Exam date: August 7, 2017
Microeconomic Theory II Preliminary Examination Solutions Exam date: August 7, 017 1. Sheila moves first and chooses either H or L. Bruce receives a signal, h or l, about Sheila s behavior. The distribution
More informationRobust Trading Mechanisms with Budget Surplus and Partial Trade
Robust Trading Mechanisms with Budget Surplus and Partial Trade Jesse A. Schwartz Kennesaw State University Quan Wen Vanderbilt University May 2012 Abstract In a bilateral bargaining problem with private
More informationAgent and Object Technology Lab Dipartimento di Ingegneria dell Informazione Università degli Studi di Parma. Distributed and Agent Systems
Agent and Object Technology Lab Dipartimento di Ingegneria dell Informazione Università degli Studi di Parma Distributed and Agent Systems Coordination Prof. Agostino Poggi Coordination Coordinating is
More informationSo we turn now to many-to-one matching with money, which is generally seen as a model of firms hiring workers
Econ 805 Advanced Micro Theory I Dan Quint Fall 2009 Lecture 20 November 13 2008 So far, we ve considered matching markets in settings where there is no money you can t necessarily pay someone to marry
More informationToday. Applications of NE and SPNE Auctions English Auction Second-Price Sealed-Bid Auction First-Price Sealed-Bid Auction
Today Applications of NE and SPNE Auctions English Auction Second-Price Sealed-Bid Auction First-Price Sealed-Bid Auction 2 / 26 Auctions Used to allocate: Art Government bonds Radio spectrum Forms: Sequential
More informationCombinatorial Exchanges. David C. Parkes Harvard University
Combinatorial Exchanges David C. Parkes Harvard University What is a combinatorial exchange? Two-sided Complex valuations (swaps, contingent swaps, all-or-nothing sells, etc.) Fragmented Spectrum (E.Kwerel)
More informationAuction is a commonly used way of allocating indivisible
Econ 221 Fall, 2018 Li, Hao UBC CHAPTER 16. BIDDING STRATEGY AND AUCTION DESIGN Auction is a commonly used way of allocating indivisible goods among interested buyers. Used cameras, Salvator Mundi, and
More informationProf. Bryan Caplan Econ 812
Prof. Bryan Caplan bcaplan@gmu.edu http://www.bcaplan.com Econ 812 Week 9: Asymmetric Information I. Moral Hazard A. In the real world, everyone is not equally in the dark. In every situation, some people
More informationSocially optimal allocation of ATM resources via truthful market-based mechanisms. Tobias Andersson Granberg Valentin Polishchuk
Socially optimal allocation of ATM resources via truthful market-based mechanisms Tobias Andersson Granberg Valentin Polishchuk Market mechanism Resource 2 Resource n User 1 User 2 Payment Bid 1 1 Payment
More informationGames of Incomplete Information ( 資訊不全賽局 ) Games of Incomplete Information
1 Games of Incomplete Information ( 資訊不全賽局 ) Wang 2012/12/13 (Lecture 9, Micro Theory I) Simultaneous Move Games An Example One or more players know preferences only probabilistically (cf. Harsanyi, 1976-77)
More informationRisk and Return and Portfolio Theory
Risk and Return and Portfolio Theory Intro: Last week we learned how to calculate cash flows, now we want to learn how to discount these cash flows. This will take the next several weeks. We know discount
More informationIn Diamond-Dybvig, we see run equilibria in the optimal simple contract.
Ennis and Keister, "Run equilibria in the Green-Lin model of financial intermediation" Journal of Economic Theory 2009 In Diamond-Dybvig, we see run equilibria in the optimal simple contract. When the
More informationAuctioning one item. Tuomas Sandholm Computer Science Department Carnegie Mellon University
Auctioning one item Tuomas Sandholm Computer Science Department Carnegie Mellon University Auctions Methods for allocating goods, tasks, resources... Participants: auctioneer, bidders Enforced agreement
More informationBayesian Nash Equilibrium
Bayesian Nash Equilibrium We have already seen that a strategy for a player in a game of incomplete information is a function that specifies what action or actions to take in the game, for every possibletypeofthatplayer.
More informationDeep Learning for Revenue-Optimal Auctions with Budgets
Deep Learning for Revenue-Optimal Auctions with Budgets Zhe Feng Harvard SEAS Based on joint work with Harikrishna Narasimhan (Harvard) and David C. Parkes (Harvard) 7/11/2018 AAMAS'18, Stockholm, Sweden
More informationCS364A: Algorithmic Game Theory Lecture #3: Myerson s Lemma
CS364A: Algorithmic Game Theory Lecture #3: Myerson s Lemma Tim Roughgarden September 3, 23 The Story So Far Last time, we introduced the Vickrey auction and proved that it enjoys three desirable and different
More informationParkes Auction Theory 1. Auction Theory. David C. Parkes. Division of Engineering and Applied Science, Harvard University
Parkes Auction Theory 1 Auction Theory David C. Parkes Division of Engineering and Applied Science, Harvard University CS 286r Spring 2003 Parkes Auction Theory 2 Auctions: A Special Case of Mech. Design
More informationAuction Theory Lecture Note, David McAdams, Fall Bilateral Trade
Auction Theory Lecture Note, Daid McAdams, Fall 2008 1 Bilateral Trade ** Reised 10-17-08: An error in the discussion after Theorem 4 has been corrected. We shall use the example of bilateral trade to
More informationExperiments on Auctions
Experiments on Auctions Syngjoo Choi Spring, 2010 Experimental Economics (ECON3020) Auction Spring, 2010 1 / 25 Auctions An auction is a process of buying and selling commodities by taking bids and assigning
More informationAuctions in the wild: Bidding with securities. Abhay Aneja & Laura Boudreau PHDBA 279B 1/30/14
Auctions in the wild: Bidding with securities Abhay Aneja & Laura Boudreau PHDBA 279B 1/30/14 Structure of presentation Brief introduction to auction theory First- and second-price auctions Revenue Equivalence
More informationIndependent Private Value Auctions
John Nachbar April 16, 214 ndependent Private Value Auctions The following notes are based on the treatment in Krishna (29); see also Milgrom (24). focus on only the simplest auction environments. Consider
More information2 Comparison Between Truthful and Nash Auction Games
CS 684 Algorithmic Game Theory December 5, 2005 Instructor: Éva Tardos Scribe: Sameer Pai 1 Current Class Events Problem Set 3 solutions are available on CMS as of today. The class is almost completely
More informationDouble Auction Markets vs. Matching & Bargaining Markets: Comparing the Rates at which They Converge to Efficiency
Double Auction Markets vs. Matching & Bargaining Markets: Comparing the Rates at which They Converge to Efficiency Mark Satterthwaite Northwestern University October 25, 2007 1 Overview Bargaining, private
More informationAuctions. Microeconomics II. Auction Formats. Auction Formats. Many economic transactions are conducted through auctions treasury bills.
Auctions Microeconomics II Auctions Levent Koçkesen Koç University Many economic transactions are conducted through auctions treasury bills art work foreign exchange antiques publicly owned companies cars
More informationPreference Networks in Matching Markets
Preference Networks in Matching Markets CSE 5339: Topics in Network Data Analysis Samir Chowdhury April 5, 2016 Market interactions between buyers and sellers form an interesting class of problems in network
More informationA note on the inefficiency of bargaining over the price of a share
MPRA Munich Personal RePEc Archive A note on the inefficiency of bargaining over the price of a share Stergios Athanassoglou and Steven J. Brams and Jay Sethuraman 1. August 21 Online at http://mpra.ub.uni-muenchen.de/2487/
More informationOPTIMAL AUCTION DESIGN IN A COMMON VALUE MODEL. Dirk Bergemann, Benjamin Brooks, and Stephen Morris. December 2016
OPTIMAL AUCTION DESIGN IN A COMMON VALUE MODEL By Dirk Bergemann, Benjamin Brooks, and Stephen Morris December 2016 COWLES FOUNDATION DISCUSSION PAPER NO. 2064 COWLES FOUNDATION FOR RESEARCH IN ECONOMICS
More informationPROBLEM SET 6 ANSWERS
PROBLEM SET 6 ANSWERS 6 November 2006. Problems.,.4,.6, 3.... Is Lower Ability Better? Change Education I so that the two possible worker abilities are a {, 4}. (a) What are the equilibria of this game?
More informationEvaluating Strategic Forecasters. Rahul Deb with Mallesh Pai (Rice) and Maher Said (NYU Stern) Becker Friedman Theory Conference III July 22, 2017
Evaluating Strategic Forecasters Rahul Deb with Mallesh Pai (Rice) and Maher Said (NYU Stern) Becker Friedman Theory Conference III July 22, 2017 Motivation Forecasters are sought after in a variety of
More informationInternet Trading Mechanisms and Rational Expectations
Internet Trading Mechanisms and Rational Expectations Michael Peters and Sergei Severinov University of Toronto and Duke University First Version -Feb 03 April 1, 2003 Abstract This paper studies an internet
More informationNotes for Section: Week 7
Economics 160 Professor Steven Tadelis Stanford University Spring Quarter, 004 Notes for Section: Week 7 Notes prepared by Paul Riskind (pnr@stanford.edu). spot errors or have questions about these notes.
More informationSingle-Parameter Mechanisms
Algorithmic Game Theory, Summer 25 Single-Parameter Mechanisms Lecture 9 (6 pages) Instructor: Xiaohui Bei In the previous lecture, we learned basic concepts about mechanism design. The goal in this area
More informationTruthful Double Auction Mechanisms
OPERATIONS RESEARCH Vol. 56, No. 1, January February 2008, pp. 102 120 issn 0030-364X eissn 1526-5463 08 5601 0102 informs doi 10.1287/opre.1070.0458 2008 INFORMS Truthful Double Auction Mechanisms Leon
More informationwithout transaction costs, all government allocations are equally efficient, since parties will bargain to correct any externality.
0 Auctions The Coase theorem without transaction costs, all government allocations are equally efficient, since parties will bargain to correct any externality. with transaction costs, government may minimize
More informationG604 Midterm, March 301, 2003 ANSWERS
G604 Midterm, March 301, 2003 ANSWERS Scores: 75, 74, 69, 68, 58, 57, 54, 43. This is a close-book test, except that you may use one double-sided page of notes. Answer each question as best you can. If
More informationUNCERTAINTY AND INFORMATION
UNCERTAINTY AND INFORMATION M. En C. Eduardo Bustos Farías 1 Objectives After studying this chapter, you will be able to: Explain how people make decisions when they are uncertain about the consequences
More informationAnswers to Microeconomics Prelim of August 24, In practice, firms often price their products by marking up a fixed percentage over (average)
Answers to Microeconomics Prelim of August 24, 2016 1. In practice, firms often price their products by marking up a fixed percentage over (average) cost. To investigate the consequences of markup pricing,
More informationIntroduction to mechanism design. Lirong Xia
Introduction to mechanism design Lirong Xia Fall, 2016 1 Last class: game theory R 1 * s 1 Strategy Profile D Mechanism R 2 * s 2 Outcome R n * s n Game theory: predicting the outcome with strategic agents
More informationThe Optimality of Being Efficient. Lawrence Ausubel and Peter Cramton Department of Economics University of Maryland
The Optimality of Being Efficient Lawrence Ausubel and Peter Cramton Department of Economics University of Maryland 1 Common Reaction Why worry about efficiency, when there is resale? Our Conclusion Why
More informationEXTRA PROBLEMS. and. a b c d
EXTRA PROBLEMS (1) In the following matching problem, each college has the capacity for only a single student (each college will admit only one student). The colleges are denoted by A, B, C, D, while the
More informationCOMP/MATH 553 Algorithmic Game Theory Lecture 2: Mechanism Design Basics. Sep 8, Yang Cai
COMP/MATH 553 Algorithmic Game Theory Lecture 2: Mechanism Design Basics Sep 8, 2014 Yang Cai An overview of the class Broad View: Mechanism Design and Auctions First Price Auction Second Price/Vickrey
More informationMicroeconomic Theory II Preliminary Examination Solutions Exam date: June 5, 2017
Microeconomic Theory II Preliminary Examination Solutions Exam date: June 5, 07. (40 points) Consider a Cournot duopoly. The market price is given by q q, where q and q are the quantities of output produced
More informationCSV 886 Social Economic and Information Networks. Lecture 5: Matching Markets, Sponsored Search. R Ravi
CSV 886 Social Economic and Information Networks Lecture 5: Matching Markets, Sponsored Search R Ravi ravi+iitd@andrew.cmu.edu Simple Models of Trade Decentralized Buyers and sellers have to find each
More informationA simulation study of two combinatorial auctions
A simulation study of two combinatorial auctions David Nordström Department of Economics Lund University Supervisor: Tommy Andersson Co-supervisor: Albin Erlanson May 24, 2012 Abstract Combinatorial auctions
More informationStrategy -1- Strategy
Strategy -- Strategy A Duopoly, Cournot equilibrium 2 B Mixed strategies: Rock, Scissors, Paper, Nash equilibrium 5 C Games with private information 8 D Additional exercises 24 25 pages Strategy -2- A
More informationWe have seen that the role of government in promoting efficiency is to intervene in the pricing mechanism of good that create externalities.
4. Public Goods SO FAR We have seen that the role of government in promoting efficiency is to intervene in the pricing mechanism of good that create externalities. Now we will investigate a class of good
More informationPractice Problems 2: Asymmetric Information
Practice Problems 2: Asymmetric Information November 25, 2013 1 Single-Agent Problems 1. Nonlinear Pricing with Two Types Suppose a seller of wine faces two types of customers, θ 1 and θ 2, where θ 2 >
More informationLower Bounds on Revenue of Approximately Optimal Auctions
Lower Bounds on Revenue of Approximately Optimal Auctions Balasubramanian Sivan 1, Vasilis Syrgkanis 2, and Omer Tamuz 3 1 Computer Sciences Dept., University of Winsconsin-Madison balu2901@cs.wisc.edu
More informationPrediction Market, Mechanism Design, and Cooperative Game Theory
Prediction Market, Mechanism Design, and Cooperative Game Theory V. Conitzer presented by Janyl Jumadinova October 16, 2009 Prediction Markets Created for the purpose of making predictions by obtaining
More informationHow Pervasive is the Myerson-Satterthwaite Impossibility?
How Pervasive is the Myerson-Satterthwaite Impossibility? Abraham Othman and Tuomas Sandholm Computer Science Department Carnegie Mellon University {aothman,sandholm}@cs.cmu.edu Abstract The Myerson-Satterthwaite
More informationIntroduction to mechanism design. Lirong Xia
Introduction to mechanism design Lirong Xia Feb. 9, 2016 1 Last class: game theory R 1 * s 1 Strategy Profile D Mechanism R 2 * s 2 Outcome R n * s n Game theory: predicting the outcome with strategic
More informationChapter 3. Dynamic discrete games and auctions: an introduction
Chapter 3. Dynamic discrete games and auctions: an introduction Joan Llull Structural Micro. IDEA PhD Program I. Dynamic Discrete Games with Imperfect Information A. Motivating example: firm entry and
More information