A Revealed-Preference Activity Rule for Quasi-Linear Utilities with Budget Constraints Robert Day, University of Connecticut with special thanks to: Pavithra.

Slides:



Advertisements
Similar presentations
Combinatorial Auction
Advertisements

An Efficient Dynamic Auction for Heterogeneous Commodities (Lawrence M.Ausubel - september 2000) Authors: Oren Rigbi Damian Goren.
6.853: Topics in Algorithmic Game Theory Fall 2011 Constantinos Daskalakis Lecture 16.
CPSC 455/555 Combinatorial Auctions, Continued… Shaili Jain September 29, 2011.
Approximating optimal combinatorial auctions for complements using restricted welfare maximization Pingzhong Tang and Tuomas Sandholm Computer Science.
USING LOTTERIES TO APPROXIMATE THE OPTIMAL REVENUE Paul W. GoldbergUniversity of Liverpool Carmine VentreTeesside University.
Combinatorial auctions Vincent Conitzer v( ) = $500 v( ) = $700.
Practical Public Sector Combinatorial Auctions S. RaghavanUniversity of Maryland (joint work with Robert Day, University of Connecticut) Full paper “Fair.
Multi-item auctions with identical items limited supply: M items (M smaller than number of bidders, n). Three possible bidder types: –Unit-demand bidders.
Game Theory in Wireless and Communication Networks: Theory, Models, and Applications Lecture 6 Auction Theory Zhu Han, Dusit Niyato, Walid Saad, Tamer.
The Clock-Proxy Auction: A Practical Combinatorial Auction Design Lawrence M. Ausubel, Peter Cramton, Paul Milgrom University of Maryland and Stanford.
A Sufficient Condition for Truthfulness with Single Parameter Agents Michael Zuckerman, Hebrew University 2006 Based on paper by Nir Andelman and Yishay.
Seminar In Game Theory Algorithms, TAU, Agenda  Introduction  Computational Complexity  Incentive Compatible Mechanism  LP Relaxation & Walrasian.
1 Sealed Bid Multi-object Auctions with Necessary Bundles and its Application to Spectrum Auctions ver. 1.0 University of Tokyo 東京大学 松井知己 Tomomi Matsui.
1 Competitive equilibrium in an Exchange Economy with Indivisibilities. By:Sushil Bikhchandani and John W.Mamer University of California. presented by:
1 Bidding and Matching Procedures Professor Paul Milgrom Stanford and MIT March 19, 2002 *Some of the procedures described herein are subject to issued.
Bundling Equilibrium in Combinatorial Auctions Written by: Presented by: Ron Holzman Rica Gonen Noa Kfir-Dahav Dov Monderer Moshe Tennenholtz.
6.896: Topics in Algorithmic Game Theory Lecture 15 Constantinos Daskalakis.
Clock Auctions, Proxy Auctions, and Possible Hybrids Lawrence M. Ausubel* University of Maryland November 2003 *This is joint research with Peter Cramton.
Ascending Combinatorial Auctions = a restricted form of preference elicitation in CAs Tuomas Sandholm.
Ron Lavi Presented by Yoni Moses.  Introduction ◦ Combining computational efficiency with game theoretic needs  Monotonicity Conditions ◦ Cyclic Monotonicity.
1 Multiunit Auctions Part II Thanks to Larry Ausubel and especially to Peter Cramton for sharing their notes.
1 An Analysis for Troubled Assets Reverse Auction Saeed Alaei (University of Maryland-College Park) Azarakhsh Malekian (University of Maryland-College.
Combinatorial Auction. Conbinatorial auction t 1 =20 t 2 =15 t 3 =6 f(t): the set X  F with the highest total value the mechanism decides the set of.
Chapter Seven Revealed Preference. Revealed Preference Analysis u Suppose we observe the demands (consumption choices) that a consumer makes for different.
1 Iterative Combinatorial Auctions: Theory and Practice By David C.Parkes and Lyle H.Ungar Represented by Igal Kaplan.
Topics in the border of economics and computation seminar Presented by: Avinatan Hasidim Yair Weinberger Gabrielle Demange, David gale, Matilda Sotomayor.
Arbitrage in Combinatorial Exchanges Andrew Gilpin and Tuomas Sandholm Carnegie Mellon University Computer Science Department.
Strategic Demand Reduction in homogenous multiunit auctions (where bidders may be interested in more than one unit)
Systems of Two Equations in Two Unknowns In order to explain what we mean by a system of equations, we consider the following: Problem. A pile of 9 coins.
Consumption, Production, Welfare B: Consumer Behaviour Univ. Prof. dr. Maarten Janssen University of Vienna Winter semester 2013.
Multi-Unit Auctions with Budget Limits Shahar Dobzinski, Ron Lavi, and Noam Nisan.
Sequences of Take-It-or-Leave-it Offers: Near-Optimal Auctions Without Full Valuation Revelation Tuomas Sandholm and Andrew Gilpin Carnegie Mellon University.
Chapter 5 Choice.
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.
1 Ascending Auctions with Package Bidding By Larry Ausubel and Paul Milgrom October 27, 2001 This presentation reports research results. Some of the methods.
Mechanism Design CS 886 Electronic Market Design University of Waterloo.
1 Deterministic Auctions and (In)Competitiveness Proof sketch: Show that for any 1  m  n there exists a bid vector b such that Theorem: Let A f be any.
Auction Theory תכנון מכרזים ומכירות פומביות Topic 7 – VCG mechanisms 1.
Auctions Resource Bundling and Allocation Charles Snyder.
Auction Theory Class 9 – Multi-unit auctions: part 2 1.
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.
What is the best plan? Peter Cramton (with Larry Ausubel and Paul Milgrom) November 2003.
Auction Process & FCC Auction System Auction 86 Broadband Radio Service Debbie Smith Auctions and Spectrum Access Division August 5, 2009.
Approximating Market Equilibria Kamal Jain, Microsoft Research Mohammad Mahdian, MIT Amin Saberi, Georgia Tech.
Spectrum Auction Process and Integrated Spectrum Auction System Auctions 73 and MHz Band Craig Bomberger Auctions and Spectrum Access Division November.
12. Consumer Theory Econ 494 Spring 2013.
Auctions serve the dual purpose of eliciting preferences and allocating resources between competing uses. A less fundamental but more practical reason.
Chapter Seven Revealed Preference 1. Revealed Preference Analysis u Suppose we observe the demands (consumption choices) that a consumer makes for different.
6.853: Topics in Algorithmic Game Theory Fall 2011 Constantinos Daskalakis Lecture 22.
Chapter 8 Maximum Flows: Additional Topics All-Pairs Minimum Value Cut Problem  Given an undirected network G, find minimum value cut for all.
Combinatorial Auction. A single item auction t 1 =10 t 2 =12 t 3 =7 r 1 =11 r 2 =10 Social-choice function: the winner should be the guy having in mind.
Overview of Auction Process & Integrated Spectrum Auction System (ISAS) Automated Maritime Telecommunications System (AMTS) Auction No. 61 Roy Knowles.
Spectrum Auction Process and Integrated Spectrum Auction System Auction No MHz Air-Ground Radiotelephone Service Jeff Crooks, Auctions Analyst.
© 2010 W. W. Norton & Company, Inc. 7 Revealed Preference.
Approximation Algorithms based on linear programming.
Advanced Subjects in GT Prepared by Rina Talisman Introduction Revenue Equivalence The Optimal Auction (Myerson 1981) Auctions.
Course: Microeconomics Text: Varian’s Intermediate Microeconomics
مهندسي سيستم‌هاي تجارت الکترونیکی Electronic Commerce System Engineering (ECSE) رشته مهندسي فناوري اطلاعات- گرايش تجارت الکترونیکی دوره کارشناسی ارشد حضوری.
Comp/Math 553: Algorithmic Game Theory Lecture 10
False-name Bids “The effect of false-name bids in combinatorial
Generalized Agent-mediated procurement auctions
Comp/Math 553: Algorithmic Game Theory Lecture 09
Choice.
Internet Economics כלכלת האינטרנט
Game Theory in Wireless and Communication Networks: Theory, Models, and Applications Lecture 6 Auction Theory Zhu Han, Dusit Niyato, Walid Saad, Tamer.
Market Design and the Evolution of the Combinatorial ClockAuction
Choice.
Chapter 7 Revealed Preference.
Economic Rationality The principal behavioral postulate is that a decisionmaker chooses its most preferred alternative from those available to it. The.
Presentation transcript:

A Revealed-Preference Activity Rule for Quasi-Linear Utilities with Budget Constraints Robert Day, University of Connecticut with special thanks to: Pavithra Harsha, Cynthia Barnhart, MIT and David Parkes, Harvard

Multi-Unit Auctions In auctions for spectrum licenses (for example), many items may be auctioned simultaneously through an iterative procedureIn auctions for spectrum licenses (for example), many items may be auctioned simultaneously through an iterative procedure We consider an environment in which bidders report demand amounts at the current price-vectorWe consider an environment in which bidders report demand amounts at the current price-vector Examples include the Simultaneous Ascending Auction (used by the FCC), and Ausubel, Cramton, and Milgrom’s Clock-Proxy AuctionExamples include the Simultaneous Ascending Auction (used by the FCC), and Ausubel, Cramton, and Milgrom’s Clock-Proxy Auction

Problem: Bidders in an iterative multi-unit auction can often benefit by waiting to reveal their intentionsBidders in an iterative multi-unit auction can often benefit by waiting to reveal their intentions This can slow auctions and undermine the purpose of the iterative auction to reveal accurate price information (price discovery)This can slow auctions and undermine the purpose of the iterative auction to reveal accurate price information (price discovery) Solution: Activity Rules

Summary of Talk Ausubel, Cramton & Milgrom’s Rule: RPAusubel, Cramton & Milgrom’s Rule: RP A Problem with RP (from Harsha et al.)A Problem with RP (from Harsha et al.) A New Activity Rule: RPBA New Activity Rule: RPB

Notation For a specific bidder, let p t =Price vector announced at time t (non-decreasing in t) x t =Bid vector reported at time t v(x) =Value of the bundle x (to this bidder) u(p,x) =Utility of bundle x at price p

FCC Activity Rule Aggregate demand (expressed in MHz-pop) may not increase as prices increaseAggregate demand (expressed in MHz-pop) may not increase as prices increase Problem: bidders “park” their bids on licenses with the cheapest MHz-pops to maintain eligibility later, distorting price discoveryProblem: bidders “park” their bids on licenses with the cheapest MHz-pops to maintain eligibility later, distorting price discovery Ausubel, Cramton, & Milgrom argue that their Revealed Preference activity rule provides an improvementAusubel, Cramton, & Milgrom argue that their Revealed Preference activity rule provides an improvement

Revealed Preference Activity Rule (Ausubel, Cramton, and Milgrom) Bidder Preferences are assumed to be quasi-linear:Bidder Preferences are assumed to be quasi-linear: u(p,x) = v(x) – p · x The rule enforces consistency of preferences for any pair of bid vectors x s and x t with s < tThe rule enforces consistency of preferences for any pair of bid vectors x s and x t with s < t that is...

Revealed Preference Activity Rule (Ausubel, Cramton, and Milgrom) v(x s ) – p s · x s ≥ v(x t ) – p s · x t and v(x t ) – p t · x t ≥ v(x s ) – p t · x s But since v(·) is unknown, we cancel and get rule RP (p t – p s ) · (x t – x s ) ≤ 0

Revealed Preference Activity Rule (Ausubel, Cramton, and Milgrom) (p t – p s ) · (x t – x s ) ≤ 0 For a single item: demand must decrease as price increasesFor a single item: demand must decrease as price increases Further ACM argue that the rule performs as desired for cases of perfect substitutes and perfect complements or a mix of bothFurther ACM argue that the rule performs as desired for cases of perfect substitutes and perfect complements or a mix of both

A Weakened Revealed Preference Activity Rule (p t – p s ) · (x t – x s ) ≤ α Recent presentations of the clock-proxy indicate that a weakened form may be desirableRecent presentations of the clock-proxy indicate that a weakened form may be desirable

Definition:Definition: Budget-constrained quasi-linear utility u B (p,x) = v(x) – p · xif p · x ≤ B 0otherwise Definition:Definition: An activity rule is consistent if an honest bidder never causes a violation of the rule

A Problem with the RP rule (due to Harsha et al.) RP is not consistent when bidders haveRP is not consistent when bidders have budget-constrained quasi-linear utility Counter example: A bidder for multiple units of two items has values: v(5,1) = 590v(4,3) = 505B = 515 Prices announced: p 1 = (100,10)p 2 = (110, 19)

Counter example (continued) At p 1 the bidder prefers (5,1) to (4,3): 590 – (100,10) · (5,1) > 505 – (100,10) · (4,3) But at p 2 the bidder cannot afford (5,1) so (4,3) is preferred. But according to RP we must have: (p t – p s ) · (x t – x s )= (10,9) · (-1,2)= 8 ≤ 0 Which is violated, so the bid of (4,3) would be rejected, despite honest bidding

Lemma 1: If an honest, budget-constrained quasi-linear bidder submits a bid x t that violates an RP constraint for some s < t, then it must be the case that: B < p t · x sLemma 1: If an honest, budget-constrained quasi-linear bidder submits a bid x t that violates an RP constraint for some s < t, then it must be the case that: B < p t · x s Proof: if p t · x t, p s · x s, p s · x t, and p t · x s ≤ B then RP must be satisfied by an honest bidder. p t · x t and p s · x s must be ≤ B by IR. If p s · x t this yields p s > p t, contradicting a monotonically increasing price rule. Therefore the only other possibility is B p t, contradicting a monotonically increasing price rule. Therefore the only other possibility is B < p t · x s.

Implication of Lemma 1 A violation of RP can be met by a budget constraint enforced by the auctioneerA violation of RP can be met by a budget constraint enforced by the auctioneer In practice a bidder will be warned that a bid will constrain future bidding activity, that all bids must be less than the implied or revealed budgetIn practice a bidder will be warned that a bid will constrain future bidding activity, that all bids must be less than the implied or revealed budget Should an arbitrarily large violation of the RP rule be accepted?Should an arbitrarily large violation of the RP rule be accepted?

No! Find the maximum violation for which every pair of bids is consistent Max (p t – p s ) · (x t – x s )s.t. v(x s ) – p s · x s ≥ v(x t ) – p s · x t v(x t ) – p t · x t ≥ 0 B ≥ p t · x t (LP) B ≥ p s · x t B ≥ p s · x s B < p t · x s We can soften this inequality to be ≤

Lemma 2: Closed form solution to LP Let B* = p t · x sLet B* = p t · x s Find item index j = argmax i (p i t – p i s )/p i tFind item index j = argmax i (p i t – p i s )/p i t Set x j *= p t · x s /p j tSet x j *= p t · x s /p j t Set x i *= 0for all i ≠ jSet x i *= 0for all i ≠ j Claim: B* and x* form a solution to the LP from the previous slide Proof: See paper. ( me.)

Refined Activity Rule RPB PSEUDO-CODE For demand vector x t submitted at time t Compute (p t – p s ) · (x t – x s ) for each s < t 1. If for all s < t, (p t – p s ) · (x t – x s ) ≤ 0 Then accept the bid with no stipulation (continued…)

Refined Activity Rule RPB (cont.) 2. If for some s < t, (p t – p s ) · (x* – x s ) ≥ (p t – p s ) · (x t – x s ) > 0 Accept bid with implied budget B < p t · x s 3. If for some s < t, (p t – p s ) · (x t – x s ) > (p t – p s ) · (x* – x s ) Reject bid as dishonest

In Summary: RPB is a strict relaxation of the RP activity ruleRPB is a strict relaxation of the RP activity rule Violations of the RP rule are limited and result in budget restrictions on future biddingViolations of the RP rule are limited and result in budget restrictions on future bidding This overcomes the inconsistency of the RP rule when bidders have budget-constrained quasi-linear utilitiesThis overcomes the inconsistency of the RP rule when bidders have budget-constrained quasi-linear utilities

Questions for future study Is RPB an adequate relaxation of RP, so that an arbitrary α-weakening is unnecessary?Is RPB an adequate relaxation of RP, so that an arbitrary α-weakening is unnecessary? Or will the need for Bayesian learning prove that even RPB is too restrictive?Or will the need for Bayesian learning prove that even RPB is too restrictive? How do we measure the effectiveness of any activity rule for encouraging price discovery/discouraging “parking”?How do we measure the effectiveness of any activity rule for encouraging price discovery/discouraging “parking”?