( en | de | ru )

 

Disambiguation of "Ratliff, Lillian J."

Author of the publication

copydeleteadd this publication to your clipboard
Local Nash Equilibria are Isolated, Strict Local Nash Equilibria in 'Almost All' Zero-Sum Continuous Games.

, and . CoRR, (2020)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Lillian Mitzkat

Lillian Roth

Miriam Ratliff

Lillian Edelmann

Lillian Schacherl

 

Other publications of authors with the same name

Stability of Gradient Learning Dynamics in Continuous Games: Vector Action Spaces., , , , and . CoRR, (2020)Competitive Statistical Estimation with Strategic Data Sources., , , and . CoRR, (2019)Local Nash Equilibria are Isolated, Strict Local Nash Equilibria in 'Almost All' Zero-Sum Continuous Games., and . CDC, page 6899-6904. IEEE, (2019)Stackelberg Actor-Critic: Game-Theoretic Reinforcement Learning Algorithms., , , , and . AAAI, page 9217-9224. AAAI Press, (2022)Zeroth-Order Methods for Convex-Concave Min-max Problems: Applications to Decision-Dependent Risk Minimization., , , , and . AISTATS, volume 151 of Proceedings of Machine Learning Research, page 6702-6734. PMLR, (2022)Learning in Stochastic Monotone Games with Decision-Dependent Data., , , , and . AISTATS, volume 151 of Proceedings of Machine Learning Research, page 5891-5912. PMLR, (2022)Minimax Optimization with Smooth Algorithmic Adversaries., , , and . ICLR, OpenReview.net, (2022)Policy-Gradient Algorithms Have No Guarantees of Convergence in Linear Quadratic Games., , , and . AAMAS, page 860-868. International Foundation for Autonomous Agents and Multiagent Systems, (2020)An inverse correlated equilibrium framework for utility learning in multiplayer, noncooperative settings., , , , and . HiCoNS, page 9-16. ACM, (2013)Inverse Risk-Sensitive Reinforcement Learning., and . IEEE Trans. Automat. Contr., 65 (3): 1256-1263 (2020)