Auctioning one item PART 3 Tuomas Sandholm Computer Science Department Carnegie Mellon University.

Slides:



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

Auctioning one item Tuomas Sandholm Computer Science Department Carnegie Mellon University.
Approximating optimal combinatorial auctions for complements using restricted welfare maximization Pingzhong Tang and Tuomas Sandholm Computer Science.
CPS Bayesian games and their use in auctions Vincent Conitzer
Chapter 25: Auctions and Auction Markets 1 Auctions and Auction Markets.
Auctions CS 886 Sept 29, Auctions Methods for allocating goods, tasks, resources... Participants: auctioneer, bidders Enforced agreement between.
Michael R. Baye, Managerial Economics and Business Strategy, 3e. ©The McGraw-Hill Companies, Inc., 1999 Managerial Economics & Business Strategy Chapter.
Multi-item auctions with identical items limited supply: M items (M smaller than number of bidders, n). Three possible bidder types: –Unit-demand bidders.
On Cheating in Sealed-Bid Auctions Ryan Porter Yoav Shoham Computer Science Department Stanford University.
Auction Theory an introduction
Welcome Auctions Jonathan D. Wareham
1 Chapter 6: Auctions SCIT1003 Chapter 6: Auctions Prof. Tsang.
Distributed Rational Decision Making Author: Tuomas W. Sandholm Speakers: Praveen Guddeti (1---5) Tibor Moldovan (6---9) CSE 976, April 15, 2002.
Auction. Types of Auction  Open outcry English (ascending) auction Dutch (descending) auction  Sealed bid First-price Second-price (Vickrey)  Equivalence.
Private-value auctions: theory and experimental evidence (Part I) Nikos Nikiforakis The University of Melbourne.
Do software agents know what they talk about? Agents and Ontology dr. Patrick De Causmaecker, Nottingham, March
Auctions Ruth Tarrant. Classifying auctions What is the nature of the good being auctioned? What are the rules of bidding? Private value auction Common.
The Economics of Information
The Science of Networks 6.1 Today’s topics Game Theory Normal-form games Dominating strategies Nash equilibria Acknowledgements Vincent Conitzer, Michael.
Competitive Auctions Review Rattapon Limprasittiporn.
Article review A good way of checking your understanding is to give a short speech giving an overview of the article or explaining something interesting.
1 Teck-Hua Ho April 18, 2006 Auction Design I. Economic and Behavioral Foundations of Pricing II. Innovative Pricing Concepts and Tools III. Internet Pricing.
An Algorithm for Automatically Designing Deterministic Mechanisms without Payments Vincent Conitzer and Tuomas Sandholm Computer Science Department Carnegie.
Chapter Seventeen Auctions. Who Uses Auctions? u Owners of art, cars, stamps, machines, mineral rights etc. u Q: Why auction? u A: Because many markets.
1 Teck-Hua Ho April 22, 2006 Auction Design I. Economic and Behavioral Foundations of Pricing II. Innovative Pricing Concepts and Tools III. Internet Pricing.
VAMSEE KONERU PRADNYA SUTE
Computational Criticisms of the Revelation Principle Vincent Conitzer, Tuomas Sandholm AMEC V.
SECOND PART: Algorithmic Mechanism Design. Mechanism Design MD is a subfield of economic theory It has a engineering perspective Designs economic mechanisms.
Sequences of Take-It-or-Leave-it Offers: Near-Optimal Auctions Without Full Valuation Revelation Tuomas Sandholm and Andrew Gilpin Carnegie Mellon University.
Multi-unit auctions & exchanges (multiple indistinguishable units of one item for sale) Tuomas Sandholm Computer Science Department Carnegie Mellon University.
Auctioning one item PART 2 Tuomas Sandholm Computer Science Department Carnegie Mellon University.
09/28/2007 CIS Dept., UMass Dartmouth 1 Trustworthy Agent-Based Online Auction Systems Prof. Haiping Xu Concurrent Software Systems Laboratory Computer.
Exchanges = markets with many buyers and many sellers Let’s consider a 1-item 1-unit exchange first.
Costly valuation computation/information acquisition in auctions: Strategy, counterspeculation, and deliberation equilibrium Tuomas Sandholm Computer Science.
Institute for Visualization and Perception Research 1 © Copyright 1998 Haim Levkowitz Automated negotiations The best terms for all concerned Tuomas Sandholm.
Auctions Hal R. Varian. Auctions Auctions are very useful mean of price discovery eBay, everyone’s favorite example DoveBid, high value, not so well.
Managerial Economics & Business Strategy
1 Teck-Hua Ho April 13, 2006 Next Class: Design of Auction Format  Dutch auction (D) (e.g, )  First-price sealed-bid.
Multi-unit auctions & exchanges (multiple indistinguishable units of one item for sale) Tuomas Sandholm Computer Science Department Carnegie Mellon University.
Ascending multi-item auctions Increase prices until each item is demanded only once Item prices vs. bundle prices –E.g. where there exist no appropriate.
Communication Networks A Second Course Jean Walrand Department of EECS University of California at Berkeley.
Economics and Computer Science Auctions CS595, SB 213 Xiang-Yang Li Department of Computer Science Illinois Institute of Technology.
This Week’s Topics  Review Class Concepts -Auctions, continued -Repeated Games -Bertrand Trap & Anti-Trust -Auctions.
Introduction to Auctions David M. Pennock. Auctions: yesterday Going once, … going twice,...
Yang Cai Sep 8, An overview of the class Broad View: Mechanism Design and Auctions First Price Auction Second Price/Vickrey Auction Case Study:
CPS 173 Mechanism design Vincent Conitzer
Sequences of Take-It-or-Leave-it Offers: Near-Optimal Auctions Without Full Valuation Revelation Tuomas Sandholm and Andrew Gilpin Carnegie Mellon University.
6.853: Topics in Algorithmic Game Theory Fall 2011 Constantinos Daskalakis Lecture 21.
Mechanism Design CS 886 Electronic Market Design University of Waterloo.
Automated Design of Multistage Mechanisms Tuomas Sandholm (Carnegie Mellon) Vincent Conitzer (Carnegie Mellon) Craig Boutilier (Toronto)
Auctions and Bidding. 2 Auction Theory Auction theory is important for practical reason empirical reason –testing-ground for economic theory, especially.
Mechanism design. Goal of mechanism design Implementing a social choice function f(u 1, …, u |A| ) using a game Center = “auctioneer” does not know the.
Tests of Revenue Equivalence in Internet Magic Auctions David Lucking-Reiley “I have never considered the lab to be a substitute for field empirical work.”
1 Risk and Information Chapter Chapter Fifteen Overview 1.Introduction: Amazon.com 2.Describing Risky Outcome – Basic Tools Lotteries and Probabilities.
Mechanism Design II CS 886:Electronic Market Design Sept 27, 2004.
Steffen Staab 1WeST Web Science & Technologies University of Koblenz ▪ Landau, Germany Network Theory and Dynamic Systems Auctions.
Auctioning one item Tuomas Sandholm Computer Science Department Carnegie Mellon University.
Advanced Subjects in GT Prepared by Rina Talisman Introduction Revenue Equivalence The Optimal Auction (Myerson 1981) Auctions.
1 Types of Auctions English auction –ascending-price, open-outcry Dutch auction –descending-price, open-outcry 1 st price sealed bid auction –known as.
Tuomas Sandholm Computer Science Department Carnegie Mellon University
Failures of the VCG Mechanism in Combinatorial Auctions and Exchanges
Tuomas Sandholm Computer Science Department Carnegie Mellon University
Tuomas Sandholm Computer Science Department Carnegie Mellon University
Tuomas Sandholm Computer Science Department Carnegie Mellon University
Implementation in Bayes-Nash equilibrium
Implementation in Bayes-Nash equilibrium
Tuomas Sandholm Computer Science Department Carnegie Mellon University
Implementation in Bayes-Nash equilibrium
Presentation transcript:

Auctioning one item PART 3 Tuomas Sandholm Computer Science Department Carnegie Mellon University

Undesirable private information revelation Agents strategic marginal cost information revealed because truthful bidding is a dominant strategy in Vickrey (and English) –Observed problems with subcontractors First-price sealed-bid & Dutch may not reveal this info as accurately –Lying –No dominant strategy –Bidding decisions depend on beliefs about others

Untruthful bidding with local uncertainty even in Vickrey Uncertainty (inherent or from computation limitations) Many real-world parties are risk averse Computational agents take on owners preferences Thrm [Sandholm ICMAS-96]. It is not the case that in a private value Vickrey auction with uncertainty about an agent’s own valuation, it is a risk averse agent’s best (dominant or equilibrium) strategy to bid its expected value Higher expected utility e.g. by bidding low

Wasteful counterspeculation Thrm [Sandholm ICMAS-96]. In a private value Vickrey auction with uncertainty about an agent’s own valuation, a risk neutral agent’s best (deliberation or information gathering) action can depend on others. E.g. two bidders (1 and 2) bid for a good. v 1 uniform between 0 and 1; v 2 deterministic, 0 ≤ v 2 ≤ 0.5 Agent 1 bids 0.5 and gets item at price v 2 : Say agent 1 has the choice of paying c to find out v 1. Then agent 1 will bid v 1 and get the item iff v 1 ≥ v 2 (no loss possibility, but c invested)

Sniping = bidding very late in the auction in the hopes that other bidders do not have time to respond Especially an issue in electronic auctions with network lag and lossy communication links

[from Roth & Ockenfels]

Sniping… Amazon auctions give automatic extensions, eBay does not Antiques auctions have experts [from Roth & Ockenfels]

Sniping… [from Roth & Ockenfels]

Sniping… Can make sense to both bid through a regular insecure channel and to snipe Might end up sniping oneself

Mobile bidder agents in eMediator Allow user to participate while disconnected Avoid network lag Put expert bidders and novices on an equal footing Full flexibility of Java (Concordia) Template agents through an HTML page for non- programmers –Information agent –Incrementor agent –N-agent –Control agent –Discover agent

Mobile bidder agents in eMediator

Mobile bidder agents in eMediator...

Conclusions on 1-item auctions Nontrivial, but often analyzable with reasonable effort –Important to understand merits & limitations –Unintuitive protocols may have better properties Vickrey auction induces truth-telling & avoids counterspeculation (in limited settings) Choice of a good auction protocol depends on the setting in which the protocol is used