Persistent Link:
http://hdl.handle.net/10150/288811
Title:
A smart market for scheduling: An experimental study
Author:
Dinkin, Samuel Howard
Issue Date:
1996
Publisher:
The University of Arizona.
Rights:
Copyright © is held by the author. Digital access to this material is made possible by the University Libraries, University of Arizona. Further transmission, reproduction or presentation (such as public display or performance) of protected items is prohibited except with permission of the author.
Abstract:
Some scarce resources, like a factory production line, produce a steady but fixed flow of goods or services. The difficulties common to their efficient use are exemplified by the problem of scheduling a single machine. Scheduling even a single machine is NP-hard--nonetheless, simulated bidders and human bidders can achieve 80 to 99 percent efficiency in a market for scheduling. These success rates are higher than heuristic algorithms currently in use. A market for scheduling provides an incentive to accurately report valuations. Combining operations research and experimental economics, this study presents and tests a prototype for a continuous time, combinatorial market for scheduling. This study reveals that real-time combinatorial markets are possible with off-the-shelf technology. In addition, such markets could be implemented to more efficiently solve problems of personnel and resource scheduling.
Type:
text; Dissertation-Reproduction (electronic)
Keywords:
Economics, General.
Degree Name:
Ph.D.
Degree Level:
doctoral
Degree Program:
Graduate College; Economics
Degree Grantor:
University of Arizona
Advisor:
Smith, Vernon L.

Full metadata record

DC FieldValue Language
dc.language.isoen_USen_US
dc.titleA smart market for scheduling: An experimental studyen_US
dc.creatorDinkin, Samuel Howarden_US
dc.contributor.authorDinkin, Samuel Howarden_US
dc.date.issued1996en_US
dc.publisherThe University of Arizona.en_US
dc.rightsCopyright © is held by the author. Digital access to this material is made possible by the University Libraries, University of Arizona. Further transmission, reproduction or presentation (such as public display or performance) of protected items is prohibited except with permission of the author.en_US
dc.description.abstractSome scarce resources, like a factory production line, produce a steady but fixed flow of goods or services. The difficulties common to their efficient use are exemplified by the problem of scheduling a single machine. Scheduling even a single machine is NP-hard--nonetheless, simulated bidders and human bidders can achieve 80 to 99 percent efficiency in a market for scheduling. These success rates are higher than heuristic algorithms currently in use. A market for scheduling provides an incentive to accurately report valuations. Combining operations research and experimental economics, this study presents and tests a prototype for a continuous time, combinatorial market for scheduling. This study reveals that real-time combinatorial markets are possible with off-the-shelf technology. In addition, such markets could be implemented to more efficiently solve problems of personnel and resource scheduling.en_US
dc.typetexten_US
dc.typeDissertation-Reproduction (electronic)en_US
dc.subjectEconomics, General.en_US
thesis.degree.namePh.D.en_US
thesis.degree.leveldoctoralen_US
thesis.degree.disciplineGraduate Collegeen_US
thesis.degree.disciplineEconomicsen_US
thesis.degree.grantorUniversity of Arizonaen_US
dc.contributor.advisorSmith, Vernon L.en_US
dc.identifier.proquest9720684en_US
dc.identifier.bibrecord.b34585412en_US
All Items in UA Campus Repository are protected by copyright, with all rights reserved, unless otherwise indicated.