Congestion Games with Player-Specific Constants

DOI10.1007/978-3-540-74456-6_56zbMath1147.91304OpenAlexW1537998965MaRDI QIDQ3525607

Karsten Tiemann, Marios Mavronicolas, Burkhard Monien, Igal Milchtaich

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)

Related Items (19)

Congestion Games with Complementarities ⋮ On the Existence of Optimal Taxes for Network Congestion Games with Heterogeneous Users ⋮ Congestion games with mixed objectives ⋮ On Existence and Properties of Approximate Pure Nash Equilibria in Bandwidth Allocation Games ⋮ Strong equilibria in games with the lexicographical improvement property ⋮ Weighted Boolean Formula Games ⋮ A traffic congestion analysis by user equilibrium and system optimum with incomplete information ⋮ Network-formation games with regular objectives ⋮ Computing pure Nash and strong equilibria in bottleneck congestion games ⋮ Congestion Games with Mixed Objectives ⋮ Characterizing the existence of potential functions in weighted congestion games ⋮ Hierarchical Network Formation Games ⋮ Evolutionary equilibrium in Bayesian routing games: specialization and niche formation ⋮ Fault-Tolerant Aggregate Signatures ⋮ Subjective vs. Objective Reality — The Risk of Running Late ⋮ Informational Braess’ Paradox: The Effect of Information on Traffic Congestion ⋮ Interplay between Security Providers, Consumers, and Attackers: A Weighted Congestion Game Approach ⋮ Weighted congestion games with separable preferences ⋮ Pure Nash equilibria in restricted budget games

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