具有字典序偏好的多智能体系统中的稳定任务分配
Stable Task Allocation in Multi-Agent Systems with Lexicographic Preferences
AI总结:
本文研究多智能体一对多稳定任务分配,证明在字典序偏好下稳定性等价于无阻塞智能体—任务对,并利用图形表示将稳定匹配空间编码为二元线性约束,支持最优性定义与替代性分析。
摘要:
受现代数字经济中对显式表示和处理各种“偏好”结构日益增长的兴趣所推动,本工作引入了一类新的“一对多稳定匹配”问题,其中一组原子任务必须被稳定地分配给一组智能体。这些稳定匹配问题的一个重要特征是,构成每个智能体“可行”分配的任务子集具有非常任意的设定。研究表明,只要智能体根据其对每个原子任务所陈述的偏好,以字典序方式对其可行任务分配进行排序,匹配稳定性就可归结为不存在阻塞的智能体—任务对。该结果连同对可行分配的恰当图形表示,使得:(i)能够将稳定匹配空间表示为一组含二元变量的线性约束;以及(ii)能够在该稳定匹配空间内设定和处理某些最优性概念。论文最后一部分还讨论了所考虑问题情境中的“替代性”概念。
英文摘要:
Motivated by the increasing interest in the explicit representation and handling of various "preference" structures arising in modern digital economy, this work introduces a new class of "one-to-many stable-matching" problems where a set of atomic tasks must be stably allocated to a set of agents. An important characteristic of these stable-matching problems is the very arbitrary specification of the task subsets constituting "feasible" allocations for each agent. It is shown that as long as the agents rank their feasible task allocations lexicographically with respect to their stated preferences for each atomic task, matching stability reduces to the absence of blocking agent-task pairs. This result, together with a pertinent graphical representation of feasible allocations, enable (i) the representation of the space of stable matchings as a set of linear constraints with binary variables, and (ii) the specification and handling of certain notions of optimality within this space of stable matchings. The last part of the paper also addresses the notion of "substitutability" in the considered problem context.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。