Abstract: We study a model of selfish resource allocation that seeks to incorporate dependencies among resources as they exist in modern networked environments. Our model is inspired by utility functions with constant elasticity of substitution (CES) which is a well-studied model in economics. We consider congestion games with different aggregation functions. In particular, we study norms and analyze the existence and complexity of (approximate) pure Nash equilibria. Additionally, we give an almost tight characterization based on monotonicity properties to describe the set of aggregation functions that guarantee the existence of pure Nash equilibria.
Recommendations
Cites work
- A class of games possessing pure-strategy Nash equilibria
- Approximate pure Nash equilibria in weighted congestion games
- Bounding the potential function in congestion games and approximate pure Nash equilibria
- Combinatorial Optimization. Polyhedra and efficiency. CD-ROM
- Complexity of pure Nash equilibria in player-specific network congestion games
- Computing pure Nash and strong equilibria in bottleneck congestion games
- Congestion games revisited
- Congestion Games with Mixed Objectives
- Congestion Games with Player-Specific Constants
- Congestion games with player-specific payoff functions
- Convergence to approximate Nash equilibria in congestion games
- Efficient computation of approximate pure Nash equilibria in congestion games
- Games with congestion-averse utilities
- scientific article; zbMATH DE number 5485547 (Why is no real title available?)
- Intrinsic robustness of the price of anarchy
- On the complexity of pure-strategy Nash equilibria in congestion and local-effect games
- On the impact of combinatorial structure on congestion games
- On the performance of approximate equilibria in congestion games
- Potential games
- Pure Nash equilibria in player-specific and weighted congestion games
- Selfish unsplittable flows
- The complexity of pure Nash equilibria
- Worst-case equilibria
Cited in
(16)- Congestion games revisited
- Congestion games with variable demands
- Congestion Games with Multi-Dimensional Demands
- Budgeted personalized incentive approaches for smoothing congestion in resource networks
- Congestion Games with Mixed Objectives
- A unified approach to congestion games and two-sided markets
- Congestion games with capacitated resources
- Congestion games with multisets of resources and applications in synthesis
- Efficiency Loss in a Network Resource Allocation Game
- A common generalization of budget games and congestion games
- Competitive Resource Allocation Among Urban Congestion Areas in a Modern Big City
- Pure Nash equilibria in weighted matroid congestion games with non-additive aggregation and beyond
- A unified model of congestion games with priorities. Two-sided markets with ties, finite and non-affine delay functions, and pure Nash equilibria
- A unified model of congestion games with priorities: two-sided markets with ties, finite and non-affine delay functions, and pure Nash equilibria
- Transfer implementation in congestion games
- Congestion games with capacitated resources
This page was built for publication: Congestion games with complementarities
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5283369)
