Mixed Nash equilibria in selfish routing problems with dynamic constraints.
Alessandro FerranteMimmo ParentePublished in: Theor. Comput. Sci. (2008)
Keyphrases
- nash equilibria
- routing problem
- dynamic constraints
- nash equilibrium
- game theory
- game theoretic
- incomplete information
- temporal logic
- pure strategy
- active rules
- functional dependencies
- vehicle routing problem
- resource allocation
- shortest path
- routing algorithm
- global optimization
- relational model
- travel time
- traveling salesman problem
- plan execution
- mixed strategy
- worst case
- wireless sensor networks
- decision problems
- dynamic environments
- mobile robot