Abstract
AbstractWe introduce a generalization of weighted congestion games in which players are associated with k-dimensional demand vectors and resource costs are k-dimensional functions \(\smash{c : \mathbb{R}_{\geq 0}^k \to \mathbb{R}}\) of the aggregated demand vector of the players using the resource. Such a cost structure is natural when the cost of a resource depends on different properties of the players’ demands, e.g., total weight, total volume, and total number of items. A complete characterization of the existence of pure Nash equilibria in terms of the resource cost functions for all k ∈ ℕ is given.KeywordsCost FunctionNash EquilibriumComplete CharacterizationStrategy SpaceCongestion GameThese keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
