In recent years, a significant research effort has been devoted to the design of distributed protocols for the control of multi-agent systems, as the scale and limited communication bandwidth characteristic of such systems render centralized control impossible. Given the strict operating conditions, it is unlikely that every agent in a multi-agent system will have local information that is consistent with the true system state. Yet, the majority of works in the literature assume that agents share perfect knowledge of their environment. This paper focuses on understanding the impact that inconsistencies in agents' local information can have on the performance of multi-agent systems. More specifically, we consider the design of multi-agent operations under a game theoretic lens where individual agents are assigned utilities that guide their local decision making. We provide a tractable procedure for designing utilities that optimize the efficiency of the resulting collective behavior (i.e., price of anarchy) for classes of set covering games where the extent of the information inconsistencies is known. In the setting where the extent of the informational inconsistencies is not known, we show -- perhaps surprisingly -- that underestimating the level of uncertainty leads to better price of anarchy than overestimating it.
翻译:近年来,在设计多试剂系统控制分布式协议方面投入了大量的研究努力,因为这种系统的规模和有限的通信带宽特点使得无法集中控制。鉴于严格的操作条件,多试剂系统中的每个代理商都不可能拥有符合真实系统状态的当地信息。然而,文献中的大多数著作都假定代理商共享对其环境的完美知识。本文件侧重于了解代理商当地信息不一致可能对多试剂系统性能产生的影响。更具体地说,我们认为,在游戏理论透镜下设计多试剂操作,为个别代理商指定指导其当地决策的公用事业。我们为设计公用事业提供了一种可移植的程序,以优化由此产生的集体行为(即无政府状态价格)的效率,涵盖已知信息不一致程度的各类游戏。在人们不知道信息不一致程度的情况下,我们 -- 可能令人惊讶地表明,低估不确定性的程度导致混乱的代价高于高估无政府状态的价格。