Balancing Asymptotic and Transient Efficiency Guarantees in Set Covering Games

Game theoretic approaches have gained traction as robust methodologies for designing distributed local algorithms that induce a desired overall system configuration in multi-agent settings. However, much of the emphasis in these approaches is on providing asymptotic guarantees on the performance of a network of agents, and there is a gap in the study of efficiency guarantees along transients of these distributed algorithms. Therefore, in this paper, we study the transient efficiency guarantees of a natural game-theoretic algorithm in the class of set covering games, which have been used to model a variety of applications. Our main results characterize the optimal utility design that maximizes the guaranteed efficiency along the transient of the natural dynamics. Furthermore, we characterize the Pareto-optimal frontier with regards to guaranteed efficiency in the transient and the asymptote under a class of game-theoretic designs. Surprisingly, we show that there exists an extreme trade-off between the long-term and short-term guarantees in that an asymptotically optimal gametheoretic design can perform arbitrarily bad in the transient.

[1]  H. Young,et al.  The Evolution of Conventions , 1993 .

[2]  Adrian Vetta,et al.  Nash equilibria in competitive societies, with applications to facility location, traffic routing and auctions , 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..

[3]  Shreyas Sundaram,et al.  Game-Theoretic Vaccination Against Networked SIS Epidemics and Impacts of Human Decision-Making , 2017, IEEE Transactions on Control of Network Systems.

[4]  Jason R. Marden,et al.  Game Theory and Distributed Control , 2015 .

[5]  Sonia Mandal,et al.  Covering problem on fuzzy graphs and its application in disaster management system , 2020 .

[6]  Jeffrey Nash.  Optimal allocation of tracking resources , 1977, 1977 IEEE Conference on Decision and Control including the 16th Symposium on Adaptive Processes and A Special Symposium on Fuzzy Set Theory and Applications.

[7]  Nicanor Quijano,et al.  Decentralized Charging Coordination of Electric Vehicles using Multi-Population Games , 2020, 2020 59th IEEE Conference on Decision and Control (CDC).

[8]  Vittorio Bilò,et al.  Performances of One-Round Walks in Linear Congestion Games , 2009, SAGT.

[9]  Angelo Fanelli,et al.  The speed of convergence in congestion games under best-response dynamics , 2008, TALG.

[10]  Antonio Barrientos,et al.  Should We Compete or Should We Cooperate? Applying Game Theory to Task Allocation in Drone Swarms , 2018, 2018 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS).

[11]  D. M. V. Hesteren.  Evolutionary Game Theory , 2017 .

[12]  J. Nash.  Equilibrium Points in N-Person Games. , 1950, Proceedings of the National Academy of Sciences of the United States of America.

[13]  Vahab S. Mirrokni,et al.  Sink equilibria and convergence , 2005, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05).

[14]  Vahab S. Mirrokni,et al.  Convergence and approximation in potential games , 2006, Theor. Comput. Sci..

[15]  Jason R. Marden,et al.  Characterizing the interplay between information and strength in Blotto games , 2019, 2019 IEEE 58th Conference on Decision and Control (CDC).

[16]  Ali Jadbabaie,et al.  Information Disclosure and Network Formation in News Subscription Services , 2020, 2020 59th IEEE Conference on Decision and Control (CDC).

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

[18]  L. Shapley,et al.  Potential Games , 1994 .

[19]  Wolfgang Maass,et al.  Approximation schemes for covering and packing problems in image processing and VLSI , 1985, JACM.

[20]  Vahab S. Mirrokni,et al.  Convergence Issues in Competitive Games , 2004, APPROX-RANDOM.

[21]  Vijay Kumar,et al.  Perimeter-defense Game between Aerial Defender and Ground Intruder , 2020, 2020 59th IEEE Conference on Decision and Control (CDC).

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

[23]  Vittorio Bilò,et al.  A Unifying Tool for Bounding the Quality of Non-Cooperative Solutions in Weighted Congestion Games , 2011, Theory of Computing Systems.

[24]  Yu-Chee Tseng,et al.  The Coverage Problem in a Wireless Sensor Network , 2003, WSNA '03.

[25]  Jason R. Marden,et al.  Multiagent Maximum Coverage Problems: The Trade-off Between Anarchy and Stability , 2019, 2019 18th European Control Conference (ECC).