Two topics in online auctions

This thesis studies two operations management topics in online auctions, and is divided into two parts. Motivated by the increasing use of ShopBots to scan Internet auctions, the first part of the thesis analytically examines whether or not two competing auctioneers selling the same commodity should share, or pool, some or all of their bidders. Under pooling, the bidding population is represented by three compartments: bidders dedicated to auction 1, bidders dedicated to auction 2, and pooled bidders participating in both auctions simultaneously. Under a bidder strategy shown to induce a Bayesian equilibrium, a closed form expression for the auctioneers' expected revenue under pooling is found, and pooling is recommended where it produces a greater expected revenue than no pooling (i.e., our objective is revenue maximization). Pooling is generally found to be beneficial as long as the two auctions are not too asymmetric and the underlying valuation distribution has certain concavity characteristics. Asymptotic order statistic arguments are used where explicit characterizations are intractable. The second part of the thesis considers a manufacturer who uses a reverse, or procurement, auction to determine which supplier will be awarded a contract. Each bid consists of a price and a set of non-price attributes (e.g., quality, lead time). The manufacturer is assumed to know the suppliers' cost functions (in terms of the non-price attributes). We analyze how the manufacturer chooses a scoring rule (i.e., a function that ranks the bids in terms of the price and non-price attributes) that attempts to maximize his own utility. Under the assumption that suppliers submit their myopic best-response bids (i.e., they choose their minimum-cost bid to achieve any given score), our proposed scoring rule indeed maximizes the manufacturer's utility within the open-ascending format.

Department dc:contributor.department

Massachusetts Institute of Technology. Operations Research Center.

Grantor dc:publisher

Massachusetts Institute of Technology

Year dc:date.issued

2003

Author dc:creator

• Beil, Damian

Advisor dc:contributor.advisor

• Lawrence M. Wein.

• Operations Research Center.

Statement dc:rights

• M.I.T. theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. See provided URL for inquiries about permission.

Licence dc:rights.uri

• http://dspace.mit.edu/handle/1721.1/7582

Language dc:language.iso

eng

Handle dc:identifier.uri

http://hdl.handle.net/1721.1/17578

OAI identifier oai:identifier

oai:dspace.mit.edu:1721.1/17578