Advanced Search
MyIDEAS: Login to save this article or follow this journal

Decentralized computation procurement and computational robustness in a smart market

Contents:

Author Info

  • Paul J. Brewer

    ()
    (Department of Economics, Georgia State University, Atlanta, GA 30303, USA)

Registered author(s):

    Abstract

    Several `smart market' mechanisms have recently appeared in the literature. These mechanisms combine a computer network that collects bids from agents with a central computer that selects a schedule of bids to fill based upon maximization of revenue or trading surplus. Potential problems exist when this optimization involves combinatorial difficulty sufficient to overwhelm the central computer. This paper explores the use of a computation procuring clock auction to induce human agents to approximate the solutions to discrete constrained optimization problems. Economic and computational properties of the auction are studied through a series of laboratory experiments. The experiments are designed around a potential application of the auction as a secondary institution that approximates the solution to difficult computational problems that occur within the primary `smart market', and show that the auction is effective and robust in eliciting and processing suggestions for improved schedules.

    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://link.springer.de/link/service/journals/00199/papers/9013001/90130041.pdf
    Download Restriction: Access to the full text of the articles in this series is restricted

    As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.

    Bibliographic Info

    Article provided by Springer in its journal Economic Theory.

    Volume (Year): 13 (1999)
    Issue (Month): 1 ()
    Pages: 41-92

    as in new window
    Handle: RePEc:spr:joecth:v:13:y:1999:i:1:p:41-92

    Note: Received: November 5, 1996; revised version: September 30, 1997
    Contact details of provider:
    Web page: http://link.springer.de/link/service/journals/00199/index.htm

    Order Information:
    Web: http://link.springer.de/orders.htm

    Related research

    Keywords:

    Find related papers by JEL classification:

    References

    No references listed on IDEAS
    You can help add them by filling out this form.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as in new window

    Cited by:
    1. Drexl, Andreas & Jörnsten, Kurt & Knof, Diether, 2005. "Non-linear anonymous pricing in combinatorial auctions," Discussion Papers 2005/6, Department of Business and Management Science, Norwegian School of Economics.
    2. Sven de Vries & Rakesh Vohra, 2000. "Combinatorial Auctions: A Survey," Discussion Papers 1296, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
    3. Drexl, Andreas & Jörnsten, Kurt, 2005. "Reflections about pseudo-dual prices in combinatorial auctions," Discussion Papers 2005/1, Department of Business and Management Science, Norwegian School of Economics.

    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:spr:joecth:v:13:y:1999:i:1:p:41-92. 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: (Guenther Eichhorn) or (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.