Counteracting shill bidding in online english auction

The popularity of online auctions and the associated frauds have led to many auction sites preferring English auction over other auction mechanisms. The ease of adopting multiple fake identities over the Internet nourishes shill bidding by fraudulent sellers in English auction. In this paper, we derive an equilibrium bidding strategy to counteract shill bidding in an online English auction. An algorithm based on this strategy is developed. We conduct experiments to evaluate the strategy in a simulated eBay like auction environment. Five popular bidding strategies are compared with the proposed one. In the simulation, bidders compete to buy a product in the presence of a shill. Each bidder is randomly assigned a bidding strategy. She draws her valuation from a uniform distribution. The experiments show hat the average expected utility of agents with proposed strategy is the highest when the auction continues for a longer duration.

[1]  Yoav Shoham,et al.  On cheating in sealed-bid auctions , 2003, EC '03.

[2]  Onn Shehory,et al.  Optimal Bidding in Multiple Concurrent Auctions , 2002, Int. J. Cooperative Inf. Syst..

[3]  Michael P. Wellman,et al.  The Michigan Internet AuctionBot: a configurable auction server for human and software agents , 1998, AGENTS '98.

[4]  Moshe Tennenholtz,et al.  An Algorithm for Multi-Unit Combinatorial Auctions , 2000, AAAI/IAAI.

[5]  R. Kauffman,et al.  Running up the Bid: Modeling Seller Opportunism in Internet Auctions , 2000 .

[6]  Andrew B. Whinston,et al.  Shill bidding in multi-round online auctions , 2002, Proceedings of the 35th Annual Hawaii International Conference on System Sciences.

[7]  Russell R. Barton,et al.  Proceedings of the 2000 winter simulation conference , 2000 .

[8]  J. Richard,et al.  Phantom bidding against heterogeneous bidders , 1990 .

[9]  Roger B. Myerson,et al.  Optimal Auction Design , 1981, Math. Oper. Res..

[10]  E. Friedman,et al.  The Social Cost of Cheap Pseudonyms , 2001 .

[11]  Ashish Sureka,et al.  Mining for bidding strategies on ebay , 2003 .

[12]  R. Cassady Auctions and Auctioneering , 2023 .

[13]  Andrew Byde,et al.  An Optimal Dynamic Programming Model for Algorithm Design in Simultaneous Auctions , 2001 .

[14]  P. Klemperer What Really Matters in Auction Design , 2001 .

[15]  Andrew B. Whinston,et al.  Building Trust in Online Auction Markets Through an Economic Incentive Mechanism , 2003, Decis. Support Syst..

[16]  Rami Zwick,et al.  Auction on the internet - a preliminary study , 1999 .

[17]  P. Klemperer Auction Theory: A Guide to the Literature , 1999 .

[18]  Daniel Lehmann,et al.  Optimal solutions for multi-unit combinatorial auctions: branch and bound heuristics , 2000, EC '00.

[19]  D. Anderson,et al.  Algorithms for minimization without derivatives , 1974 .

[20]  Kenneth Steiglitz,et al.  Agent-based simulation of dynamic online auctions , 2000, 2000 Winter Simulation Conference Proceedings (Cat. No.00CH37165).