Skip to main navigation
Skip to search
Skip to main content
Maastricht University Home
Support & FAQ
Link opens in a new tab
Search content at Maastricht University
Home
Researchers
Publications
Activities
Press/Media
Prizes
Organisations
Dataset/Software
Projects
Pure Nash equilibria in player-specific and weighted congestion games.
H. Ackermann
*
, H. Röglin
, B. Vöcking
*
Corresponding author for this work
Quantitative Economics
Research output
:
Contribution to journal
›
Article
›
Academic
›
peer-review
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Pure Nash equilibria in player-specific and weighted congestion games.'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Pure Nash Equilibrium
100%
Weighted Congestion Games
100%
Pure Equilibrium
100%
Strategy Space
80%
Congestion Games
80%
Matroid Congestion Game
80%
Game Strategy
40%
Best Response Dynamics
40%
Matroid
40%
Convergence Time
40%
Interweaving
20%
Singleton
20%
Polynomial-time Algorithm
20%
Cardinality
20%
Pseudo-polynomial Time
20%
Short Sequence
20%
Delay Function
20%
Weighted Matroid
20%
Superpolynomials
20%
Computer Science
Nash Equilibrium
100%
Related Question
50%
Cardinality
50%
Polynomial Time Algorithm
50%
Singletons
50%
INIS
equilibrium
100%
space
50%
dynamics
25%
convergence
25%
algorithms
12%
resources
12%
yields
12%
polynomials
12%
Economics, Econometrics and Finance
Nash Equilibrium
100%
Congestion Game
100%