Congestion Games with Multi-Dimensional Demands

DOI10.1007/978-3-319-28697-6_77MaRDI QIDQ2807005zbMATH OpenOpenAlexFDO

Authors Andreas Schütz

Publication date 19 May 2016

Published in Operations Research Proceedings (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-28697-6_77

Mathematics Subject Classification ID

Noncooperative games (91A10) Games involving graphs (91A43)

Recommendations

• Congestion games with higher demand dimensions
• Congestion games with variable demands
• Congestion games revisited
• Congestion Games with Mixed Objectives
• Congestion games with mixed objectives
• Congestion games with complementarities
• Congestion games with player-specific payoff functions
• Mathematical Foundations of Computer Science 2004
• Congestion games with capacitated resources

Cites work

• A class of games possessing pure-strategy Nash equilibria
• Atomic resource sharing in noncooperative networks
• Equilibrium points in n -person games
• Faster min-max resource sharing in theory and practice
• On the existence of pure Nash equilibria in weighted congestion games
• Pure Nash equilibria in player-specific and weighted congestion games
• Selfish unsplittable flows
• Strong equilibria in games with the lexicographical improvement property
• Strong price of anarchy

Cited in

(7)

• Congestion games with multisets of resources and applications in synthesis
• Congestion games with variable demands
• Congestion games with higher demand dimensions
• On the existence of pure strategy Nash equilibria in integer-splittable weighted congestion games
• Congestion games revisited
• Equilibria in Multiclass and Multidimensional Atomic Congestion Games
• Congestion Games with Mixed Objectives

This page was built for publication: Congestion Games with Multi-Dimensional Demands

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2807005)