activity
20192023
most citedBounding Fixed Points of Set-Based Bellman Operator and Nash Equilibria of Stochastic Games

6 citations · 17 across the 11 of their papers we have counts for

collaborators
Showing cs.GTShow all

5 papers · 1 filter

cs.GT2020★ 4 cited

Disturbance Decoupling for Gradient-based Multi-Agent Learning with Quadratic Costs

Sarah H. Q. Li, Lillian Ratliff, Behçet Açıkmeşe

Motivated by applications of multi-agent learning in noisy environments, this paper studies the robustness of gradient-based learning dynamics with respect to disturbances. While d…

cs.GT2020★ 6 cited

Bounding Fixed Points of Set-Based Bellman Operator and Nash Equilibria of Stochastic Games

Sarah H. Q. Li, Assalé, Adjé +2

Motivated by uncertain parameters encountered in Markov decision processes (MDPs) and stochastic games, we study the effect of parameter uncertainty on Bellman operator-based algor…

cs.GT2019★ 3 cited

Sensitivity Analysis for Markov Decision Process Congestion Games

Sarah H. Q. Li, Daniel Calderone, Lillian Ratliff +1

We consider a non-atomic congestion game where each decision maker performs selfish optimization over states of a common MDP. The decision makers optimize for their own expected co…

cs.GT2019

Adaptive Constraint Satisfaction for Markov Decision Process Congestion Games: Application to Transportation Networks

Sarah H. Q. Li, Yue Yu, Nicolas Miguel +3

Under the Markov decision process (MDP) congestion game framework, we study the problem of enforcing population distribution constraints on a population of players with stochastic…

cs.GT2019★ 3 cited

Tolling for Constraint Satisfaction in Markov Decision Process Congestion Games

Sarah H. Q. Li, Yue Yu, Daniel Calderone +2

Markov decision process (MDP) congestion game is an extension of classic congestion games, where a continuous population of selfish agents solves Markov decision processes with con…