dc.contributor.author | Strandenes, Siri Pettersen | |
dc.contributor.author | Wolfstetter, Elmar | |
dc.date.accessioned | 2006-08-03T07:40:16Z | |
dc.date.available | 2006-08-03T07:40:16Z | |
dc.date.issued | 2003-10 | |
dc.identifier.issn | 0804-6824 | |
dc.identifier.uri | http://hdl.handle.net/11250/163280 | |
dc.description.abstract | This paper considers one-sided scheduling problems, where a schedule
of service is arranged at one location, without regard to other schedules.
Typically, such scheduling problems are handled on a first-come-firstserve
basis, which is grossly inefficient. The present paper proposes
a scheduling mechanism that is a non-standard auction, in which the
allocation is ruled by evaluating combinations of bids. The proposed
mechanism implements the efficient allocation in dominant strategies
and is deficit-free. Since that mechanism is suitable for the scheduling
problems at sea-ports, loading or unloading at sea-ports is used as an illustration. | en |
dc.format.extent | 80101 bytes | |
dc.format.mimetype | application/pdf | |
dc.language.iso | eng | en |
dc.publisher | Norwegian School of Economics and Business Administration. Department of Economics | en |
dc.relation.ispartofseries | Discussion paper | en |
dc.relation.ispartofseries | 2004:13 | en |
dc.subject | auctions | en |
dc.subject | rationing | en |
dc.title | Efficient (re-)scheduling : an auction approach | en |
dc.type | Working paper | en |