A sensitivity analysis for the price of anarchy in non-atomic congestion games

07/28/2020
by   Zijun Wu, et al.
0

This paper shows that the PoA in non-atomic congestion games is Hölder continuous w.r.t. combined disturbance on cost functions and demands. We then apply this result to the convergence analysis of the PoA.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/28/2020

A convergence analysis of the price of anarchy in atomic congestion games

This paper provides a comprehensive convergence analysis of the PoA of b...
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/10/2020

Partial Altruism is Worse than Complete Selfishness in Nonatomic Congestion Games

We seek to understand the fundamental mathematics governing infrastructu...
research
09/09/2019

Sensitivity Analysis for Markov Decision Process Congestion Games

We consider a non-atomic congestion game where each decision maker perfo...
research
11/25/2022

When Congestion Games Meet Mobile Crowdsourcing: Selective Information Disclosure

In congestion games, users make myopic routing decisions to jam each oth...
research
10/05/2021

Differentiable Equilibrium Computation with Decision Diagrams for Stackelberg Models of Combinatorial Congestion Games

We address Stackelberg models of combinatorial congestion games (CCGs); ...
research
01/22/2020

Fine-grained Analysis on Fast Implementations of Multi-writer Atomic Registers

This draft in its current version proves an impossibility result concern...

Please sign up or login with your details

Forgot password? Click here to reset