arXiv (OAI Expanded)
open access
Efficiency-Reward Trade-Off in Queues with Dynamic Arrivals
Motivated by applications in online marketplaces such as ride-hailing platforms and payment channel networks, we study a single server queue with service rate $μ$ and queue-length-dependent arrival rate $λ(q) \in [0, λ_{\max}]$. The system operator receives a reward $F(λ)$ by setting an arrival rate
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 with Rechargeable Servers#1070763
- Convexity Properties and Comparative Statics for M/M/S Queues with Balking and Reneging#941635
- Strategic Users in a Priority Queue with Bulk Service on Blockchains#246444
- Dynamic priority rules for cyclic queues with limited service regime#239228
- The “sensitive” Markovian queueing system and its application for a call center problem#955429
Record · ID 1070755
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