Optimization in task-completion networks
From MaRDI portal
Publication:5239461
Abstract: We discuss the collective behavior of a network of individuals that receive, process and forward to each other tasks. Given costs they store those tasks in buffers, choosing optimally the frequency at which to check and process the buffer. The individual optimizing strategy of each node determines the aggregate behavior of the network. We find that, under general assumptions, the whole system exhibits coexistence of equilibria and hysteresis.
Recommendations
Cites work
- scientific article; zbMATH DE number 5016447 (Why is no real title available?)
- scientific article; zbMATH DE number 45266 (Why is no real title available?)
- scientific article; zbMATH DE number 1416627 (Why is no real title available?)
- Asymptotics for M/G/1 low-priority waiting-time tail probabilities
- Priority Assignment in Waiting Line Problems
- Supply chain partnerships: Opportunities for operations research
- TRANSPORT ON COMPLEX NETWORKS: FLOW, JAMMING AND OPTIMIZATION
Cited in
(2)
This page was built for publication: Optimization in task-completion networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5239461)