Congestion Games with Variable Demands
From MaRDI portal
Publication:2800374
DOI10.1287/moor.2015.0726zbMath1347.91014arXiv1012.1938OpenAlexW2568955846MaRDI QIDQ2800374
Publication date: 15 April 2016
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1012.1938
Noncooperative games (91A10) Games involving graphs (91A43) Deterministic network models in operations research (90B10) Resource and cost allocation (including fair division, apportionment, etc.) (91B32) General topics in the theory of algorithms (68W01)
Related Items (9)
On Existence and Properties of Approximate Pure Nash Equilibria in Bandwidth Allocation Games ⋮ Bottleneck Routing with Elastic Demands ⋮ Bottleneck routing with elastic demands ⋮ A Unified Framework for Pricing in Nonconvex Resource Allocation Games ⋮ Equilibria in a class of aggregative location games ⋮ Exact price of anarchy for weighted congestion games with two players ⋮ Congestion Games with Variable Demands ⋮ Equilibria in Multiclass and Multidimensional Atomic Congestion Games ⋮ Pure Nash equilibria in restricted budget games
Cites Work
- Representation of finite games as network congestion games
- Characterizing the existence of potential functions in weighted congestion games
- Network design with weighted players
- Pure Nash equilibria in player-specific and weighted congestion games
- Strong equilibrium in congestion games
- Congestion games with player-specific payoff functions
- A class of games possessing pure-strategy Nash equilibria
- Selfish unsplittable flows
- Congestion Games with Variable Demands
- Congestion Games with Player-Specific Costs Revisited
- On the Existence of Pure Strategy Nash Equilibria in Integer–Splittable Weighted Congestion Games
- Rate control for communication networks: shadow prices, proportional fairness and stability
- Routing (un-) splittable flow in games with player-specific affine latency functions
- The Price of Stability for Network Design with Fair Cost Allocation
- Algorithms for pure Nash equilibria in weighted congestion games
- Convergence time to Nash equilibrium in load balancing
- Bottleneck links, variable demand, and the tragedy of the commons
- On the relationship between Nash—Cournot and Wardrop equilibria
- The problem of optimal smoothing for convex functions
- On Satisfiability Games and the Power of Congestion Games
- Existence and Uniqueness of Equilibrium Points for Concave N-Person Games
- The network equilibrium problem in integers
- A Further Generalization of the Kakutani Fixed Point Theorem, with Application to Nash Equilibrium Points
- On the Existence of Pure Nash Equilibria in Weighted Congestion Games
- Atomic resource sharing in noncooperative networks
This page was built for publication: Congestion Games with Variable Demands
