Allocative Efficiency in Online Auctions: Improving the Performance of Multiple Online Auctions via Seek-and-Protect Agents

Forthcoming in Production and Operations Management

37 Pages Posted: 6 May 2020

See all articles by Ravi Bapna

Ravi Bapna

University of Minnesota - Minneapolis

Robert Day

University of Connecticut - Department of Operations & Information Management

Sarah C. Rice

Texas A&M University - Mays Business School

Date Written: April 10, 2020

Abstract

Much of the prominent literature describing behavior in eBay-like marketplaces emphasizes the successful use of “sniping” agents that wait until the last moments of an auction to bid (truthfully) on behalf of a human user. These agents fare well against “naïve” agents (typically assumed to be those who bid incrementally on the most profitable open auction) who do not get the chance to respond to the snipe-bid placed in the final seconds. This reasoning, however, tends to ignore the effect of the poor coordination that occurs as more and more players attempt the sniping agent strategy, thereby raising prices above their minimum possible competitive equilibrium levels.

Using proprietary data purchased from eBay, encompassing all bids submitted on four specific product types over a 3-month period, we analyze the allocative efficiency, price, and bidder surplus using a software agent and compare this to the historical performance. After showing a significant amount of “money left on the table” in the historical record, we proceed to demonstrate how bidders can significantly improve their surplus (i.e., observed profit) by adopting a “seek-and-protect” agent. If bidders go further and implement sequential-auction shading strategies, they can incrementally improve their surplus, but sometimes at the expense of allocative efficiency. Acknowledging that each bidder’s time window of interest is inherently unobservable, we vary the length of bidders’ consumption windows and find similar results.

Keywords: overlapping auctions, simultaneous auctions, allocative efficiency, bidding agents; core prices

Suggested Citation

Bapna, Ravi and Day, Robert and Rice, Sarah C., Allocative Efficiency in Online Auctions: Improving the Performance of Multiple Online Auctions via Seek-and-Protect Agents (April 10, 2020). Forthcoming in Production and Operations Management, Available at SSRN: https://ssrn.com/abstract=3573209

Ravi Bapna

University of Minnesota - Minneapolis ( email )

321 19th Ave S
Information and Decision Sciences
Minneapolis, MN 55455
United States

Robert Day (Contact Author)

University of Connecticut - Department of Operations & Information Management ( email )

368 Fairfield Road
Storrs, CT 06269-2041
United States

Sarah C. Rice

Texas A&M University - Mays Business School ( email )

Wehner 401Q, MS 4353
College Station, TX 77843-4218
United States

Do you have a job opening that you would like to promote on SSRN?

Paper statistics

Downloads
8
Abstract Views
149
PlumX Metrics