Vickrey Auction VCG Combinatorial Auctions. Mechanism Design. Algorithms and Data Structures. Winter 2016
|
|
- Philippa Davis
- 5 years ago
- Views:
Transcription
1 Mechansm Desgn Algorthms and Data Structures Wnter / 39
2 Vckrey Aucton Vckrey-Clarke-Groves Mechansms Sngle-Mnded Combnatoral Auctons 2 / 39
3 Mechansm Desgn (wth Money) Set A of outcomes to choose from. n bdders wth quantfable preferences. Preference of bdder s gven by a valuaton functon v : A R from a commonly known set V R A A mechansm determnes an outcome a A and payments, charges each bdder some amount m of money Utlty of bdder s v (a) m, quas-lnear utltes. Common currency enables utlty transfer between bdders. 3 / 39
4 Example: Sealed Bd Aucton A sngle tem s sold to one customer. Customer Value Agents report ther values as sealed bd. Socal Choce: Wnner s agent wth hghest bd. Payments: fnd payments to ensure truthful bddng No payments: Bdders strve to bd unboundedly hgh values. Payments = Bds: Bdders try to guess the second hghest bd and bd a slghtly hgher value. 4 / 39
5 Vckrey Second Prce Aucton Payment of the wnner s the second largest bd. Value Payment Utlty Proposton The Vckrey aucton s truthful. 5 / 39
6 Example Value?? 20?? Bd 5 11 x 2 14 Payment 14 Utlty 6 Case 1: wns wth true value x = 20, then for all x 14 utlty 6, for x < 14 utlty 0. Value?? 20?? Bd 5 11 x 2 24 Payment 0 Utlty 0 Case 2: loses wth true value x = 20, then for all x < 24 utlty 0, for x 24 utlty 4. 6 / 39
7 Vckrey Aucton Vckrey-Clarke-Groves Mechansms Sngle-Mnded Combnatoral Auctons 7 / 39
8 Defntons Drect Revelaton Mechansm Denote V = V 1... V n and v V Socal choce functon f : V A A vector of payment functons p 1,..., p n Each functon p : V R specfes the amount bdder pays. Truthfulness / Incentve Compatblty (IC) For every bdder, profle v V, alternatve v V, Denote outcomes by a = f (v, v ) and b = f (v, v ) Mechansm (f, p 1,..., p n) s truthful (or ncentve compatble) f the utlty. v (a) p (v, v ) v (b) p (v, v ) 8 / 39
9 Sealed-Bd Aucton Bdder Value Outcomes A = {1, 2, 3, 4, 5}, where means wns Outcome v v etc. Socal Choce: f (v) = arg max {v ()} Payments: p (v) = 0 f f (v), otherwse p (v) = max j v j (j). 9 / 39
10 VCG Mechansm Defnton A Vckrey-Clarke-Groves (VCG) mechansm s gven by f (v) arg max a A v (a), and for some functons h 1,..., h n wth h : V R and all v V we have p (v) = h (v ) j v j (f (v)) Observatons: VCG mechansm pcks outcome a that maxmzes socal welfare j v j(a) h does not depend on the own bd v Utlty of bdder when f (v) = a: v (a) p (v) = j v j (a) h (v ) 10 / 39
11 VCG s IC Theorem Every VCG mechansm s truthful. Proof: Gven types v, for bdder a le v, and let a = f (v) and b = f (v, v ). Utlty of declarng v s v (a) + j v j(a) h (v ) Utlty of declarng v s v (b) + j v j(b) h (v ) Utlty s maxmzed when outcome maxmzes socal welfare j v j(x). VCG mechansm maxmzes socal welfare, j v j(a) j v j(b). By declarng v bdder, VCG pcks b whch s optmzed for hs le, but possbly suboptmal for the real utlty. VCG algns each bdder ncentve wth the socal ncentves. 11 / 39
12 Desrable Propertes of Payments Defnton A mechansm s (ex-post) ndvdually ratonal f bdders always get non-negatve utlty,.e. for all v V we have v (f (v)) p (v) 0. A mechansm has no postve transfers f no bdder s ever pad money,.e. for all v V and all we have p (v) 0. Defnton (Clarke Rule) The choce h (v ) = max b A j v j(b) s called Clarke pvot payment. Then the payment of bdder becomes p (v) = max b A v j (b) v j (f (v)) j j Payment s the total damage to the other bdders caused by the presence of. Each bdder nternalzes externaltes. 12 / 39
13 Clarke Rule Lemma A VCG mechansm wth Clarke pvot payments makes no postve transfers. If v (a) 0 for all v V and a A, then t s ndvdually ratonal. Proof: Let a = f (v) and b = arg max a A j v j(a ) No postve transfers (by defnton) v j (b) v j (a) 0 j j Indvdually ratonal v (a) + j v j (a) j v j (b) j v j (a) j v j (b) 0 13 / 39
14 Example: Blateral Trade trade no-trade Seller v s 0 Buyer v b 0 Trade occurs f v b > v s, no-trade f v s > v b Analyze VCG Mechansm, should not subsdze trade. 14 / 39
15 Example: Blateral Trade trade no-trade Seller v s 0 Buyer v b 0 VCG payments for no-trade: Seller payments: h s(v b ) 0, Buyer payments: h b (v s) 0 No addtonal payments by the mechansms, so h s(v b ) = h b (v s) = 0. VCG payments for trade: Seller payments: h s(v b ) v b, Buyer payments: h b (v s) + v s Seller receves v b, but buyer pays only v s < v b. Not budget-balanced: VCG mechansm subsdzes trade! 15 / 39
16 Example: Procurement or Reverse Aucton Auctoneer buys servce, partcpants offer servce for a cost Auctoneer pays partcpants Negatve utlty, negatve payments Vckrey aucton: Pck cheapest partcpant, pay second smallest offered cost Corollary The Vckrey reverse aucton s ncentve compatble. 16 / 39
17 Vckrey Reverse Aucton s IC Case 1: If bddng hs true value, bdder wns. Value?? -7?? Bd x Payment -9 Utlty 2 Case 2: If bddng hs true value, bdder loses. Value?? -12?? Bd x Payment 0 Utlty 0 17 / 39
18 Example: Buyng a Path n a Network Reverse aucton: Bdders are edges n a network. Mechansm needs to buy an s-t-path. 18 / 39
19 Example: Buyng a Path n a Network Outcomes are s-t-paths n graph G VCG pcks the shortest path P for reported costs c e Payments for e P are h e(c e) + e e c e (P ) Clarke pvot payment: h e(c e) = mn P G e e P ce Total payment c(p e) c(p e), where P e s shortest path n G when t would not contan e. An edge e P gets no payment. 19 / 39
20 Truth-tellng s a domnant strategy! 20 / 39
21 Frugalty Incentve compatblty mght be EXPENSIVE! 21 / 39
22 Vckrey Aucton Vckrey-Clarke-Groves Mechansms Sngle-Mnded Combnatoral Auctons 22 / 39
23 Ad Auctons 23 / 39
24 General Settng Combnatoral Aucton: Set M of m ndvsble tems (e.g., ad slots) auctoned smultaneously n bdders, valuatons for each subset of tems Who should get whch tems and pay how much? General Allocaton Problem of Interrelated Resources Valuaton v for bdder : v (S) R when gettng assgned set S M free dsposal: S T v(s) v(t ) normalzed: v( ) = / 39
25 Allocaton Allocaton of the tems: S 1,..., S n where S M and S S j = for j. Valuaton of a bdder ndependent of tems receved by other bdders (no externaltes) Socal Welfare: v (S ). An optmal allocaton S 1,..., S n Quas-lnear utltes: v (S ) p (v, v ) maxmzes socal welfare. VCG s truthful wth S, but computng S s NP-hard! Let us restrct attenton to a specal case. 25 / 39
26 Sngle-Mnded Valuatons Defnton A valuaton v s sngle-mnded f there exsts a threshold bundle S t and value v t R + such that v (S) = v t for all S S t, and v (S) = 0 otherwse. A sngle-mnded bd s (S t, v t ), and a bdder can le about both v t and S t. Defnton The allocaton problem among sngle-mnded bdders s gven by: INPUT: (S t, v t ) for each bdder = 1,..., n OUTPUT: Set of wnners W {1,..., n} wth maxmum socal welfare W v t and such that S t Sj t = for each, j W wth j 26 / 39
27 Reducton from Independent Set Theorem The allocaton problem among sngle-mnded bdders s NP-hard. Proof: INDEPENDENT SET: Has a graph an ndependent set of sze at least k? Vertces Bdders, Edges Items (S t, v t ) = (Set of ncdent edges, 1) 27 / 39
28 Approxmaton Algorthms c-approxmaton algorthm: Returns an allocaton T such that wth the optmal allocaton S we have v (T ) v (S ) c Smple n-approxmaton algorthm: Bdder wth the maxmum valuaton gets M. Trvally yelds an IC mechansm, essentally sngle-tem VCG aucton. Theorem For any ɛ > 0 t s NP-hard to approxmate INDEPENDENT SET to wthn a factor of n 1 ɛ. Corollary For any ɛ > 0 t s NP-hard to approxmate the allocaton problem among sngle-mnded bdders to wthn a factor of n 1 ɛ. 28 / 39
29 Approxmaton Algorthms The graph n the reducton has at most m < n 2 edges/tems, hence Proposton For any ɛ > 0 t s NP-hard to approxmate the allocaton problem to wthn a factor of m 1/2 ɛ. Note: m < n for sparse nstances. So far, our best algorthm yelds an n-approxmaton. Can we get a truthful mechansm that returns an allocaton that s a m-approxmaton? 29 / 39
30 Greedy Mechansm for Sngle-Mnded Bdders INPUT: (S t, v t ) for each bdder OUTPUT: A set of wnners W, payments p j for all 1 j n. Intalzaton: 1. Reorder bds: v t 1 S t 1... v t n S t n 2. W, p = 0 for all Iteraton: 3. For = 1... n do: If S t ( j W S t j Payments: 4. For each W do ) = then W W {} 5. fnd smallest ndex j such that S t S t j and for all k < j, k t holds S t k S t j = 6. f j exsts, set p = vj t S j t / St 30 / 39
31 Example Phone Headset Power Mary John Jack x x x x x x x x x x x x / 39
32 Example Reorderng: S t 1. Mary Phone v t v t / S t 2. Jack Phone, Power John Phone, Headset Algorthm determnes W and p : 1. Mary: W =, so W = {1} 2. Jack: S1 t S2 t = {Phone} 3. John: S1 t S3 t = {Phone} Wnner s Mary Frst bdder blocked by Mary, whch could be n W, s Jack (2) Payments: p 1 = v2/ t S2 t / S 1 t = 65/ 2/1 = / 39
33 Incentve Compatblty Lemma A mechansm for sngle-mnded bdders wth p = 0 whenever W s IC f and only f for every bdder and fxed other bds (S t, v t ) the followng holds: Monotoncty: If bdder wns wth (S t, v t any v > v t and S S t. ), then he remans a wnner for Crtcal Payment: A wnnng bdder pays the mnmum value needed for wnnng the nfmum of all values v such that (S t, v ) stll wns. 33 / 39
34 Greedy s IC Monotoncty: Crtcal Payment: Wnner pays nfmum of all v (S t, v t ) wns, then t wns wth any v > v t and S such that (S t, v S t ) wns. Does Greedy satsfy t? Increasng v t or reducng S t ncreases v t / S t moves up n order and remans wnnng Payment s the swtchng pont between and j: x S t v t j S x v t t Sj t j = S tj v t j S t j / S t 34 / 39
35 Proof of Lemma (f-part) Intal Observatons Truthful bdder has always postve utlty Bdder has (S, v) and bds (S, v ) (S, v) If (S, v ) s a losng bd, reportng (S, v) can only help. If S S, reportng (S, v ) can only help. Assumpton: (S, v ) s wnnng bd and S S. Wnner s never worse off to bd (S, v ): Denote payment p for (S, v ) and p for (S, v ). If (S, x) wth x < p loses, then (monotone) (S, x) loses. Thus, for the crtcal payments p p. (S, v ) causes at most the payments of (S, v ). It can wn n cases, n whch (S, v ) loses. 35 / 39
36 Proof of Lemma (f-part) If bdders reveal ther true sets S, truthful bddng of v follows: Assume (S, v ) wns and (S, v) also Crtcal payment p for (S, v) For v > p same payments, for v < p losng IC Assume (S, v ) wns and (S, v) loses v smaller than crtcal payments, negatve utlty for (S, v ) 36 / 39
37 Approxmaton of Socal Welfare Lemma The greedy mechansm computes a m-approxmaton for the correspondng allocaton problem. Proof: Denote optmal wnner set W, output of greedy W. For each W consder W = {j W, j S t j S t Every j W appears n at least one W, so Clam: j W v t j v t m. }. j W vj t W v t. Then lemma follows wth ntutve accountng argument: Consder value that greedy loses compared to optmum because of addng to W. Ths s at most a factor of m larger than the value he secures by addng to W. 37 / 39
38 Provng the Clam For every j W we have j, and so by the order v t j Summng over all j W t v Sj t S t we get j W v t j v t S t The followng Cauchy-Schwartz nequalty 2 1 Sj t j W j W v t j j W 1 2 v t S t j S t S t j. j W yelds a bound on the last term: S tj W Sj t. j W j W. ) 2 ( S tj 38 / 39
39 Provng the Clam Combnng the last two bounds we have so far: vj t v t W S t Sj t. j W Every S t j ntersects S t for j W. j W W yelds allocaton, so Sj t Sk t = for j, k W Ths means W S t. W s allocaton, so j W S t j m Ths gves and fnshes the proof. j W v t j v t Sj t v t m j W 39 / 39
Module 17: Mechanism Design & Optimal Auctions
Module 7: Mechansm Desgn & Optmal Auctons Informaton Economcs (Ec 55) George Georgads Examples: Auctons Blateral trade Producton and dstrbuton n socety General Setup N agents Each agent has prvate nformaton
More informationVickrey Auction. Mechanism Design. Algorithmic Game Theory. Alexander Skopalik Algorithmic Game Theory 2013 Mechanism Design
Algorithmic Game Theory Vickrey Auction Vickrey-Clarke-Groves Mechanisms Mechanisms with Money Player preferences are quantifiable. Common currency enables utility transfer between players. Preference
More informationGame Theory Course: Jackson, Leyton-Brown & Shoham. Vickrey-Clarke-Groves Mechanisms: Definitions
Vckrey-Clarke-Groves Mechansms: Defntons Game Theory Course: Jackson, Leyton-Brown & Shoham A postve result Recall that n the quaslnear utlty settng, a drect mechansm conssts of a choce rule and a payment
More informationPricing Network Services by Jun Shu, Pravin Varaiya
Prcng Network Servces by Jun Shu, Pravn Varaya Presented by Hayden So September 25, 2003 Introducton: Two Network Problems Engneerng: A game theoretcal sound congeston control mechansm that s ncentve compatble
More informationVickrey Auction VCG Characterization. Mechanism Design. Algorithmic Game Theory. Alexander Skopalik Algorithmic Game Theory 2013 Mechanism Design
Algorithmic Game Theory Vickrey Auction Vickrey-Clarke-Groves Mechanisms Characterization of IC Mechanisms Mechanisms with Money Player preferences are quantifiable. Common currency enables utility transfer
More informationProblem Set 9 Solutions
Desgn and Analyss of Algorthms May 4, 2015 Massachusetts Insttute of Technology 6.046J/18.410J Profs. Erk Demane, Srn Devadas, and Nancy Lynch Problem Set 9 Solutons Problem Set 9 Solutons Ths problem
More informationMicroeconomics: Auctions
Mcroeconomcs: Auctons Frédérc Robert-coud ovember 8, Abstract We rst characterze the PBE n a smple rst prce and second prce sealed bd aucton wth prvate values. The key result s that the expected revenue
More informationAbstract Single Crossing and the Value Dimension
Abstract Sngle Crossng and the Value Dmenson Davd Rahman September 24, 2007 Abstract When auctonng an ndvsble good wthout consumpton externaltes, abstract sngle crossng s necessary and suffcent to mplement
More informationCS286r Assign One. Answer Key
CS286r Assgn One Answer Key 1 Game theory 1.1 1.1.1 Let off-equlbrum strateges also be that people contnue to play n Nash equlbrum. Devatng from any Nash equlbrum s a weakly domnated strategy. That s,
More informationAlgorithmic Game Theory. Edited by Noam Nisan, Tim Roughgarden, Éva Tardos, and Vijay Vazirani
Algorthmc Game Theory Edted by Noam Nsan, Tm Roughgarden, Éva Tardos, and Vjay Vazran Contents 1 Computatonally-Effcent Approxmaton Mechansms R. Lav page 4 3 1 Computatonally-Effcent Approxmaton Mechansms
More informationPerfect Competition and the Nash Bargaining Solution
Perfect Competton and the Nash Barganng Soluton Renhard John Department of Economcs Unversty of Bonn Adenauerallee 24-42 53113 Bonn, Germany emal: rohn@un-bonn.de May 2005 Abstract For a lnear exchange
More informationarxiv: v1 [cs.gt] 18 Nov 2015
The Invsble Hand of Dynamc Market Prcng arxv:1511.05646v1 [cs.gt] 18 Nov 2015 Vncent Cohen-Addad vcohen@d.ens.fr Alon Eden alonarden@gmal.com Amos Fat fat@tau.ac.l November 19, 2015 Abstract Mchal Feldman
More informationEconomics 101. Lecture 4 - Equilibrium and Efficiency
Economcs 0 Lecture 4 - Equlbrum and Effcency Intro As dscussed n the prevous lecture, we wll now move from an envronment where we looed at consumers mang decsons n solaton to analyzng economes full of
More informationSmooth Games, Price of Anarchy and Composability of Auctions - a Quick Tutorial
Smooth Games, Prce of Anarchy and Composablty of Auctons - a Quck Tutoral Abhshek Snha Laboratory for Informaton and Decson Systems, Massachusetts Insttute of Technology, Cambrdge, MA 02139 Emal: snhaa@mt.edu
More informationCollege of Computer & Information Science Fall 2009 Northeastern University 20 October 2009
College of Computer & Informaton Scence Fall 2009 Northeastern Unversty 20 October 2009 CS7880: Algorthmc Power Tools Scrbe: Jan Wen and Laura Poplawsk Lecture Outlne: Prmal-dual schema Network Desgn:
More informationCalculation of time complexity (3%)
Problem 1. (30%) Calculaton of tme complexty (3%) Gven n ctes, usng exhaust search to see every result takes O(n!). Calculaton of tme needed to solve the problem (2%) 40 ctes:40! dfferent tours 40 add
More informationHila Etzion. Min-Seok Pang
RESERCH RTICLE COPLEENTRY ONLINE SERVICES IN COPETITIVE RKETS: INTINING PROFITILITY IN THE PRESENCE OF NETWORK EFFECTS Hla Etzon Department of Technology and Operatons, Stephen. Ross School of usness,
More informationIncentive Compatible Market Design with an Application to. Matching with Wages
Incentve Compatble Market Desgn wth an Applcaton to Matchng wth Wages M. Bumn Yenmez Stanford Graduate School of Busness Job Market Paper November 1, 2009 Abstract: Ths paper studes markets for heterogeneous
More informationWelfare Properties of General Equilibrium. What can be said about optimality properties of resource allocation implied by general equilibrium?
APPLIED WELFARE ECONOMICS AND POLICY ANALYSIS Welfare Propertes of General Equlbrum What can be sad about optmalty propertes of resource allocaton mpled by general equlbrum? Any crteron used to compare
More informationAn Introduction to Mechanism Design
An Introducton to Mechansm Desgn Felx Munoz-Garca School of Economc Scences Washngton State Unversty 1 1 Introducton In ths chapter, we consder stuatons n whch some central authorty wshes to mplement a
More information2E Pattern Recognition Solutions to Introduction to Pattern Recognition, Chapter 2: Bayesian pattern classification
E395 - Pattern Recognton Solutons to Introducton to Pattern Recognton, Chapter : Bayesan pattern classfcaton Preface Ths document s a soluton manual for selected exercses from Introducton to Pattern Recognton
More information(1 ) (1 ) 0 (1 ) (1 ) 0
Appendx A Appendx A contans proofs for resubmsson "Contractng Informaton Securty n the Presence of Double oral Hazard" Proof of Lemma 1: Assume that, to the contrary, BS efforts are achevable under a blateral
More informationComputationally Efficient Approximation Mechanisms
CHAPTER 12 Computatonally Effcent Approxmaton Mechansms Ron Lav Abstract We study the ntegraton of game theoretc and computatonal consderatons. In partcular, we study the desgn of computatonally effcent
More informationprinceton univ. F 17 cos 521: Advanced Algorithm Design Lecture 7: LP Duality Lecturer: Matt Weinberg
prnceton unv. F 17 cos 521: Advanced Algorthm Desgn Lecture 7: LP Dualty Lecturer: Matt Wenberg Scrbe: LP Dualty s an extremely useful tool for analyzng structural propertes of lnear programs. Whle there
More informationSponsored Search Equilibria for Conservative Bidders
Sponsored Search Equlbra for Conservatve Bdders Renato Paes Leme Department of Computer Scence Cornell Unversty Ithaca, NY renatoppl@cs.cornell.edu Éva Tardos Department of Computer Scence Cornell Unversty
More informationThe Second Anti-Mathima on Game Theory
The Second Ant-Mathma on Game Theory Ath. Kehagas December 1 2006 1 Introducton In ths note we wll examne the noton of game equlbrum for three types of games 1. 2-player 2-acton zero-sum games 2. 2-player
More informationAssortment Optimization under MNL
Assortment Optmzaton under MNL Haotan Song Aprl 30, 2017 1 Introducton The assortment optmzaton problem ams to fnd the revenue-maxmzng assortment of products to offer when the prces of products are fxed.
More informationEdge Isoperimetric Inequalities
November 7, 2005 Ross M. Rchardson Edge Isopermetrc Inequaltes 1 Four Questons Recall that n the last lecture we looked at the problem of sopermetrc nequaltes n the hypercube, Q n. Our noton of boundary
More informationEFFICIENT DYNAMIC AUCTIONS. Dirk Bergemann and Juuso Välimäki. October 2006 COWLES FOUNDATION DISCUSSION PAPER NO. 1584
EFFICIENT DYNAMIC AUCTIONS By Drk Bergemann and Juuso Välmäk October 2006 COWLES FOUNDATION DISCUSSION PAPER NO. 1584 COWLES FOUNDATION FOR RESEARCH IN ECONOMICS YALE UNIVERSITY Box 208281 New Haven, Connectcut
More informationChapter Newton s Method
Chapter 9. Newton s Method After readng ths chapter, you should be able to:. Understand how Newton s method s dfferent from the Golden Secton Search method. Understand how Newton s method works 3. Solve
More informationSolutions HW #2. minimize. Ax = b. Give the dual problem, and make the implicit equality constraints explicit. Solution.
Solutons HW #2 Dual of general LP. Fnd the dual functon of the LP mnmze subject to c T x Gx h Ax = b. Gve the dual problem, and make the mplct equalty constrants explct. Soluton. 1. The Lagrangan s L(x,
More informationREAL ANALYSIS I HOMEWORK 1
REAL ANALYSIS I HOMEWORK CİHAN BAHRAN The questons are from Tao s text. Exercse 0.0.. If (x α ) α A s a collecton of numbers x α [0, + ] such that x α
More informationDynamic Efcient Auctions
Dynamc fcent Auctons Drk Bergemann y and Juuso Valmak z ABSTRACT (xtended Abstract) We consder the truthful mplementaton of the socally e cent allocaton n a dynamc prvate value envronment n whch agents
More informationOptimal Dynamic Mechanism Design and the Virtual Pivot Mechanism
Optmal Dynamc Mechansm Desgn and the Vrtual Pvot Mechansm Sham M. Kakade Ilan Lobel Hamd Nazerzadeh March 25, 2011 Abstract We consder the problem of desgnng optmal mechansms for settngs where agents have
More informationSocial Decision with Minimal Efficiency Loss: an Automated Mechanism Design Approach
Socal Decson wth Mnmal Effcency Loss: an Automated Mechansm Desgn Approach ABSTRACT Mngyu Guo, Hong Shen School of Computer Scence Unversty of Adelade, Australa {mngyu.guo, hong.shen} @adelade.edu.au We
More informationCHAPTER 17 Amortized Analysis
CHAPTER 7 Amortzed Analyss In an amortzed analyss, the tme requred to perform a sequence of data structure operatons s averaged over all the operatons performed. It can be used to show that the average
More informationNotes on Frequency Estimation in Data Streams
Notes on Frequency Estmaton n Data Streams In (one of) the data streamng model(s), the data s a sequence of arrvals a 1, a 2,..., a m of the form a j = (, v) where s the dentty of the tem and belongs to
More informationA Generalized Vickrey Auction
A Generalzed Vckrey Aucton Lawrence M. Ausubel* Unversty of Maryland September 1999 Abstract In aucton envronments where bdders have pure prvate values, the Vckrey aucton (Vckrey, 1961) provdes a smple
More informationA Equilibria of Greedy Combinatorial Auctions
A Equlbra of Greedy Combnatoral Auctons BRENDAN LUCIER, Mcrosoft Research ALLAN BORODIN, Unversty of Toronto We consder auctons n whch greedy algorthms, pared wth frst-prce or crtcal-prce payment rules,
More informationEfficiency of (Revenue-)Optimal Mechanisms
Effcency of Revenue-Optmal Mechansms Gagan Aggarwal Google Inc. Mountan Vew, CA gagana@google.com Gagan Goel Georga Tech Atlanta, GA gagan@gatech.edu Aranyak Mehta Google Inc. Mountan Vew, CA aranyak@google.com
More informationAccuracy for Sale: Aggregating Data with a Variance Constraint
Accuracy for Sale: Aggregatng Data wth a Varance Constrant Rachel Cummngs Katrna Lgett Aaron Roth Zhwe Steven Wu Juba Zan August 8, 204 Abstract We consder the problem of a data analyst who may purchase
More informationPricing and Resource Allocation Game Theoretic Models
Prcng and Resource Allocaton Game Theoretc Models Zhy Huang Changbn Lu Q Zhang Computer and Informaton Scence December 8, 2009 Z. Huang, C. Lu, and Q. Zhang (CIS) Game Theoretc Models December 8, 2009
More informationMore metrics on cartesian products
More metrcs on cartesan products If (X, d ) are metrc spaces for 1 n, then n Secton II4 of the lecture notes we defned three metrcs on X whose underlyng topologes are the product topology The purpose of
More informationDISCRIMINATION VIA SYMMETRIC AUCTIONS: ONLINE APPENDIX
DISCRIMINATION VIA SYMMETRIC AUCTIONS: ONLINE APPENDIX RAHUL DEB AND MALLESH M. PAI. IMPLEMENTATION USING RANDOMIZATION In ths secton, we demonstrate that f the mplementaton crteron s weakened, the prncpal
More informationWeak Monotonicity and Bayes-Nash Incentive Compatibility
Weak Monotoncty and Bayes-Nash Incente Compatblty Rudolf Müller, Andrés Perea, Sascha Wolf Abstract An allocaton rule s called Bayes-Nash ncente compatble, f there exsts a payment rule, such that truthful
More informationECE559VV Project Report
ECE559VV Project Report (Supplementary Notes Loc Xuan Bu I. MAX SUM-RATE SCHEDULING: THE UPLINK CASE We have seen (n the presentaton that, for downlnk (broadcast channels, the strategy maxmzng the sum-rate
More informationImplementation and Detection
1 December 18 2014 Implementaton and Detecton Htosh Matsushma Department of Economcs Unversty of Tokyo 2 Ths paper consders mplementaton of scf: Mechansm Desgn wth Unqueness CP attempts to mplement scf
More informationJournal of Computer and System Sciences
Journal of Computer and System Scences 78 (0) 4 Contents lsts avalable at ScenceDrect Journal of Computer and System Scences www.elsever.com/locate/jcss Computng optmal outcomes under an expressve representaton
More informationU.C. Berkeley CS294: Spectral Methods and Expanders Handout 8 Luca Trevisan February 17, 2016
U.C. Berkeley CS94: Spectral Methods and Expanders Handout 8 Luca Trevsan February 7, 06 Lecture 8: Spectral Algorthms Wrap-up In whch we talk about even more generalzatons of Cheeger s nequaltes, and
More informationOptimal auctions with ambiguity
Theoretcal Economcs 1 (2006), 411 438 1555-7561/20060411 Optmal auctons wth ambguty SUBIR BOSE Department of Economcs, Unversty of Illnos at Urbana-Champagn EMRE OZDENOREN Department of Economcs, Unversty
More informationU.C. Berkeley CS294: Beyond Worst-Case Analysis Luca Trevisan September 5, 2017
U.C. Berkeley CS94: Beyond Worst-Case Analyss Handout 4s Luca Trevsan September 5, 07 Summary of Lecture 4 In whch we ntroduce semdefnte programmng and apply t to Max Cut. Semdefnte Programmng Recall that
More informationEndogenous timing in a mixed oligopoly consisting of a single public firm and foreign competitors. Abstract
Endogenous tmng n a mxed olgopoly consstng o a sngle publc rm and oregn compettors Yuanzhu Lu Chna Economcs and Management Academy, Central Unversty o Fnance and Economcs Abstract We nvestgate endogenous
More informationStanford University CS359G: Graph Partitioning and Expanders Handout 4 Luca Trevisan January 13, 2011
Stanford Unversty CS359G: Graph Parttonng and Expanders Handout 4 Luca Trevsan January 3, 0 Lecture 4 In whch we prove the dffcult drecton of Cheeger s nequalty. As n the past lectures, consder an undrected
More informationTAHES: Truthful Double Auction for Heterogeneous Spectrums
The 31st Annual IEEE Internatonal Conference on Computer Communcatons: Mn-Conference TAHES: Truthful Double Aucton for Heterogeneous Spectrums Xaojun Feng, Yanjao Chen, Jn Zhang, Qan Zhang, and Bo L Department
More informationA Duality Based Unified Approach to Bayesian Mechanism Design
A Dualty Based Unfed Approach to Bayesan Mechansm Desgn Yang Ca McGll Unversty, Canada ca@cs.mcgll.ca Nkhl R. Devanur Mcrosoft Resarch, USA nkdev@mcrosoft.com S. Matthew Wenberg Prnceton Unversty, USA
More informationLecture 4: November 17, Part 1 Single Buffer Management
Lecturer: Ad Rosén Algorthms for the anagement of Networs Fall 2003-2004 Lecture 4: November 7, 2003 Scrbe: Guy Grebla Part Sngle Buffer anagement In the prevous lecture we taled about the Combned Input
More informationAn Ascending Vickrey Auction for Selling Bases of a Matroid
An Ascendng Vckrey Aucton for Sellng Bases of a Matrod Sushl Bkhchandan Sven de Vres James Schummer Rakesh V. Vohra July 27, 2010 Abstract Consder sellng bundles of ndvsble goods to buyers wth concave
More informationNP-Completeness : Proofs
NP-Completeness : Proofs Proof Methods A method to show a decson problem Π NP-complete s as follows. (1) Show Π NP. (2) Choose an NP-complete problem Π. (3) Show Π Π. A method to show an optmzaton problem
More informationVickrey Auctions with Reserve Pricing
Vckrey Auctons wth Reserve Prcng Lawrence M. Ausubel and Peter Cramton Unversty of Maryland 28 June 1999 Prelmnary and Incomplete Abstract We generalze the Vckrey aucton to allow for reserve prcng n a
More informationEx post implementation in environments with private goods
Theoretcal Economcs 1 (2006), 369 393 1555-7561/20060369 Ex post mplementaton n envronments wth prvate goods SUSHIL BIKHCHANDANI Anderson School of Management, Unversty of Calforna, Los Angeles We prove
More informationProblem Set 2 Solutions
FDPE Mcroeconomcs 4: Informaton Economcs Sprng 07 Juuso Välmäk TA: Chrstan Krestel Problem Set Solutons Problem Prove the followng clam: Let g,h : [0, ) R be contnuous and dfferentable such that ) g (0)
More informationCopyright (C) 2008 David K. Levine This document is an open textbook; you can redistribute it and/or modify it under the terms of the Creative
Copyrght (C) 008 Davd K. Levne Ths document s an open textbook; you can redstrbute t and/or modfy t under the terms of the Creatve Commons Attrbuton Lcense. Compettve Equlbrum wth Pure Exchange n traders
More informationWinter 2008 CS567 Stochastic Linear/Integer Programming Guest Lecturer: Xu, Huan
Wnter 2008 CS567 Stochastc Lnear/Integer Programmng Guest Lecturer: Xu, Huan Class 2: More Modelng Examples 1 Capacty Expanson Capacty expanson models optmal choces of the tmng and levels of nvestments
More informationRobustly Optimal Auctions with Unknown Resale Opportunities
Robustly Optmal Auctons wth Unknown Resale Opportuntes Gabrel Carroll Ilya Segal Department of Economcs, Stanford Unversty, Stanford, CA 94305 August 22, 2016 Abstract We study robust revenue maxmzaton
More informationErrors for Linear Systems
Errors for Lnear Systems When we solve a lnear system Ax b we often do not know A and b exactly, but have only approxmatons  and ˆb avalable. Then the best thng we can do s to solve ˆx ˆb exactly whch
More informationCharacterizing Truthful Multi-Armed Bandit Mechanisms
Characterzng Truthful Mult-Armed Bandt Mechansms [Extended Abstract] Moshe Babaoff Mcrosoft Research Mountan Vew, CA 94043 moshe@mcrosoft.com Yogeshwer Sharma Cornell Unversty Ithaca, NY 14853 yog@cs.cornell.edu
More informationIncremental Mechanism Design
Incremental Mechansm Desgn Vncent Contzer Duke Unversty Department of Computer Scence contzer@cs.duke.edu Abstract Mechansm desgn has tradtonally focused almost exclusvely on the desgn of truthful mechansms.
More informationCS : Algorithms and Uncertainty Lecture 17 Date: October 26, 2016
CS 29-128: Algorthms and Uncertanty Lecture 17 Date: October 26, 2016 Instructor: Nkhl Bansal Scrbe: Mchael Denns 1 Introducton In ths lecture we wll be lookng nto the secretary problem, and an nterestng
More informationA Lower Bound on the Competitive Ratio of Truthful Auctions
A Lower Bound on the Compettve Rato of Truthful Auctons Andrew V Goldberg 1, Jason D Hartlne 1, Anna R Karln 2, and Mchael Saks 3 1 Mcrosoft Research, SVC/5, 1065 La Avenda, Mountan Vew, CA 94043 {goldberg,hartlne}@mcrosoftcom
More informationOn Random Sampling Auctions for Digital Goods
On Random Samplng Auctons for Dgtal Goods Saeed Alae Department of Computer Scence Unversty of Maryland College Park, MD 07 alae@cs.umd.edu Azarakhsh Malekan Department of Computer Scence Unversty of Maryland
More informationLecture 14: Bandits with Budget Constraints
IEOR 8100-001: Learnng and Optmzaton for Sequental Decson Makng 03/07/16 Lecture 14: andts wth udget Constrants Instructor: Shpra Agrawal Scrbed by: Zhpeng Lu 1 Problem defnton In the regular Mult-armed
More informationTruthful Spectrum Auction Design for Secondary Networks
Truthful Spectrum Aucton Desgn for Secondary Networks Yuefe Zhu, Baochun L Department of Electrcal and Computer Engneerng Unversty of Toronto Zongpeng L Department of Computer Scence Unversty of Calgary
More informationCS294 Topics in Algorithmic Game Theory October 11, Lecture 7
CS294 Topcs n Algorthmc Game Theory October 11, 2011 Lecture 7 Lecturer: Chrstos Papadmtrou Scrbe: Wald Krchene, Vjay Kamble 1 Exchange economy We consder an exchange market wth m agents and n goods. Agent
More informationCOS 521: Advanced Algorithms Game Theory and Linear Programming
COS 521: Advanced Algorthms Game Theory and Lnear Programmng Moses Charkar February 27, 2013 In these notes, we ntroduce some basc concepts n game theory and lnear programmng (LP). We show a connecton
More informationWelfare Maximization and the Supermodular Degree
Welfare Maxmzaton and the Supermodular Degree Urel Fege Wezmann Insttute of Scence urel.fege@wezmann.ac.l Ran Izsak Wezmann Insttute of Scence ran.zsak@wezmann.ac.l May 29, 2013 Abstract Gven a set of
More informationIncentive Compatible Transfers in Linear Environments
Incentve Compatble Transfers n Lnear Envronments Nenad Kos Dept. of Economcs, IGIER Boccon Unversty Matthas Messner Dept. of Economcs, IGIER Boccon Unversty August 5, 2010 Abstract We study the mechansm
More informationSYMMETRIC AUCTIONS RAHUL DEB AND MALLESH M. PAI
SYMMETRIC AUCTIONS RAHUL DEB AND MALLESH M. PAI ABSTRACT. Symmetrc (sealed bd) auctons such as frst, second, and all-pay auctons are commonly used n practce. One reason for ther popularty s that the rules
More informationBayesian Incentive Compatibility via Fractional Assignments
Bayesan Incentve Compatblty va Fractonal Assgnments Xaohu Be Zhy Huang Abstract Very recently, Hartlne and Lucer [14] studed sngleparameter mechansm desgn problems n the Bayesan settng. They proposed a
More informationThe Gaussian classifier. Nuno Vasconcelos ECE Department, UCSD
he Gaussan classfer Nuno Vasconcelos ECE Department, UCSD Bayesan decson theory recall that we have state of the world X observatons g decson functon L[g,y] loss of predctng y wth g Bayes decson rule s
More informationAPPROXIMATE PRICES OF BASKET AND ASIAN OPTIONS DUPONT OLIVIER. Premia 14
APPROXIMAE PRICES OF BASKE AND ASIAN OPIONS DUPON OLIVIER Prema 14 Contents Introducton 1 1. Framewor 1 1.1. Baset optons 1.. Asan optons. Computng the prce 3. Lower bound 3.1. Closed formula for the prce
More informationMixed Taxation and Production Efficiency
Floran Scheuer 2/23/2016 Mxed Taxaton and Producton Effcency 1 Overvew 1. Unform commodty taxaton under non-lnear ncome taxaton Atknson-Stgltz (JPubE 1976) Theorem Applcaton to captal taxaton 2. Unform
More informationA 2D Bounded Linear Program (H,c) 2D Linear Programming
A 2D Bounded Lnear Program (H,c) h 3 v h 8 h 5 c h 4 h h 6 h 7 h 2 2D Lnear Programmng C s a polygonal regon, the ntersecton of n halfplanes. (H, c) s nfeasble, as C s empty. Feasble regon C s unbounded
More informationCSCE 790S Background Results
CSCE 790S Background Results Stephen A. Fenner September 8, 011 Abstract These results are background to the course CSCE 790S/CSCE 790B, Quantum Computaton and Informaton (Sprng 007 and Fall 011). Each
More informationMechanism Design for Fair Division
Mechansm Desgn for Far Dvson Rchard Cole New York Unversty cole@cms.nyu.edu Vasls Gkatzels New York Unversty gkatz@cms.nyu.edu Gagan Goel Google Research gagangoel@google.com Abstract We revst the classc
More informationGenericity of Critical Types
Genercty of Crtcal Types Y-Chun Chen Alfredo D Tllo Eduardo Fangold Syang Xong September 2008 Abstract Ely and Pesk 2008 offers an nsghtful characterzaton of crtcal types: a type s crtcal f and only f
More informationON THE EQUIVALENCE OF ORDINAL BAYESIAN INCENTIVE COMPATIBILITY AND DOMINANT STRATEGY INCENTIVE COMPATIBILITY FOR RANDOM RULES
ON THE EQUIVALENCE OF ORDINAL BAYESIAN INCENTIVE COMPATIBILITY AND DOMINANT STRATEGY INCENTIVE COMPATIBILITY FOR RANDOM RULES Madhuparna Karmokar 1 and Souvk Roy 1 1 Economc Research Unt, Indan Statstcal
More informationWhich Separator? Spring 1
Whch Separator? 6.034 - Sprng 1 Whch Separator? Mamze the margn to closest ponts 6.034 - Sprng Whch Separator? Mamze the margn to closest ponts 6.034 - Sprng 3 Margn of a pont " # y (w $ + b) proportonal
More informationMaximizing the number of nonnegative subsets
Maxmzng the number of nonnegatve subsets Noga Alon Hao Huang December 1, 213 Abstract Gven a set of n real numbers, f the sum of elements of every subset of sze larger than k s negatve, what s the maxmum
More informationLecture 10 Support Vector Machines II
Lecture 10 Support Vector Machnes II 22 February 2016 Taylor B. Arnold Yale Statstcs STAT 365/665 1/28 Notes: Problem 3 s posted and due ths upcomng Frday There was an early bug n the fake-test data; fxed
More informationOnline Appendix. t=1 (p t w)q t. Then the first order condition shows that
Artcle forthcomng to ; manuscrpt no (Please, provde the manuscrpt number!) 1 Onlne Appendx Appendx E: Proofs Proof of Proposton 1 Frst we derve the equlbrum when the manufacturer does not vertcally ntegrate
More informationAnnexes. EC.1. Cycle-base move illustration. EC.2. Problem Instances
ec Annexes Ths Annex frst llustrates a cycle-based move n the dynamc-block generaton tabu search. It then dsplays the characterstcs of the nstance sets, followed by detaled results of the parametercalbraton
More informationRandomness and Computation
Randomness and Computaton or, Randomzed Algorthms Mary Cryan School of Informatcs Unversty of Ednburgh RC 208/9) Lecture 0 slde Balls n Bns m balls, n bns, and balls thrown unformly at random nto bns usually
More informationAuctions with endogenous supply
Auctons wth endogenous supply Serge Izmalkov, Dlyara Khakmova, Gleb Romanyuk Abstract We consder a mult-object prvate values settng wth quantty externaltes: a value to a bdder from an object may depend
More informationCS 331 DESIGN AND ANALYSIS OF ALGORITHMS DYNAMIC PROGRAMMING. Dr. Daisy Tang
CS DESIGN ND NLYSIS OF LGORITHMS DYNMIC PROGRMMING Dr. Dasy Tang Dynamc Programmng Idea: Problems can be dvded nto stages Soluton s a sequence o decsons and the decson at the current stage s based on the
More informationLecture 2: Gram-Schmidt Vectors and the LLL Algorithm
NYU, Fall 2016 Lattces Mn Course Lecture 2: Gram-Schmdt Vectors and the LLL Algorthm Lecturer: Noah Stephens-Davdowtz 2.1 The Shortest Vector Problem In our last lecture, we consdered short solutons to
More informationLecture Randomized Load Balancing strategies and their analysis. Probability concepts include, counting, the union bound, and Chernoff bounds.
U.C. Berkeley CS273: Parallel and Dstrbuted Theory Lecture 1 Professor Satsh Rao August 26, 2010 Lecturer: Satsh Rao Last revsed September 2, 2010 Lecture 1 1 Course Outlne We wll cover a samplng of the
More informationApproximate Smallest Enclosing Balls
Chapter 5 Approxmate Smallest Enclosng Balls 5. Boundng Volumes A boundng volume for a set S R d s a superset of S wth a smple shape, for example a box, a ball, or an ellpsod. Fgure 5.: Boundng boxes Q(P
More informationNon-bossy Single Object Auctions
Non-bossy Sngle Object Auctons Debass Mshra and Abdul Quadr January 3, 2014 Abstract We study determnstc sngle object auctons n the prvate values envronment. We show that an allocaton rule s mplementable
More informationSelling Multiple Items via Social Networks
ellng Multple tems va ocal Networks engj Zhao, Bn L, Junpng Xu, ong Hao, and Ncholas R. Jennngs hanghatech Unversty, hangha, hna {zhaodj,xujp}@shanghatech.edu.cn Unversty of Electronc cence and Technology
More informationOutline and Reading. Dynamic Programming. Dynamic Programming revealed. Computing Fibonacci. The General Dynamic Programming Technique
Outlne and Readng Dynamc Programmng The General Technque ( 5.3.2) -1 Knapsac Problem ( 5.3.3) Matrx Chan-Product ( 5.3.1) Dynamc Programmng verson 1.4 1 Dynamc Programmng verson 1.4 2 Dynamc Programmng
More information