arXiv (OAI Expanded)
open access
Learning generalized Nash equilibria from pairwise preferences
Generalized Nash Equilibrium Problems (GNEPs) arise in many applications, including non-cooperative multi-agent control problems. Although many methods exist for finding generalized Nash equilibria, most of them rely on assuming knowledge of the objective functions or being able to query the best re
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
- An LLM agent-based framework for analytical characterization of Nash equilibria#377566
- Robustness of solutions in game theory: Values and strategies in partially observable, perturbed, stochastic, and infinite games#1066569
- On the Equivalence of the Graph-Structural and Optimization-Based Characterizations of Popular Matchings#798627
- On the Equivalence of the Graph-Structural and Optimization-Based Characterizations of Popular Matchings#797214
- On combinatorial optimization games#1055978
Record · ID 1123048
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