基于利他行为的加权匹配算法
Anytime Heuristic for Weighted Matching Through Altruism-Inspired Behavior
摘要:
我们提出了一种新的任何时候启发式(ALMA),灵感来自人类的利他主义原则,解决分配问题。ALMA是去中心化的,完全解耦的,不需要参与者之间的通信。我们证明了一个上界的收敛速度,这是多项式在所需的资源和竞争代理每资源的数量;至关重要的是,在现实的情况下,上述数量的有界独立的代理/资源的总数,收敛时间保持不变的总问题的大小增加。我们已经评估了ALMA下三个测试用例:(一)一个反协调的情况下,具有类似偏好的代理竞争相同的一组动作,(二)在城市环境中的资源分配的情况下,在一个恒定的时间约束,最后,(三)一个在线匹配的情况下,使用真正的出租车出租车数据。在所有的情况下,ALMA都能够达到高社会福利,同时比集中式最优算法快几个数量级。后者允许我们的算法扩展到具有数十万代理的现实场景,例如,城市环境中的车辆协调。
英文摘要:
We present a novel anytime heuristic (ALMA), inspired by the human principle of altruism, for solving the assignment problem. ALMA is decentralized, completely uncoupled, and requires no communication between the participants. We prove an upper bound on the convergence speed that is polynomial in the desired number of resources and competing agents per resource; crucially, in the realistic case where the aforementioned quantities are bounded independently of the total number of agents/resources, the convergence time remains constant as the total problem size increases. We have evaluated ALMA under three test cases: (i) an anti-coordination scenario where agents with similar preferences compete over the same set of actions, (ii) a resource allocation scenario in an urban environment, under a constant-time constraint, and finally, (iii) an on-line matching scenario using real passenger-taxi data. In all of the cases, ALMA was able to reach high social welfare, while being orders of magnitude faster than the centralized, optimal algorithm. The latter allows our algorithm to scale to realistic scenarios with hundreds of thousands of agents, e.g., vehicle coordination in urban environments.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。