Learnability of edge cost functions in routing games.
Jerome ThaiAlexandre M. BayenPublished in: CDC (2017)
Keyphrases
- cost function
- edge detection
- computer games
- video games
- finite automata
- edge information
- search space reduction
- nash equilibria
- game theoretic
- routing algorithm
- game theory
- boolean functions
- nash equilibrium
- uniform convergence
- edge detector
- inductive inference
- game playing
- sufficient conditions
- congestion games
- dnf formulas
- coalitional games
- game tree
- pattern languages
- pac learning
- routing problem
- game design
- uniform distribution
- educational games
- network topology
- shortest path