arXiv (All)
open access
Learning in Inverse Games: Tractable Training with Probabilistic Guarantees
Inverse game theory seeks to learn agents' unknown objectives from observed equilibrium behavior. Existing residual-based approaches can lead to non-convex problems and need not ensure strong monotonicity of the learned game, limiting reliable equilibrium prediction. We develop a tractable convex fr
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- A Geometric Perspective on Reward Function Updates in Inverse Reinforcement Learning#1324642
- Entropic Risk-Sensitive Evolutionary Learning and Equilibrium Selection in Coordination Games#986008
- Minimax Last-Iterate Convergence in Matrix Games with Observed Actions#1128916
- Learning from Unreliable Trajectories: Adversarially-Robust Federated Q-Learning#1216000
- Optimal last-iterate convergence in matrix games with bandit feedback using the log-barrier#19002
Record · ID 1188159
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive