Congestion Games with Player-Specific Constants

DOI10.1007/978-3-540-74456-6_56MaRDI QIDQ3525607zbMATH OpenOpenAlexFDO

Authors Marios Mavronicolas, Igal Milchtaich, Burkhard Monien, Karsten Tiemann

Publication date 17 September 2008

Published in Mathematical Foundations of Computer Science 2007 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-74456-6_56

Mathematics Subject Classification ID

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

Recommendations

• Congestion games with player-specific costs revisited
• Weighted congestion games with separable preferences
• Congestion games with player-specific payoff functions
• Routing (un-) splittable flow in games with player-specific affine latency functions
• Pure Nash equilibria in player-specific and weighted congestion games

Cited in

(26)

• Weighted congestion games with separable preferences
• Congestion games with mixed objectives
• A traffic congestion analysis by user equilibrium and system optimum with incomplete information
• Evolutionary equilibrium in Bayesian routing games: specialization and niche formation
• Strong equilibria in games with the lexicographical improvement property
• Congestion games revisited
• Congestion network problems and related games
• Fault-tolerant aggregate signatures
• Congestion Games with Mixed Objectives
• scientific article; zbMATH DE number 5823841 (Why is no real title available?)
• Interplay between security providers, consumers, and attackers: a weighted congestion game approach
• On the existence of optimal taxes for network congestion games with heterogeneous users
• Hierarchical network formation games
• Network-formation games with regular objectives
• On Existence and Properties of Approximate Pure Nash Equilibria in Bandwidth Allocation Games
• Weighted Boolean formula games
• A First Step Towards Analyzing the Convergence Time in Player-Specific Singleton Congestion Games
• Computing pure Nash and strong equilibria in bottleneck congestion games
• Repeated congestion games with bounded rationality
• Informational Braess' paradox: the effect of information on traffic congestion
• Congestion games with complementarities
• Subjective vs. Objective Reality — The Risk of Running Late
• Pure Nash equilibria in restricted budget games
• Characterizing the existence of potential functions in weighted congestion games
• Which is the worst-case Nash equilibrium?
• The contest game for crowdsourcing reviews

This page was built for publication: Congestion Games with Player-Specific Constants

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