分布式个人与活动匹配算法
Distributed Algorithm for Matching between Individuals and Activities
摘要:
在本文中,我们介绍了一个基于Agent的联盟形成模型,这是适合我们的用例。我们在这里提出两个交换所机制,返回声音匹配。第一个目标是最大限度地提高个人的整体满意度。第二种是确保所有人都尽可能多地被分配到一个首选的活动。我们的实验表明,我们的算法的结果是更好的比那些与经典的搜索/优化技术。此外,它们的分布加快了它们的运行速度。
英文摘要:
In this paper, we introduce an agent-based model for coalition formation which is suitable for our usecase. We propose here two clearing-houses mechanisms that return sound matchings. The first aims at maximizing the global satisfaction of the individuals. The second ensures that all individuals are assigned as much as possible to a preferred activity. Our experiments show that the outcome of our algorithms are better than those obtained with the classical search/optimization techniques. Moreover, their distribution speeds up their runtime.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。