A Unifying Approximate Potential for Weighted Congestion Games

05/20/2020
by   Yiannis Giannakopoulos, et al.
0

We provide a unifying, black-box tool for establishing existence of approximate equilibria in weighted congestion games and, at the same time, bounding their Price of Stability. Our framework can handle resources with general costs–including, in particular, decreasing ones–and is formulated in terms of a set of parameters which are determined via elementary analytic properties of the cost functions. We demonstrate the power of our tool by applying it to recover the recent result of Caragiannis and Fanelli [ICALP'19] for polynomial congestion games; improve upon the bounds for fair cost sharing games by Chen and Roughgarden [Theory Comput. Syst., 2009]; and derive new bounds for nondecreasing concave costs. An interesting feature of our framework is that it can be readily applied to mixtures of different families of cost functions; for example, we provide bounds for games whose resources are conical combinations of polynomial and concave costs. In the core of our analysis lies the use of a unifying approximate potential function which is simple and general enough to be applicable to arbitrary congestion games, but at the same time powerful enough to produce state-of-the-art bounds across a range of different cost functions.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/27/2018

The Price of Stability of Weighted Congestion Games

We give exponential lower bounds on the Price of Stability (PoS) of weig...
research
06/18/2023

A Smoothed FPTAS for Equilibria in Congestion Games

We present a fully polynomial-time approximation scheme (FPTAS) for comp...
research
02/18/2020

Existence and Complexity of Approximate Equilibria in Weighted Congestion Games

We study the existence of approximate pure Nash equilibria (α-PNE) in we...
research
07/30/2020

Improving approximate pure Nash equilibria in congestion games

Congestion games constitute an important class of games to model resourc...
research
05/20/2018

Selfishness need not be bad: a general proof

This article studies the user behavior in non-atomic congestion games. W...
research
07/07/2020

Resource-Aware Protocols for Network Cost-Sharing Games

We study the extent to which decentralized cost-sharing protocols can ac...
research
04/12/2022

Avoiding Unintended Consequences: How Incentives Aid Information Provisioning in Bayesian Congestion Games

When users lack specific knowledge of various system parameters, their u...

Please sign up or login with your details

Forgot password? Click here to reset