Tolling for Constraint Satisfaction in Markov Decision Process Congestion Games.
Sarah H. Q. LiYue YuDaniel J. CalderoneLillian J. RatliffBehçet AçikmesePublished in: CoRR (2019)
Keyphrases
- constraint satisfaction
- markov decision process
- congestion games
- finite horizon
- pure strategy
- state space
- constraint satisfaction problems
- heuristic search
- optimal policy
- pure nash equilibria
- nash equilibria
- markov decision processes
- reinforcement learning
- constraint programming
- temporal difference learning
- pure nash equilibrium
- infinite horizon
- constraint relaxation
- constraint propagation
- initial state
- search space
- nash equilibrium
- soft constraints
- robust fault detection
- russian doll search
- incomplete information
- dynamic programming
- cost function
- transition probabilities
- game theoretic
- np complete
- evolutionary algorithm
- reward function
- long run
- finite state
- markov chain
- np hard
- multi agent systems
- bayesian networks
- machine learning