Congestion Games with Variable Demands
نویسندگان
چکیده
منابع مشابه
Congestion Games with Complementarities
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 Lp norms and analyze ...
متن کاملThe price of anarchy for non-atomic congestion games with symmetric cost maps and elastic demands
By showing that there is an upper bound for the price of anarchy ( ) for a non-atomic congestion game with only separable cost maps and /xed demands, Roughgarden and Tardos show that the cost of forgoing centralized control is mild. This letter shows that there is an upper bound for ( ) in for /xed demands with symmetric cost maps. It also shows that there is a weaker bound for ( ) in with elas...
متن کاملPrice of Anarchy for Non-atomic Congestion Games with Stochastic Demands
We generalize the notions of user equilibrium and system optimum to nonatomic congestion games with stochastic demands. We establish upper bounds on the price of anarchy for three different settings of link cost functions and demand distributions, namely, (a) affine cost functions and general distributions, (b) polynomial cost functions and general positive-valued distributions, and (c) polynom...
متن کاملCongestion Games with Mixed Objectives
We study a new class of games which generalizes congestion games and its bottleneck variant. We introduce congestion games with mixed objectives to model network scenarios in which players seek to optimize for latency and bandwidths alike. We characterize the existence of pure Nash equilibria (PNE) and the convergence of improvement dynamics. For games that do not possess PNE we give bounds on ...
متن کاملGames with Congestion-Averse Utilities
Congestion games—in which players strategically choose from a set of “resources” and derive utilities that depend on the congestion on each resource— are important in a wide range of applications. However, to date, such games have been constrained to use utility functions that are linear sums with respect to resources. To remove this restriction, this paper provides a significant generalisation...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics of Operations Research
سال: 2016
ISSN: 0364-765X,1526-5471
DOI: 10.1287/moor.2015.0726