Papers
Topics
Authors
Recent
Assistant
AI Research Assistant
Well-researched responses based on relevant abstracts and paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses.
Gemini 2.5 Flash
Gemini 2.5 Flash 171 tok/s
Gemini 2.5 Pro 47 tok/s Pro
GPT-5 Medium 32 tok/s Pro
GPT-5 High 36 tok/s Pro
GPT-4o 60 tok/s Pro
Kimi K2 188 tok/s Pro
GPT OSS 120B 437 tok/s Pro
Claude Sonnet 4.5 36 tok/s Pro
2000 character limit reached

Reinforcement Learning for Inverse Linear-quadratic Dynamic Non-cooperative Games (2311.03044v1)

Published 6 Nov 2023 in math.OC and math.DS

Abstract: In this paper, we address the inverse problem in the case of linear-quadratic discrete-time dynamic non-cooperative games. Given feedback laws of players that are known to be a Nash equilibrium pair for a discrete-time linear system, we want find cost function parameters for which the observed feedback laws are optimal and stabilizing. Using the given feedback laws, we introduce a model-based algorithm that generates cost function parameters solving the problem. We provide theoretical results that guarantee the convergence and stability of the algorithm as well as the way to generate new games with necessary properties without requiring to run the complete algorithm repeatedly . Then the algorithm is extended to a model-free version that uses data samples generated by unknown dynamics and has the same properties as the model-based version. Simulation results validate the effectiveness of the proposed algorithms.

Summary

We haven't generated a summary for this paper yet.

Dice Question Streamline Icon: https://streamlinehq.com

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Lightbulb Streamline Icon: https://streamlinehq.com

Continue Learning

We haven't generated follow-up questions for this paper yet.

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.