Improved bounds on equilibria solutions in the network design game.
Akaki MamageishviliMatús MihalákSimone MontemezzaniPublished in: Int. J. Game Theory (2018)
Keyphrases
- network design
- game theoretic
- game theory
- nash equilibria
- nash equilibrium
- bi objective
- games with incomplete information
- network architecture
- upper bound
- network design problem
- communication networks
- pure strategy
- heuristic solution
- pure nash equilibria
- lower bound
- extensive form games
- facility location
- game playing
- feasible solution
- incomplete information
- stochastic games
- multi agent systems
- optimal solution
- data mining
- long run
- computer games
- repeated games
- decision problems
- reverse logistics
- object oriented