Decentralized computation procurement and computational robustness in a smart market
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.
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.
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.
Volume (Year): 13 (1999)
Issue (Month): 1 ()
|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|
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: (Sonal Shukla)or (Christopher F Baum)
If references are entirely missing, you can add them using this form.