This paper addresses a multi-agent scheduling problem with uniform parallel machines owned by a resource agent and competing jobs with dynamic arrival times that belong to different consumer agents. All agents are self-interested and rational with the aim of maximizing their own objectives, resulting in intense resource competition among consumer agents and strategic behaviors of unwillingness to disclose private information. Within the context, a centralized scheduling approach is unfeasible, and a decentralized approach is considered to deal with the targeted problem. This study aims to generate a stable and collaborative solution with high social welfare while simultaneously accommodating consumer agents’ preferences under incomplete information. For this purpose, a dynamic iterative auction-based approach based on a decentralized decision-making procedure is developed. In the proposed approach, a dynamic auction procedure is established for dynamic jobs participating in a real-time auction, and a straightforward and easy-to-implement bidding strategy without price is presented to reduce the complexity of bid determination. In addition, an adaptive Hungarian algorithm is applied to solve the winner determination problem efficiently. A theoretical analysis is conducted to prove that the proposed approach is individually rational and that the myopic bidding strategy is a weakly dominant strategy for consumer agents submitting bids. Extensive computational experiments demonstrate that the developed approach achieves high-quality solutions and exhibits considerable stability on large-scale problems with numerous consumer agents and jobs. A further multi-agent scheduling problem considering multiple resource agents will be studied in future work.

中文翻译：

---

一种基于拍卖的动态作业到达多智能体统一并行机器调度方法

本文解决了多代理调度问题，其中资源代理拥有统一的并行机器，并且属于不同消费者代理的具有动态到达时间的竞争作业。各主体均以自身利益最大化为目的，理性理性，导致消费主体之间资源竞争激烈，不愿透露私人信息的策略行为。在这种情况下，集中式调度方法是不可行的，需要考虑采用分散式方法来处理目标问题。本研究旨在生成具有高社会福利的稳定且协作的解决方案，同时适应不完整信息下消费者代理的偏好。为此，开发了一种基于分散决策程序的动态迭代拍卖方法。在所提出的方法中，为参与实时拍卖的动态作业建立了动态​​拍卖程序，并提出了直接且易于实施的无价格投标策略，以降低投标确定的复杂性。此外，应用自适应匈牙利算法来有效解决获胜者确定问题。理论分析证明了所提出的方法是个体理性的，并且短视投标策略对于提交投标的消费者代理来说是一种弱占优策略。大量的计算实验表明，所开发的方法可以实现高质量的解决方案，并且在涉及大量消费者代理和工作的大规模问题上表现出相当大的稳定性。在未来的工作中将研究考虑多个资源代理的进一步多代理调度问题。