Optimization in task-completion networks

DOI10.1088/1742-5468/2008/02/P02003zbMATH Open1459.90054arXiv0712.3906OpenAlexW3106119082MaRDI QIDQ5239461FDOQ5239461

Matteo Marsili, Paolo Pin, Luca Dall'Asta

Publication date: 22 October 2019

Published in: Journal of Statistical Mechanics: Theory and Experiment (Search for Journal in Brave)

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.

Full work available at URL: https://arxiv.org/abs/0712.3906

Recommendations

• Networks
• Optimization as a result of the interplay between dynamics and structure
• scientific article; zbMATH DE number 5070368
• Optimal policy networks
• Optimal urban networks via mass transportation

zbMATH Keywords

stochastic processescommunicationnetwork dynamicstraffic and crowd dynamicssupply and information networks

Mathematics Subject Classification ID

Queues and service in operations research (90B22) Stochastic network models in operations research (90B15) Communication networks in operations research (90B18) Traffic problems in operations research (90B20)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Supply chain partnerships: Opportunities for operations research
• Asymptotics for M/G/1 low-priority waiting-time tail probabilities
• Priority Assignment in Waiting Line Problems
• TRANSPORT ON COMPLEX NETWORKS: FLOW, JAMMING AND OPTIMIZATION

Cited In (1)

• Optimization as a result of the interplay between dynamics and structure

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)