Login / Signup
Node-Max-Cut and the Complexity of Equilibrium in Linear Weighted Congestion Games.
Dimitris Fotakis
Anthimos Vardis Kandiros
Thanasis Lianeas
Nikos Mouzakis
Panagiotis Patsilinakos
Stratis Skoulakis
Published in:
ICALP (2020)
Keyphrases
</>
max cut
nash equilibria
congestion games
spectral graph
pure strategy
graph model
nash equilibrium
worst case
game theory
computational complexity
np complete problems
np complete
graph structure
graph partitioning
weighted graph
directed graph
linear program
np hard