Price of anarchy for parallel link networks with generalized mean objective
From MaRDI portal
Publication:6103184
DOI10.1007/s00291-022-00696-7zbMath1519.91052OpenAlexW4309923055MaRDI QIDQ6103184
Publication date: 26 June 2023
Published in: OR Spectrum (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00291-022-00696-7
Games involving graphs (91A43) Games with infinitely many players (91A07) Potential and congestion games (91A14)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Worst-case equilibria
- On the performance of approximate equilibria in congestion games
- Tight bounds for selfish and greedy load balancing
- Path deviations outperform approximate stability in heterogeneous congestion games
- The price of anarchy for polynomial social cost
- Nash equilibria in discrete routing games with convex latency functions
- Congestion games with linearly independent paths: convergence time and price of anarchy
- Tight inefficiency bounds for perception-parameterized affine congestion games
- The impact of worst-case deviations in non-atomic network routing games
- Price of anarchy for highly congested routing games in parallel networks
- Toll caps in privatized road networks
- Price of anarchy in congestion games with altruistic/spiteful players
- Computation and efficiency of potential function minimizers of combinatorial congestion games
- The online best reply algorithm for resource allocation problems
- A class of games possessing pure-strategy Nash equilibria
- A Mean-Risk Model for the Traffic Assignment Problem with Stochastic Travel Times
- Tight bounds for worst-case equilibria
- The Bargaining Problem
- Efficiency of Restricted Tolls in Non-atomic Network Routing Games
- Exact Price of Anarchy for Polynomial Congestion Games
- Intrinsic Robustness of the Price of Anarchy
- Taxes for linear atomic congestion games
- How bad is selfish routing?
- The Price of Stability for Network Design with Fair Cost Allocation
- Improving Selfish Routing for Risk-Averse Players
- The price of anarchy of finite congestion games
- Inefficiency of Nash Equilibria
- Routing Games in the Wild: Efficiency, Equilibration and Regret
- Risk-Averse Selfish Routing
- The Price of Stability of Weighted Congestion Games
- Selfish Routing in Capacitated Networks
- The price of anarchy is independent of the network topology
This page was built for publication: Price of anarchy for parallel link networks with generalized mean objective