arXiv (All)
open access
Endogenous Information in Routing Games: Memory-Constrained Equilibria, Recall Braess Paradoxes, and Memory Design
We study routing games in which travelers optimize over routes that are remembered or surfaced, rather than over a fixed exogenous action set. The paper develops a tractable design theory for endogenous recall and then connects it back to an explicit finite-memory micro model. At the micro level, ea
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
- Understanding Stage-Wise Utility-Risk Trade-offs in LLM Agent Memory#799399
- Understanding Stage-Wise Utility-Risk Trade-offs in LLM Agent Memory#797976
- Learning What to Remember: Long-horizon Counterfactual Memory Optimization#1142235
- Learning What to Remember: Long-horizon Counterfactual Memory Optimization#1122318
- Memory as Middleware for Self-Improving AI Agents#1116422
Record · ID 1104429
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