Mission Level Uncertainty in Multi-Agent Resource Allocation

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.

[1]  Utility Design for Distributed Resource Allocation—Part II: Applications to Submodular, Covering, and Supermodular Problems , 2018, IEEE Transactions on Automatic Control.

[2]  Adam Wierman,et al.  Distributed Welfare Games , 2013, Oper. Res..

[3]  Martin Gairing,et al.  Covering Games: Approximation through Non-cooperation , 2009, WINE.

[4]  Jason R. Marden,et al.  Distributed resource allocation through utility design - Part I: optimizing the performance certificates via the price of anarchy , 2018, ArXiv.

[5]  David C. Parkes,et al.  Playing the Wrong Game: Smoothness Bounds for Congestion Games with Behavioral Biases , 2014, PERV.

[6]  Jason R. Marden,et al.  Designing games for distributed optimization with a time varying communication graph , 2012, 2012 IEEE 51st IEEE Conference on Decision and Control (CDC).

[7]  Yide Liu,et al.  Wireless Sensor Network Applications in Smart Grid: Recent Trends and Challenges , 2012, Int. J. Distributed Sens. Networks.

[8]  Robert Murphey,et al.  Target-Based Weapon Target Assignment Problems , 2000 .

[9]  John C. Harsanyi,et al.  Games with Incomplete Information Played by "Bayesian" Players, I-III: Part I. The Basic Model& , 2004, Manag. Sci..

[10]  Christos H. Papadimitriou,et al.  Worst-case Equilibria , 1999, STACS.

[11]  Jason R. Marden,et al.  When Smoothness is Not Enough: Toward Exact Quantification and Optimization of the Price-of-Anarchy , 2019, 2019 IEEE 58th Conference on Decision and Control (CDC).

[12]  Majid Bagheri,et al.  Forest Fire Modeling and Early Detection using Wireless Sensor Networks , 2009, Ad Hoc Sens. Wirel. Networks.

[13]  S. Lakshmivarahan,et al.  Learning in multilevel games with incomplete information. I , 1999, IEEE Trans. Syst. Man Cybern. Part B.

[14]  Martin Weber A Method of Multiattribute Decision Making with Incomplete Information , 1985 .

[15]  Dimitris Bertsimas,et al.  Robust game theory , 2006, Math. Program..

[16]  Anthony Ephremides,et al.  Jamming games in wireless networks with incomplete information , 2011, IEEE Communications Magazine.

[17]  Angelia Nedic,et al.  Distributed optimization over time-varying directed graphs , 2013, 52nd IEEE Conference on Decision and Control.

[18]  Greg Corness,et al.  Perceiving the Light: Exploring Embodied Cues in Interactive Agents for Dance , 2020, MOCO.

[19]  S. Shankar Sastry,et al.  Pursuit-evasion strategies for teams of multiple agents with incomplete information , 2003, 42nd IEEE International Conference on Decision and Control (IEEE Cat. No.03CH37475).