ISTA Publications
metadata only
Value-positivity for matrix games
Matrix games are the most basic model in game theory, and yet robustness with respect to small perturbations of the matrix entries is not fully understood. In this paper, we introduce value positivity and uniform value positivity, two properties that refine the notion of optimality in the context of
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
- Finding a Positive Index Nash Equilibrium is PPADS-Complete#1050070
- Equilibrium Play Without Mutual Knowledge of Rationality#1144849
- On noncooperative oligopoly equilibrium in the multiple leader–follower game#1053474
- Regularized Coupling Maps on Matrix Polytopes: From Assignment to Graph Matching and Optimal Transport#794105
- Regularized Coupling Maps on Matrix Polytopes: From Assignment to Graph Matching and Optimal Transport#790086
Record · ID 1066576
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