Stochastic approximation and user adaptation in a competitive resource sharing system
From MaRDI portal
Recommendations
- Asynchronous stochastic approximation and adaptation in a competitive system
- Stochastic Approximations and Adaptive Control of a Discrete-Time Single-Server Network with Random Routing
- Individual equilibrium and learning in processor sharing systems
- Dynamic service sharing with heterogeneous preferences
- Stable strategies for processor sharing systems
Cited in
(11)- The residual-based ESG algorithm and its performance analysis
- Asynchronous stochastic approximation and adaptation in a competitive system
- USING STOCHASTIC INFORMATION TO PREDICT APPLICATION BEHAVIOR ON CONTENDED RESOURCES
- On the Nash equilibria for the FCFS queueing system with load-increasing service rate
- scientific article; zbMATH DE number 1025836 (Why is no real title available?)
- Dynamic service sharing with heterogeneous preferences
- A stochastic analysis of resource sharing with logarithmic weights
- How does a stochastic optimization/approximation algorithm adapt to a randomly evolving optimum/root with jump Markov sample paths
- Self-tuning control based on multi-innovation stochastic gradient parameter estimation
- Individual equilibrium and learning in processor sharing systems
- scientific article; zbMATH DE number 440560 (Why is no real title available?)
This page was built for publication: Stochastic approximation and user adaptation in a competitive resource sharing system
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4507147)