Congestion games with variable demands
From MaRDI portal
Abstract: We initiate the study of congestion games with variable demands where the (variable) demand has to be assigned to exactly one subset of resources. The players' incentives to use higher demands are stimulated by non-decreasing and concave utility functions. The payoff for a player is defined as the difference between the utility of the demand and the associated cost on the used resources. Although this class of non-cooperative games captures many elements of real-world applications, it has not been studied in this generality, to our knowledge, in the past. We study the fundamental problem of the existence of pure Nash equilibria (PNE for short) in congestion games with variable demands. We call a set of cost functions C consistent if every congestion game with variable demands and cost functions in C possesses a PNE. We say that C is FIP consistent if every such game possesses the alpha-Finite Improvement Property for every alpha>0. Our main results are structural characterizations of consistency and FIP consistency for twice continuously differentiable cost functions. Specifically, we show 1. C is consistent if and only if C contains either only affine functions or only homogeneously exponential functions (c(x) = a exp(p x)). 2. C is FIP consistent if and only if C contains only affine functions. Our results provide a complete characterization of consistency of cost functions revealing structural differences to congestion games with fixed demands (weighted congestion games), where in the latter even inhomogeneously exponential functions are FIP consistent. Finally, we study consistency and FIP consistency of cost functions in a slightly different class of games, where every player experiences the same cost on a resource (uniform cost model). We give a characterization of consistency and FIP consistency showing that only homogeneously exponential functions are consistent.
Recommendations
Cites work
- A class of games possessing pure-strategy Nash equilibria
- A Further Generalization of the Kakutani Fixed Point Theorem, with Application to Nash Equilibrium Points
- Algorithms for pure Nash equilibria in weighted congestion games
- Atomic resource sharing in noncooperative networks
- Bottleneck links, variable demand, and the tragedy of the commons
- Characterizing the existence of potential functions in weighted congestion games
- Congestion games with player-specific costs revisited
- Congestion games with player-specific payoff functions
- Congestion games with variable demands
- Convergence time to Nash equilibrium in load balancing
- Existence and Uniqueness of Equilibrium Points for Concave N-Person Games
- Network design with weighted players
- On Satisfiability Games and the Power of Congestion Games
- On the existence of pure Nash equilibria in weighted congestion games
- On the existence of pure strategy Nash equilibria in integer-splittable weighted congestion games
- On the relationship between Nash—Cournot and Wardrop equilibria
- Pure Nash equilibria in player-specific and weighted congestion games
- Rate control for communication networks: shadow prices, proportional fairness and stability
- Representation of finite games as network congestion games
- Routing (un-) splittable flow in games with player-specific affine latency functions
- Selfish unsplittable flows
- Strong equilibrium in congestion games
- The network equilibrium problem in integers
- The Price of Stability for Network Design with Fair Cost Allocation
- The problem of optimal smoothing for convex functions
Cited in
(14)- Congestion games with mixed objectives
- Bottleneck routing with elastic demands
- Congestion games with variable demands
- Congestion Games with Multi-Dimensional Demands
- Congestion games with higher demand dimensions
- Congestion Games with Mixed Objectives
- On Existence and Properties of Approximate Pure Nash Equilibria in Bandwidth Allocation Games
- Bottleneck routing with elastic demands
- Congestion games with complementarities
- Equilibria in Multiclass and Multidimensional Atomic Congestion Games
- Pure Nash equilibria in restricted budget games
- A Unified Framework for Pricing in Nonconvex Resource Allocation Games
- Exact price of anarchy for weighted congestion games with two players
- Equilibria in a class of aggregative location games
This page was built for publication: Congestion games with variable demands
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2800374)
