An iterative combinatorial auction mechanism for multi-agent parallel machine scheduling
An iterative combinatorial auction mechanism for multi-agent parallel machine scheduling
复制标题
DOI：
10.1080/00207543.2021.1950938
复制
发表时间：
2021-07
影响因子：
9.2
通讯作者：
Yaqiong Liu;Shudong Sun;X. Wang;Lihui Wang
中科院分区：
文献类型：
--
作者：
Yaqiong Liu;Shudong Sun;X. Wang;Lihui Wang
本文主要研究具有消费者代理和资源代理的多代理并行机调度问题。在这种情况下，所有代理都是以利润最大化为目的的利己主义，并且拥有私人信息，无法使用需要所有消费者代理完整信息的中心化调度方法。因此，提出了一种基于去中心化决策过程的迭代组合拍卖机制，以在不侵犯信息隐私的情况下生成协作调度方案。该方法采用灵活的竞价策略来减少资源分配的冲突，并制定了混合拍卖终止条件以确保方法的收敛性，同时保证代理之间的充分竞争。实验结果表明，与集中式方法相比，所开发的方法可以以较小的无政府状态生成高质量的解决方案，并且在改善社会福利方面优于最先进的分散式调度方法，特别是对于大量消费者代理的问题。
This paper focuses on the multi-agent parallel machines scheduling problem with consumer agents and resource agents. Within the context, all the agents are self-interested aiming at maximising their profits, and have private information, precluding the use of the centralised scheduling approaches that require complete information of all the consumer agents. Therefore, an iterative combinatorial auction mechanism based on a decentralised decision procedure is proposed to generate a collaborative scheduling scheme without violating information privacy. The developed approach adopts flexible bidding strategies to reduce the conflict in resource allocation, and a hybrid auction termination condition is developed to ensure the convergence of the approach while guaranteeing sufficient competition among agents. Experimental results show the developed approach generates high-quality solutions with a small price of anarchy compared with centralised approaches and outperforms the state-of-the-art decentralised scheduling approach in improving social welfare, especially for problems with a large number of consumer agents.