Shillin’ like a Villian: Fraud in Online Auction Markets HAN YANG LEE AND TOM XU ECON1465, Fall 2011 Brown University.

Slides:



Advertisements
Similar presentations
Yossi Sheffi Mass Inst of Tech Cambridge, MA ESD.260J/1.260J/15.
Advertisements

Online Auction Fraud Dr Jarrod Trevathan Discipline of IT, School of Business.
The U.S. Treasury: Types of Markets and Auctions Petar Petrov ECON 1465, Fall 2010 Brown University.
(Single-item) auctions Vincent Conitzer v() = $5 v() = $3.
Network Economics -- Lecture 4: Auctions and applications Patrick Loiseau EURECOM Fall 2012.
CPS Bayesian games and their use in auctions Vincent Conitzer
Economics 100B u Instructor: Ted Bergstrom u T.A. Oddgeir Ottesen u Syllabus online at (Class pages) Or at
An Auctioning Reputation System Based on Anomaly Detection Shai Rubin, Mihai Christodorescu Vinod Ganapathy, Jonathon T. Giffin, Louis Kruger, Hao Wang,
1 Auctioning Many Similar Items Lawrence Ausubel and Peter Cramton Department of Economics University of Maryland.
Chapter 25: Auctions and Auction Markets 1 Auctions and Auction Markets.
Intermediate Microeconomics Midterm (50%) (4/27) Final (50%) (6/22) Term grades based on relative ranking. Mon 1:30-2:00 ( 社科 757)
An Approximate Truthful Mechanism for Combinatorial Auctions An Internet Mathematics paper by Aaron Archer, Christos Papadimitriou, Kunal Talwar and Éva.
Auctions Auction types: –First price, sealed bid auction –Second price, sealed bid auction –English auction (ascending bid auction) –Dutch auction (descending.
On Cheating in Sealed-Bid Auctions Ryan Porter Yoav Shoham Computer Science Department Stanford University.
Different Auction Institutions English Auction– begin with lowest acceptable price and solicit higher bids until no more increases– then item is “sold.”
1 Chapter 6: Auctions SCIT1003 Chapter 6: Auctions Prof. Tsang.
Auction. Types of Auction  Open outcry English (ascending) auction Dutch (descending) auction  Sealed bid First-price Second-price (Vickrey)  Equivalence.
Multiagent Coordination Using a Distributed Combinatorial Auction Jose M. Vidal University of South Carolina AAAI Workshop on Auction Mechanisms for Robot.
Private-value auctions: theory and experimental evidence (Part I) Nikos Nikiforakis The University of Melbourne.
Auctions Ruth Tarrant. Classifying auctions What is the nature of the good being auctioned? What are the rules of bidding? Private value auction Common.
Auction Theory Class 3 – optimal auctions 1. Optimal auctions Usually the term optimal auctions stands for revenue maximization. What is maximal revenue?
Optimal auction design Roger Myerson Mathematics of Operations research 1981.
A Prior-Free Revenue Maximizing Auction for Secondary Spectrum Access Ajay Gopinathan and Zongpeng Li IEEE INFOCOM 2011, Shanghai, China.
Liz DiMascio Paige Warren- Shriner Mitch Justus DUTCH AND ENGLISH AUCTIONS IN RELATION TO THE TULIP MARKET.
Auction. Definition An auction is a process of buying and selling goods or services by offering them up for bid, taking bids, and then selling the item.
Scott Nicol Andrew Burg.  Financing Government Debt  Foreign Government Borrowing  Tax Payer Receipts  Issuance of Government Debt.
Yale School of Management What causes the underpricing of auctioned IPOs? Experimental Evidence Panos Patatoukas, October 2007.
Paired Data: One Quantitative Variable Chapter 7.
Biased Price Signals and Reaction of Bidders in Vickrey Auction IPOs Aytekin Ertan December 2009.
Heterogeneity and the Winner’s Curse Mike Huwyler.
Reducing Costly Information Acquisition in Auctions Kate Larson, University of Waterloo Presented by David Thompson, University of British Columbia July.
Week 21 COS 444 Internet Auctions: Theory and Practice Spring 2009 Ken Steiglitz
A Heuristic Bidding Strategy for Multiple Heterogeneous Auctions Patricia Anthony & Nicholas R. Jennings Dept. of Electronics and Computer Science University.
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.
CS522: Algorithmic and Economic Aspects of the Internet Instructors: Nicole Immorlica Mohammad Mahdian
Sequences of Take-It-or-Leave-it Offers: Near-Optimal Auctions Without Full Valuation Revelation Tuomas Sandholm and Andrew Gilpin Carnegie Mellon University.
Week 5 1 COS 444 Internet Auctions: Theory and Practice Spring 2008 Ken Steiglitz
Week 10 1 COS 444 Internet Auctions: Theory and Practice Spring 2008 Ken Steiglitz
Outline  In-Class Experiment on First-Price Sealed-Bid Auctions  Professor John Morgan: Internet Auctions  The Winner’s Curse Hypothesis: Kagel and.
Week 4 1 COS 444 Internet Auctions: Theory and Practice Spring 2008 Ken Steiglitz
Outline  In-Class Experiment on First-Price Sealed-Bid Auctions  Professor John Morgan: Internet Auctions  The Winner’s Curse Hypothesis: Kagel and.
11/08/2009 Princeton University 1 Sharing Mart: An Experimental Platform for Socio-Technological Networks Research Dr. Hazer Inaltekin Department of Electrical.
Week 41 COS 444 Internet Auctions: Theory and Practice Spring 2010 Ken Steiglitz
Yang Cai Sep 15, An overview of today’s class Myerson’s Lemma (cont’d) Application of Myerson’s Lemma Revelation Principle Intro to Revenue Maximization.
This Week’s Topics  Review Class Concepts -Auctions, continued -Repeated Games -Bertrand Trap & Anti-Trust -Auctions.
1 Teck-Hua Ho April 13, 2006 Auction Principles I. Economic and Behavioral Foundations of Pricing II. Innovative Pricing Concepts and Tools III. Internet.
MAHIMA CHAWLA ELIZABETH GORDON The Adoption Market: How can the number of parent- child matchings be increased?
Introduction to Auctions David M. Pennock. Auctions: yesterday Going once, … going twice,...
Snipers, Shills, and Sharks Ken Steiglitz Princeton University Press, 2007.
Sequences of Take-It-or-Leave-it Offers: Near-Optimal Auctions Without Full Valuation Revelation Tuomas Sandholm and Andrew Gilpin Carnegie Mellon University.
Combinatorial Auctions By: Shai Roitman
Marketing Management Dawn Iacobucci © 2012 Cengage Learning. All Rights Reserved. May not be scanned, copied or duplicated, or posted to a publicly accessible.
Motivation This experiment was a public good experiment to see if groups contribute differently than individuals.  intermediate social structure This.
Data Analysis Econ 176, Fall Populations When we run an experiment, we are always measuring an outcome, x. We say that an outcome belongs to some.
Auctions An auction is a mechanism for trading items by means of bidding. Dates back to 500 BC where Babylonians auctioned of women as wives. Position.
26 Online Auctions 3 Aaron Schiff ECON Introduction Objectives of this lecture: Introduce issues relating to auction design such as reserve.
Markets Markets – exchanges between buyers and sellers. Supply – questions faced by sellers in those exchanges are related to how much to sell and at.
Auctions serve the dual purpose of eliciting preferences and allocating resources between competing uses. A less fundamental but more practical reason.
Joshi, Sun, Vora Sumit Joshi, Yu-An Sun, Poorvi Vora The George Washington University The Privacy Cost of the Second Chance Offer.
Risk Aversion and Optimal Reserve Prices in First and Second-Price Auctions Audrey Hu University of Amsterdam Stephen A. Matthews University of Pennsylvania.
Advanced Subjects in GT Prepared by Rina Talisman Introduction Revenue Equivalence The Optimal Auction (Myerson 1981) Auctions.
Lecture 4 on Auctions Multiunit Auctions We begin this lecture by comparing auctions with monopolies. We then discuss different pricing schemes for selling.
Auctions Supplemental Material. In case you haven't noticed: Auctions are Everywhere! eBay → simple auctions for a single item AdWord Auctions → advertisers.
Auctions and Competitive Bidding
Grading on a curve, and other effect of group size on all-pay auctions
Auction Theory.
The Right of First Offer
Field Experiments in Economics
Field Experiments in Economics
Presentation transcript:

Shillin’ like a Villian: Fraud in Online Auction Markets HAN YANG LEE AND TOM XU ECON1465, Fall 2011 Brown University

A shill typically refers to someone who purposely gives the impression that he or she is an enthusiastic independent customer of a seller that he or she is secretly working for. Competitive Behavior (1) A shill tends to bid exclusively in auctions only held by one particular seller. (2) A shill tends to have a high bid frequency. (3) A shill has few or no winnings for the auctions participated in. (4) It is advantageous for a shill to bid within a small time period after a legitimate bid. (5) A shill usually bids the minimum amount required to outbid a legitimate bidder. (6) A shill's goal is to try and stimulate bidding. Introduction

Reserve Price Shilling Seller shills in order to avoid auction house fees. Competitive Shilling Seller shills to drive up the value of the final bid. Premium Bid A bid that is higher than other bids for the same item in different auctions. Ebay Fee Structure Types of Shills

Barbaro, S. and Bracht, B. (2006). “Shilling, Squeezing, Sniping: Explaining late bidding in online second-price auctions,” working paper. Engelbrecht-Wiggans, R. (1987). On Optimal Reservation Prices in Auctions. Management Science 33 (6), R. J. Kauffman and C. A. Wood. Running up the bid: detecting, predicting, and preventing reserve price shilling in online auctions. In International Conference on Electronic Commerce, Pittsburgh, PA, 2003 R.J. Kauffman and C.A. Wood, The effects of shilling on final bid prices in online auctions, Electronic Commerce Research and Applications 4(1) Spring (2005) 21–34. Myerson, R.B. (1981). Optimal Auction Design. Mathematics of Operations Research J. Trevathan and W. Read Detecting Shill Bidding in Online English Auctions. Technical Report, James Cook University, May Wang, Wenli, Zoltan Hidvegi, and Andrew Whinston. Shill-Proof Fee (SPF) Schedule: the Sunscreen against Seller Self-Collusion in Online English Auctions. Existing Literature

Final Price Exploration 1. Winner's Curse Hypothesis (NE) 2. Value Signal Hypothesis (E) 3. Rational Bidder Hypothesis (NE) Seller Behavior Exploration 1. Repeatable Shilling Behavior Hypothesis (E) 2. Experienced Seller Hypothesis (NE) 3. Reputation Hypothesis (NE) Explored Hypothesis through Empirical Data

Detection Algorithm Strengths: -Attempts to find a bidding pattern -Finds a "shill score" for each bidder 1. Bidder/Seller relationship 2. Aggressive bids 3. Bidder winning percentage 4. Bid speed 5. Incremental Bid 6. Earliness of Bid Weakness: -Sellers can change strategy, but will be less efficient Shill-Proof Fee Strengths: -Alters fee structure -Instead of final fee based on reserve price + final price, it will be based on fixed listing price + (final price - reserve price) -Sellers become indifferent -Does not affect honest sellers/buyers Weakness: -Theoretical assumption of IPV -SPF commission rate must be calculated per auction Possible Solutions

Proposed Experiment - Summary 1.Seller assigned item from v = [50, 500], uniform distribution (discrete whole values) 2.Recommend reserve price =.5v (UB) 1.Seller then sets reserve price 1.Auction time is 2 min. 2.First 30 seconds only seller can bid 1.Auction then continues 2.Final price determines payoff for seller 1.After each round seller assigned % based off of final price – reserve price fee, normalized to v 2.Minimal reserve price is 1 3.Higher % per round = higher payout for participants 4.Three groups, ten participants per group, [10, 15] rounds 5.Two stages as each participant partakes in two groups 6.Fee structure similar to that of eBay

Behavior  Each auction has 10 bidders, automated  When a bidder wants to bid, timing of bid [1, 10] seconds, uniformly distributed  Each bidder has a private value assigned each round  N(v, (.1v) 2 ) – rounded to nearest whole value  Auction has minimum incremental bid of.01v Proposed Experiment - Bidders

Shill Proof Fee -Adopt simplified SPF recommended in Wang et al. -Since all variables set, commission fee will be fixed (sellers will not know) -To start the experiment, each seller will know the fee changes from the control group Detection Algorithm -Simplification of model from Trevathan and Read -Depending on the difference between recommend reserve and actual, we set a probability of detection -If caught, sellers are forbidden to participate in next round Proposed Experiment - Groups

1) Believe that the SPF will be more effective as it is a preventative measure 2) We hypothesize an early spike in shilling but then gradual decrease as seller realize that shilling has no effect 3) Cost of SPF potentially lower than detection algorithm 4) Changing incentives, may be more efficient than punishment 5) Potential for interesting results in Stage 1 vs. Stage 2 Hypothesis of Experiment Results

 Concern of lack of incentive for eBay to prevent shilling  Evidence that large sellers often shill  Light punishment for offenders  Shilling might generate large revenues  Experimental results can potentially give insight  Seller behavior: incentive changes vs. punishment  Further Research  Empirical cost data  Smaller auction houses  Competitive bidding prevention  Buyer behavior - sniping Conclusion