Advanced Search
MyIDEAS: Login

Bidding Strategies in Internet Yankee Auctions: Theory and Evidence

Contents:

Author Info

  • Rafael Tenorio

    ()
    (University of Notre Dame)

  • Robert F. Easley

    ()
    (University of Notre Dame)

Registered author(s):

    Abstract

    In the past few years, we have witnessed a tremendous proliferation of transactions using the Internet as a virtual marketplace. U.S. News and World Report estimates the value of electronic commerce around $13 billion in 1998. In addition to transactions where prices are posted, sellers also use Internet auctions to sell goods such as clothing, collectibles, computers, and electronics. Current estimates place the value of auction transactions in the Internet at $30 million per week. A popular format for Internet auctions is the Yankee format. Here, a seller offers k identical units for sale, and bidders specify how many units they want and the per-unit price they want to pay. Bidding takes place progressively over a predetermined time period and the k highest bids at closing win the units at their specified prices. Ties are broken on the basis of quantities first and time of bidding second. Two features make these auctions different from standard auctions. First, unlike "live" auctions with fixed participation costs, entering each bid may be costly in a Yankee auction since bidding takes place over several hours (or days) and, in addition to connectivity cost, several minutes time must spend several registering the new price. Second, each time the bidder visits the auction site, she is uncertain about the competition since it is possible for more bidders to decide to enter before the closing. Here, we derive and characterize equilibrium strategies in simple Yankee auctions with stochastic demand. We show that costly bidding may induce bidders to bid high or jump bid in earlier rounds. These jump bids play a signaling role; they attempt to discourage later bidders from competing with established bidders. This way, under some conditions, both sender and receiver of the signal may be better off in equilibrium. The sender because deterring competition saves her the costs of additional bids, and the receiver because she avoids the costs of fruitless early competition. Here, we derive conditions on bidding costs and bidder types that result in a signaling equilibrium of this nature. We show that the characteristics of the equilibrium are closely related to the structure of demand uncertainty faced by the bidders since signal bidding has more strategic value when bidders anticipate further competition later in the auction. We use data from hundreds of Yankee Auctions to test some predictions of the jump-bidding model. In confirmation, we find (a) over 40% of the bidders in our sample enter jump bids, (b) any individual bidder is more likely to enter a jump bid as his first bid, (c) earlier bidders are more likely to enter jump bids than later bidders, (d) the relative size of a jump bid is increasing in the number of bidders relative to units being sold, and (e) the relative size of a jump bid is decreasing in the object's average value. We conclude with a discussion of the implications of costly bidding and jump-bidding strategies on Internet auction design.

    Download Info

    If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
    File URL: http://www.nd.edu/~reasley/cef99.pdf
    Our checks indicate that this address may not be valid because: 404 Not Found (http://www.nd.edu/~reasley/cef99.pdf [301 Moved Permanently]--> http://www3.nd.edu/~reasley/cef99.pdf). If this is indeed the case, please notify (Christopher F. Baum)
    File Function: main text
    Download Restriction: no

    Bibliographic Info

    Paper provided by Society for Computational Economics in its series Computing in Economics and Finance 1999 with number 1021.

    as in new window
    Length:
    Date of creation: 01 Mar 1999
    Date of revision:
    Handle: RePEc:sce:scecf9:1021

    Contact details of provider:
    Postal: CEF99, Boston College, Department of Economics, Chestnut Hill MA 02467 USA
    Fax: +1-617-552-2308
    Web page: http://fmwww.bc.edu/CEF99/
    More information through EDIRC

    Related research

    Keywords:

    This paper has been announced in the following NEP Reports:

    References

    References listed on IDEAS
    Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
    as in new window
    1. McAfee, R. Preston & McMillan, John, 1987. "Auctions with a stochastic number of bidders," Journal of Economic Theory, Elsevier, vol. 43(1), pages 1-19, October.
    2. Tenorio, Rafael, 1997. "On Strategic Quantity Bidding in Multiple Unit Auctions," Journal of Industrial Economics, Wiley Blackwell, vol. 45(2), pages 207-17, June.
    3. Lawrence M. Ausubel & Peter Cramton, 1995. "Demand Reduction and Inefficiency in Multi-Unit Auctions," Papers of Peter Cramton 98wpdr, University of Maryland, Department of Economics - Peter Cramton, revised 22 Jul 2002.
    4. Avery, Christopher, 1998. "Strategic Jump Bidding in English Auctions," Review of Economic Studies, Wiley Blackwell, vol. 65(2), pages 185-210, April.
    Full references (including those not matched with items on IDEAS)

    Citations

    Lists

    This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.

    Statistics

    Access and download statistics

    Corrections

    When requesting a correction, please mention this item's handle: RePEc:sce:scecf9:1021. See general information about how to correct material in RePEc.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Christopher F. Baum).

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If references are entirely missing, you can add them using this form.

    If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.