Multi-Period Combinatorial Auction Mechanism for Distributed Resource Allocation and SchedulingIEEE/WIC/ACM International Conference on Intelligent Agent Technology, 2007: IAT '07: 2-5 November 2007, Fremont, CA: Proceedings
Publication TypeConference Proceeding Article
AbstractWe consider the problem of resource allocation and scheduling where information and decisions are decentralized, and our goal is to propose a market mechanism that allows resources from a central resource pool to be allocated to distributed decision makers (agents) that seek to optimize their respective scheduling goals. We propose a generic combinatorial auction mechanism that allows agents to competitively bid for the resources needed in a multi-period setting, regardless of the respective scheduling problem faced by the agent, and show how agents can design optimal bidding strategies to respond to price adjustment strategies from the auctioneer. We apply our approach to handle real-time large-scale dynamic resource coordination in a mega-scale container terminal.
PublisherIEEE Computer Society
City or CountryLos Alamitos, CA
Creative Commons LicenseCreative Commons Attribution-Noncommercial-No Derivative Works 4.0
Citation InformationHoong Chuin LAU, Shih-Fen CHENG, Thin Yin LEONG, Jong Han PARK, et al.. "Multi-Period Combinatorial Auction Mechanism for Distributed Resource Allocation and Scheduling" IEEE/WIC/ACM International Conference on Intelligent Agent Technology, 2007: IAT '07: 2-5 November 2007, Fremont, CA: Proceedings (2007) p. 407 - 411
Available at: http://works.bepress.com/sfcheng/3/