On the complexity of pure Nash equilibria in player-specific network congestion games

Heiner Ackermann*, Alexander Skopalik

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

10 Citations (Scopus)

Fingerprint

Dive into the research topics of 'On the complexity of pure Nash equilibria in player-specific network congestion games'. Together they form a unique fingerprint.

Mathematics

Engineering & Materials Science