|
Deep Blue at the University of Michigan >
Research Collections >
Information, School of (SI) >
|
Please use this persistent URL to cite or link to this item:
|
| Title: | Exploring bidding strategies for market-based scheduling |
| Authors: | Reeves, Daniel M.
Wellman, Michael P.
MacKie-Mason, Jeffrey K.
Osepayshvili, Anna |
| Issue Date: | Jun-2003 |
| Citation: | Decision Support Systems 39(1): 67--85 (March 2005) <http://hdl.handle.net/2027.42/50434> |
| Abstract: | A market-based scheduling mechanism allocates resources indexed by time to alternative uses based on the bids of participating agents. Agents are typically interested in multiple time slots of the schedulable resource, with value determined by the earliest deadline by which they can complete their corresponding tasks. Despite the strong complementarity among slots induced by such preferences, it is often infeasible to deploy a mechanism that coordinates allocation across all time slots. We explore the case of separate, simultaneous markets for individual time slots, and the strategic problem it poses for bidding agents. Investigation of the straightforward bidding policy and its variants indicates that the efficacy of particular strategies depends critically on preferences and strategies of other agents, and that the strategy space is far too complex to yield to general game-theoretic analysis. For particular environments, however, it is often possible to derive constrained equilibria through evolutionary search methods. |
| Appears in Collections: | Information, School of (SI)
Economics, Department of
Public Policy, Gerald R. Ford School of
|
Files in This Item:
| File |
Description |
Size | Format | |
|---|
| proof-dexter-dss.pdf | | 469Kb | Adobe PDF | View/Open |
|
Deep Blue encourages the fair use of copyrighted material, and you are free to link to content here without asking for permission. Consult the document(s) and/or contact the copyright holder for additional rights questions and requests.
|
