Distributed Mechanism Design for Multicast Transmission
Distributed Mechanism Design for Multicast Transmission
复制标题
组播传输的分布式机制设计
DOI：
10.1109/cdc.2018.8618979
复制
发表时间：
2018
期刊：
影响因子：
--
通讯作者：
A. Anastasopoulos
中科院分区：
文献类型：
--
作者：
Nasimeh Heydaribeni;A. Anastasopoulos
在标准的机制设计框架(Hurwicz-Reiter[1])中，有一个中央权威机构，负责收集代理人的信息，并随后确定每个代理人的分配和税收。我们考虑这样一种情况，其中由于通信开销和其他限制，这种向中央机构的消息广播不能发生。相反，代理之间只允许本地消息交换。因此，每个代理应该能够基于本地邻居中的消息确定她自己的分配和税收，正如描述通信约束的给定消息图所定义的那样。这种情况催生了一个新的研究方向，我们称之为“分布式机制设计”。本文针对组播传输网络中的速率分配问题，提出了这样一种分布式机制。该机制充分实现了纳什均衡下的最优分配，其消息空间维度与网络中代理的个数呈线性关系。
In the standard Mechanism Design framework (Hurwicz-Reiter[1]), there is a central authority that gathers agents' messages and subsequently determines the allocation and tax for each agent. We consider a scenario where, due to communication overhead and other constraints, such broadcasting of messages to a central authority cannot take place. Instead, only local message exchange is allowed between agents. As a result, each agent should be able to determine her own allocation and tax based on the messages in the local neighborhood, as defined by a given message graph describing the communication constraints. This scenario gives rise to a novel research direction that we call “Distributed Mechanism Design”. In this paper, we propose such a distributed mechanism for the problem of rate allocation in a multicast transmission network. The proposed mechanism fully implements the optimal allocation in Nash equilibria and its message space dimension is linear with respect to the number of agents in the network.