Nonatomic Non-Cooperative Neighbourhood Balancing Games

03/15/2023
by   David Auger, et al.
0

We introduce a game where players selfishly choose a resource and endure a cost depending on the number of players choosing nearby resources. We model the influences among resources by a weighted graph, directed or not. These games are generalizations of well-known games like Wardrop and congestion games. We study the conditions of equilibria existence and their efficiency if they exist. We conclude with studies of games whose influences among resources can be modelled by simple graphs.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/28/2020

Dynamic network congestion games

Congestion games are a classical type of games studied in game theory, i...
research
04/17/2018

A Capacity-Price Game for Uncertain Renewables Resources

Renewable resources are starting to constitute a growing portion of the ...
research
07/17/2020

Pure Nash Equilibria in Resource Graph Games

This paper studies the existence of pure Nash equilibria in resource gra...
research
04/24/2018

Parallel computing as a congestion game

Game-theoretical approach to the analysis of parallel algorithms is prop...
research
02/21/2018

Playing with Repetitions in Data Words Using Energy Games

We introduce two-player games which build words over infinite alphabets,...
research
02/24/2022

The Impact of Selfish Behavior in Load Balancing Games

To what extent does the structure of the players' strategy space influen...
research
04/19/2018

The Curse of Ties in Congestion Games with Limited Lookahead

We introduce a novel framework to model limited lookahead in congestion ...

Please sign up or login with your details

Forgot password? Click here to reset