The Stackelberg Minimum Spanning Tree Game on Planar and Bounded-Treewidth Graphs.
Jean CardinalErik D. DemaineSamuel FioriniGwenaël JoretIlan NewmanOren WeimannPublished in: WINE (2009)
Keyphrases
- minimum spanning tree
- bounded treewidth
- game theory
- np complete
- nash equilibrium
- spanning tree
- nash equilibria
- graph theory
- decision problems
- traveling salesman problem
- weighted graph
- ant colony optimization
- conjunctive queries
- shortest path
- boolean functions
- np hard
- graph theoretic
- incomplete information
- minimum weight
- relational learning
- optimization problems
- computational complexity