Bounding the inefficiency of equilibria in nonatomic congestion games
From MaRDI portal
Publication:1885439
DOI10.1016/j.geb.2003.06.004zbMath1068.91002OpenAlexW2077787105MaRDI QIDQ1885439
Publication date: 28 October 2004
Published in: Games and Economic Behavior (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.geb.2003.06.004
Related Items (65)
Bottleneck Congestion Games with Logarithmic Price of Anarchy ⋮ Atomic routing games on maximum congestion ⋮ Adaptive routing with stale information ⋮ Robust perfect equilibrium in large games ⋮ Pricing of fluctuations in electricity markets ⋮ Worst-case Nash equilibria in restricted routing ⋮ A traffic congestion analysis by user equilibrium and system optimum with incomplete information ⋮ On a generalized Cournot oligopolistic competition game ⋮ Network topology and the efficiency of equilibrium ⋮ Efficiency Loss and Coordination in the Online Shopping Supply Chain with Competitive Shipping Companies ⋮ A convergence analysis of the price of anarchy in atomic congestion games ⋮ The price of anarchy in loss systems ⋮ Existence of Nash equilibrium in games with a measure space of players and discontinuous payoff functions ⋮ The price of anarchy for non-atomic congestion games with symmetric cost maps and elastic demands. ⋮ Buyer-supplier games: optimization over the core ⋮ The price of anarchy in routing games as a function of the demand ⋮ Convergence to approximate Nash equilibria in congestion games ⋮ On the performance of approximate equilibria in congestion games ⋮ Graphical congestion games ⋮ The price of stability for undirected broadcast network design with fair cost allocation is constant ⋮ Repeated congestion games with bounded rationality ⋮ Congestion games with failures ⋮ Tight bounds for selfish and greedy load balancing ⋮ Social optimality and cooperation in nonatomic congestion games. ⋮ Truthful mechanisms for selfish routing and two-parameter agents ⋮ When is Selfish Routing Bad? The Price of Anarchy in Light and Heavy Traffic ⋮ Design of price mechanisms for network resource allocation via price of anarchy ⋮ Price of anarchy for highly congested routing games in parallel networks ⋮ Bounding the inefficiency of Nash equilibria in games with finitely many players ⋮ Nash-stable coalition partition and potential functions in games with coalition structure ⋮ Local smoothness and the price of anarchy in splittable congestion games ⋮ Coarse matching with incomplete information ⋮ The effect of supplier capacity on the supply chain profit ⋮ Inefficiency of logit-based stochastic user equilibrium in a traffic network under ATIS ⋮ Prices of anarchy, information, and cooperation in differential games ⋮ Connectivity and equilibrium in random games ⋮ Bounding the inefficiency of the C-logit stochastic user equilibrium assignment ⋮ On the severity of Braess's paradox: designing networks for selfish users is hard ⋮ The price of anarchy is independent of the network topology ⋮ Bounds on the welfare loss from moral hazard with limited liability ⋮ Selfish routing in public services ⋮ Fragility of the commons under prospect-theoretic risk attitudes ⋮ A geometric approach to the price of anarchy in nonatomic congestion games ⋮ The price of anarchy in nonatomic consumption-relevance congestion games ⋮ Dynamic Atomic Congestion Games with Seasonal Flows ⋮ On the price of anarchy of two-stage machine scheduling games ⋮ Pathwise smooth splittable congestion games and inefficiency ⋮ On the Price of Anarchy of Highly Congested Nonatomic Network Games ⋮ Efficient graph topologies in network routing games ⋮ Models of Non-atomic Congestion Games – From Unicast to Multicast Routing ⋮ Efficiency of atomic splittable selfish routing with polynomial cost functions ⋮ Game efficiency through linear programming duality ⋮ Interplay between Security Providers, Consumers, and Attackers: A Weighted Congestion Game Approach ⋮ On the (In)efficiency of MFG Equilibria ⋮ Estimating heterogeneous agent preferences by inverse optimization in a randomized nonatomic game ⋮ A note on network games with strategic complements and the Katz-Bonacich centrality measure ⋮ Bounding the inefficiency of logit-based stochastic user equilibrium ⋮ Value of Information in Bayesian Routing Games ⋮ Selfishness Need Not Be Bad ⋮ The Price of Stability of Weighted Congestion Games ⋮ Atomic congestion games with random players: network equilibrium and the price of anarchy ⋮ Heterogeneity and chaos in congestion games ⋮ A mixed traffic assignment problem and its upper bound of efficiency loss ⋮ The Price of Stability of Weighted Congestion Games ⋮ Bottleneck links, variable demand, and the tragedy of the commons
Cites Work
- Unnamed Item
- Unnamed Item
- On a theorem of Schmeidler
- Anonymous games with binary actions
- A direct proof of the existence of pure strategy equilibria in games with a continuum of players
- The price of anarchy for non-atomic congestion games with symmetric cost maps and elastic demands.
- Social optimality and cooperation in nonatomic congestion games.
- Potential games
- Equilibrium points of nonatomic games
- A class of games possessing pure-strategy Nash equilibria
- Dynamics and rationality in ordered externality games
- Generic Uniqueness of Equilibrium in Large Crowding Games
- How bad is selfish routing?
- CONGESTION GAMES AND POTENTIALS RECONSIDERED
- Algorithms, games, and the internet
- Traffic assignment problem for a general network
- The network equilibrium problem in integers
- Selfish Routing in Capacitated Networks
- The price of anarchy is independent of the network topology
This page was built for publication: Bounding the inefficiency of equilibria in nonatomic congestion games
