Mechanism design and communication networks
研究了在通信网络中，玩家与设计者作为节点时，哪些网络结构能保证任何激励相容的社会选择函数都可部分实施，发现强连通且弱2连通网络是关键。
This paper studies a mechanism design model where the players and the designer are nodes in a communication network. We characterize the communication networks (directed graphs) for which, in any environment (utilities and beliefs), every incentive compatible social choice function is partially implementable. We show that any incentive compatible social choice function is implementable on a given communication network, in all environments with either common independent beliefs and private values or a worst outcome, if and only if the network is strongly connected and weakly 2-connected. A network is strongly connected if for each player, there exists a directed path to the designer. It is weakly 2-connected if each player is either directly connected to the designer or indirectly connected to the designer through two disjoint paths, not necessarily directed. We couple encryption techniques together with appropriate incentives to secure the transmission of each player’s private information to the designer.