arXiv (All)
open access
Bandit Learning in General Open Multi-agent Systems
Open systems, where agents arrive and depart over time, are growing in digital platforms. Existing work on online learning in such systems, however, often relies on structural assumptions that may be restrictive in practice. In particular, heterogeneous rewards and general agent patterns create thre
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
- Linear Bandits beyond Inner Product Spaces, the case of Bandit Optimal Transport#1201857
- Improved Multiplayer Bandit Algorithm for Bernoulli Rewards#1062113
- Self-Referenced Social Preferences: Cooperation without Observing Others Rewards#1217616
- Diversified Multinomial Logit Contextual Bandits#1118649
- Learning Process Rewards via Success Visitation Matching for Efficient RL#299924
Record · ID 1399852
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