Conference Proceeding Article
This paper is concerned with solving decentralized resource allocation and scheduling problems via auctions with negotiable agents by allowing agents to switch their bid generation strategies within the auction process, such that a better system wide performance is achieved on average as compared to the conventional walrasian auction running with agents of fixed bid generation strategy. We propose a negotiation mechanism embedded in auctioneer to solicit bidders’ change of strategies in the process of auction. Finally we benchmark our approach against conventional auctions subject to the real-time large-scale dynamic resource coordination problem to demonstrate the effectiveness of our approach.
Negotiable agents, Decentralized resource allocation, Scheduling, Walrasian auction
Artificial Intelligence and Robotics | Operations Research, Systems Engineering and Industrial Engineering
Intelligent Systems and Decision Analytics
IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology WI-IAT 2010: 31 August-3 September 2010, Toronto: Proceedings
IEEE Computer Society
City or Country
Los Alamitos, CA
CHEN, Huaxing and LAU, Hoong Chuin.
Decentralized Resource Allocation and Scheduling via Walrasian Auctions with Negotiable Agents. (2010). IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology WI-IAT 2010: 31 August-3 September 2010, Toronto: Proceedings. 356-360. Research Collection School Of Information Systems.
Available at: http://ink.library.smu.edu.sg/sis_research/1014
Creative Commons License
This work is licensed under a Creative Commons Attribution-Noncommercial-No Derivative Works 4.0 License.