收敛到 $B$-匹配核心的分布式学习动态
Distributed Learning Dynamics Converging to the Core of $B$-Matchings
AI总结:
本文研究二部 $B$-匹配的核心求解,提出多项式时间集中式动态和仅依赖局部期望与匹配状态、以概率 1 收敛的分布式学习动态。
摘要:
$B$-匹配是匹配问题的一种特殊情形,其中节点可以加入多个匹配,而每个节点的度受到一个上界(即该节点的 $B$ 值)约束。二部 $B$-匹配的核心解既是节点之间满足上界约束的一种匹配,也是边权在节点之间的一种分配,使得任何节点群体都无法偏离并集体获得更高分配。我们提出两种收敛到二部 $B$-匹配问题核心的学习动态。第一种是具有 Hungarian 方法性质的集中式动态,可在多项式时间内收敛到核心。第二种是分布式动态,以概率 1 收敛到核心。对于分布式动态,一个节点仅维护由以下两部分组成的状态:(i)其所有可能匹配对象的期望水平,以及(ii)它所属的匹配(如果存在)。节点不记录自身历史,也不知道环境状态。在每个阶段,一个被随机激活的节点提议形成新的匹配,并根据其提议成功或失败改变自身期望。在此阶段,提议节点询问其希望匹配的节点的期望,以计算该匹配的可行性。每当提议成功时,环境匹配结构就会改变。对于该分布式动态而言,一个状态是吸收态,当且仅当它处于 $B$-匹配的核心中。
英文摘要:
$B$-Matching is a special case of matching problems where nodes can join multiple matchings with the degree of each node constrained by an upper bound, the node's $B$-value. The core solution of a bipartite $B$-matching is both a matching between the nodes respecting the upper bound constraint and an allocation of the weights of the edges among the nodes such that no group of nodes can deviate and collectively gain higher allocation. We present two learning dynamics that converge to the core of the bipartite $B$-matching problems. The first dynamics are centralized dynamics in the nature of the Hungarian method, which converge to the core in a polynomial time. The second dynamics are distributed dynamics, which converge to the core with probability one. For the distributed dynamics, a node maintains only a state consisting of (i) the aspiration levels for all of its possible matches and (ii) the matches, if any, to which it belongs. The node does not keep track of its history nor is it aware of the environment state. In each stage, a randomly activated node proposes to form a new match and changes its aspiration based on the success or failure of its proposal. At this stage, the proposing node inquires about the aspiration of the node it wants to match with to calculate the feasibility of the match. The environment matching structure changes whenever a proposal succeeds. A state is absorbing for the distributed dynamics if and only if it is in the core of the $B$-matching.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。