Blind Dynamic Resource Allocation in Closed Networks via Mirror Backpressure

We study the problem of maximizing payoff generated over a period of time in a general class of closed queueing networks with a finite, fixed number of supply units that circulate in the system. Demand arrives stochastically, and serving a demand unit (customer) causes a supply unit to relocate from...

Ausführliche Beschreibung