Conference Proceeding Article
We 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.
Artificial Intelligence and Robotics | Business | Operations Research, Systems Engineering and Industrial Engineering
Intelligent Systems and Decision Analytics
IEEE/WIC/ACM International Conference on Intelligent Agent Technology, 2007: IAT '07: 2-5 November 2007, Fremont, CA: Proceedings
IEEE Computer Society
City or Country
Los Alamitos, CA
LAU, Hoong Chuin; CHENG, Shih-Fen; LEONG, Thin Yin; PARK, Jong Han; and ZHAO, Zhengyi.
Multi-Period Combinatorial Auction Mechanism for Distributed Resource Allocation and Scheduling. (2007). IEEE/WIC/ACM International Conference on Intelligent Agent Technology, 2007: IAT '07: 2-5 November 2007, Fremont, CA: Proceedings. 407-411. Research Collection School Of Information Systems.
Available at: http://ink.library.smu.edu.sg/sis_research/208
Creative Commons License
This work is licensed under a Creative Commons Attribution-Noncommercial-No Derivative Works 4.0 License.