AI Chat AI Image Generator AI Video Text to Speech

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

07/28/2020

∙

by Zijun Wu, et al.

∙

∙

This paper provides a comprehensive convergence analysis of the PoA of both pure and mixed Nash equilibria in atomic congestion games with unsplittable demands.

Zijun Wu
10 publications
Rolf H. Moehring
1 publication
Chunying Ren
1 publication
Dachuan Xu
11 publications

page 1

page 2

page 3

page 4

research

∙ 07/28/2020

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

This paper shows that the PoA in non-atomic congestion games is Hölder c...

0 Zijun Wu, et al. ∙

research

∙ 01/09/2020

Convergence of Large Atomic Congestion Games

We study the convergence of sequences of atomic unsplittable congestion ...

0 Roberto Cominetti, et al. ∙

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); ...

0 Shinsaku Sakaue, et al. ∙

research

∙ 05/20/2018

Selfishness need not be bad: a general proof

This article studies the user behavior in non-atomic congestion games. W...

0 Zijun Wu, et al. ∙

research

∙ 11/20/2018

Parametrized Nash Equilibria in Atomic Splittable Congestion Games via Weighted Block Laplacians

We consider atomic splittable congestion games with affine cost function...

0 Max Klimm, et al. ∙

research

∙ 11/12/2021

Learning Pure Nash Equilibrium in Smart Charging Games

Reinforcement Learning Algorithms (RLA) are useful machine learning tool...

0 Benoît Sohet, et al. ∙

research

∙ 06/24/2019

The Minimum Tollbooth Problem in Atomic Network Congestion Games with Unsplittable Flows

This work analyzes the minimum tollbooth problem in atomic network conge...

0 Julian Nickerl, et al. ∙