On approximate pure Nash equilibria in weighted congestion games with polynomial latencies

02/19/2019
by   Ioannis Caragiannis, et al.
0

We consider the problem of the existence of natural improvement dynamics leading to approximate pure Nash equilibria, with a reasonable small approximation, and the problem of bounding the efficiency of such equilibria in the fundamental framework of weighted congestion game with polynomial latencies of degree at most ≥̣ 1. In this work, by exploiting a simple technique, we firstly show that the game always admits a -approximate potential function. This implies that every sequence of -approximate improvement moves by the players always leads the game to a -approximate pure Nash equilibrium. As a corollary, we also obtain that, under mild assumptions on the structure of the players' strategies, the game always admits a constant approximate potential function. Secondly, by using a simple potential function argument, we are able to show that in the game there always exists a (+̣δ)-approximate pure Nash equilibrium, with δ∈ [0,1], whose cost is 2/(1+δ) times the cost of any optimal state.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/24/2022

1-ε-approximate pure Nash equilibria algorithms for weighted congestion games and their runtimes

This paper concerns computing approximate pure Nash equilibria in weight...
research
08/15/2020

Nash equilibrium structure of Cox process Hotelling games

We study an N-player game where a pure action of each player is to selec...
research
11/08/2022

Computing better approximate pure Nash equilibria in cut games via semidefinite programming

Cut games are among the most fundamental strategic games in algorithmic ...
research
12/14/2021

Multi-Leader Congestion Games with an Adversary

We study a multi-leader single-follower congestion game where multiple u...
research
10/15/2019

Approximate Equilibria in Non-constant-sum Colonel Blotto and Lottery Blotto Games with Large Numbers of Battlefields

In the Colonel Blotto game, two players with a fixed budget simultaneous...
research
02/25/2021

A Fragile multi-CPR Game

A Fragile CPR Game is an instance of a resource sharing game where a com...
research
02/05/2023

A Game-Theoretic Approach to Solving the Roman Domination Problem

The Roamn domination problem is one important combinatorial optimization...

Please sign up or login with your details

Forgot password? Click here to reset