Node Max-Cut and Computing Equilibria in Linear Weighted Congestion Games.
Dimitris FotakisAnthimos Vardis KandirosThanasis LianeasNikos MouzakisPanagiotis PatsilinakosStratis SkoulakisPublished in: CoRR (2019)
Keyphrases
- max cut
- congestion games
- nash equilibria
- pure nash equilibria
- pure strategy
- spectral graph
- nash equilibrium
- graph model
- pure nash equilibrium
- game theoretic
- incomplete information
- directed graph
- game theory
- mixed strategy
- graph partitioning
- np hard
- tree structure
- long run
- np complete problems
- theoretic framework
- edge weights
- weighted graph
- upper bound
- scheduling problem