arXiv (All)
open access
Learning in Strategic Queuing with Geometric Recharge: From Bandits to Systems
We study packet routing in queuing systems where queues act as selfish, myopic agents that use no-regret learning algorithms to select servers with unknown service rates. To model the small buffers used in data centers, we assume that each server has a single-packet buffer. Even such a tiny buffer a
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
- Queues: Theory and Applications#66873
- Dicey games: Shared sources of randomness in distributed systems#449044
- Rethinking Traffic Matrix Completion: Estimate the Process, Not the Entries#155203
- Square-Root Regret for Adversarial Multiplayer Bandits without Collision Information or Shared Randomness#1201701
- Management policies to handle multi queuing systems in a service oriented organization : a study of the Henri Bourassa driver licensing office in the City of Montreal#1020522
Record · ID 1345002
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