Design Tradeoffs in Concave Cost-Sharing Games

@article{Phillips2018DesignTI,
  title={Design Tradeoffs in Concave Cost-Sharing Games},
  author={Matthew Phillips and Jason R. Marden},
  journal={IEEE Transactions on Automatic Control},
  year={2018},
  volume={63},
  pages={2242-2247}
}
This note focuses on the design of cost-sharing rules to optimize the efficiency of the resulting equilibria in cost-sharing games with concave cost functions. Our analysis focuses on two well-studied measures of efficiency, termed the price of anarchy and price of stability, which provide worst-case guarantees on the performance of the (worst or best) equilibria. Our first result characterizes the cost-sharing design that optimizes the price of anarchy, followed by the price of stability. This… Expand
Optimal Price of Anarchy in Cost-Sharing Games
TLDR
This paper considers a class of combinatorial cost-minimization problems and proposes a framework for designing distributed algorithms with a priori performance guarantees that are near-optimal, and investigates the implications when this framework is applied to systems with convex, nondecreasing costs. Expand
Distributed resource allocation through utility design - Part I: optimizing the performance certificates via the price of anarchy
TLDR
A novel framework to characterize and optimize the worst case performance (price of anarchy) of any resulting equilibrium as a function of the chosen utilities, thus providing a performance certificate for a large class of algorithms. Expand
Utility Design for Distributed Resource Allocation—Part I: Characterizing and Optimizing the Exact Price of Anarchy
TLDR
This article develops a novel framework to tightly characterize the worst-case performance of any resulting Nash equilibrium (price of anarchy) as a function of the chosen agents’ utility functions and identifies how to design such utilities so as to optimize the price of anarchy through a tractable linear program. Expand
Distributed resource allocation through utility design - Part II: applications to submodular, supermodular and set covering problems
TLDR
The purpose of the present manuscript is to specialize the general results obtained in Part I to a class of monotone submodular, supermodular and set covering problems, and show how any distributed algorithm capable of computing a Nash equilibrium inherits a performance certificate matching the well known 1-1/e approximation of Nemhauser. Expand
Distributed control and game design: From strategic agents to programmable machines
TLDR
A novel framework is introduced that allows to characterize and optimize the system performance as a function of the chosen utilities by means of a tractable linear program to solve large scale systems without the need of a centralized authority. Expand
Darknet Traffic Big-Data Analysis and Network Management to Real-Time Automating the Malicious Intent Detection Process by a Weight Agnostic Neural Networks Framework
TLDR
A novel darknet traffic analysis and network management framework to real-time automating the malicious intent detection process, using a weight agnostic neural networks architecture, and an automated searching neural net architecture strategy that can perform various tasks such as identifying zero-day attacks. Expand
A Blockchain-Based Approach for Collaborative Formalization of Mathematics and Programs
Formalization of mathematics is the process of digitizing mathematical knowledge, which allows for formal proof verification as well as efficient semantic searches. Given the large andExpand
Utility Design for Distributed Resource Allocation – Part II: Applications to Submodular, Covering, and Supermodular Problems
TLDR
The purpose of the present manuscript is to specialize results to the case of submodular, covering, and supermodular problems, and obtain tight expressions for the price of anarchy that often match or improve the guarantees associated to state-of-the-art approximation algorithms. Expand

References

SHOWING 1-10 OF 23 REFERENCES
Optimizing the price of anarchy in concave cost sharing games
TLDR
The main result of this paper is a characterization of the optimal local agent objective functions for concave cost sharing games, and it is demonstrated that the Shapley value objective function is the unique local and anonymous agent objective function that achieves the minimum price of anarchy. Expand
Optimal Cost-Sharing in General Resource Selection Games
TLDR
It is proved that, in this natural design space, the cost-sharing method induced by the Shapley value minimizes the worst-case inefficiency of equilibria. Expand
Designing networks with good equilibria
TLDR
This work provides a complete characterization of the uniform cost-sharing protocols---protocols that are designed without foreknowledge of or assumptions on the network in which they will be deployed, and identifies the optimal uniform protocol in several scenarios. Expand
Generalized Efficiency Bounds in Distributed Resource Allocation
TLDR
The relationship between the Shapley value utility design and the resulting efficiency of both pure Nash equilibria and coarse correlatedEquilibria is explored and a bicriteria bound is derived for this class of resource allocation problems-a bound on thevalue of the optimal allocation relative to the value of an equilibrium allocation with additional agents. Expand
Intrinsic Robustness of the Price of Anarchy
TLDR
This work identifies a “canonical sufficient condition” for an upper bound on the price of anarchy of pure Nash equilibria, and proves that in congestion games, smoothness arguments are “complete” in a proof-theoretic sense: despite their automatic generality, they are guaranteed to produce optimal worst-case upper bounds on thePrice of anarchy. Expand
The importance of budget in efficient utility design
TLDR
This paper focuses on the recently introduced concept of smoothness and provides a characterization of how a budget anomaly impacts the efficiency of the resulting Nash equilibria, and proposes a new methodology for utility design that is accompanied by automatic efficiency guarantees. Expand
Covering Games: Approximation through Non-cooperation
TLDR
It is proved that any sequence of unilateral improving steps is polynomially bounded and gives rise to a polynomial-time local search approximation algorithm whose approximation ratio is best possible. Expand
Nash equilibria in competitive societies, with applications to facility location, traffic routing and auctions
  • A. Vetta
  • Computer Science
  • The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings.
  • 2002
TLDR
This work presents guarantees on the social performance of Nash equilibria on the basis of competitive versions of the facility location problem and k-median problem, a maximisation version of the traffic routing problem studied by Roughgarden and Tardos (2000), and multiple-item auctions. Expand
Distributed Welfare Games
TLDR
This paper identifies several utility design methodologies that guarantee desirable game properties irrespective of the specific application domain and illustrates the results on two commonly studied classes of resource allocation problems: “coverage’ problems and “coloring” problems. Expand
The Price of Selfishness in Network Coding
TLDR
The investigation focuses on the performance of stable solutions, where a stable solution is one in which no single unicast can improve its individual cost by changing its route, and concludes that worst-case stable performance cannot be improved using cost-sharing protocols that are independent of the network structure. Expand
...
1
2
3
...