Balancing Asymptotic and Transient Efficiency Guarantees in Set Covering Games

06/08/2021
by   Rohit Konda, et al.
0

Game theoretic approaches have gained traction as a robust methodology for designing distributed local algorithms that induce a desired overall system configuration in a multi-agent setting. However, much of the emphasis in these approaches is on providing asymptotic guarantees on the performance of 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 game-theoretic design can perform arbitrarily bad in the transient.

READ FULL TEXT

page 1

page 2

page 3

page 4

06/08/2021

Mission Level Uncertainty in Multi-Agent Resource Allocation

In recent years, a significant research effort has been devoted to the d...
09/15/2022

Valid Utility Games with Information Sharing Constraints

The use of game theoretic methods for control in multiagent systems has ...
07/03/2018

Distributed resource allocation through utility design - Part II: applications to submodular, supermodular and set covering problems

A fundamental component of the game theoretic approach to distributed co...
09/24/2019

Asynchronous and time-varying proximal type dynamics multi-agent network games

In this paper, we study proximal type dynamics in the context of noncoop...
09/13/2018

Simulation-based Distributed Coordination Maximization over Networks

In various online/offline multi-agent networked environments, it is very...
02/26/2020

Corrupted Multidimensional Binary Search: Learning in the Presence of Irrational Agents

Standard game-theoretic formulations for settings like contextual pricin...
06/08/2018

Ergodic Mean-Payoff Games for the Analysis of Attacks in Crypto-Currencies

Crypto-currencies are digital assets designed to work as a medium of exc...