{"ID":2826502,"CreatedAt":"2026-06-01T04:54:23.091178241Z","UpdatedAt":"2026-06-01T04:54:23.091178241Z","DeletedAt":null,"paper_url":"https://arxiv.org/abs/2512.18630","arxiv_id":"2512.18630","title":"Smart nudging for efficient routing through networks","abstract":"In this paper, we formulate the design of efficient digitalised deposit return schemes as a control problem. We focus on the recycling of paper cups, though the proposed methodology applies more broadly to reverse logistics systems arising in circular economy R-strategies. Each item is assumed to carry a digital wallet through which monetary rewards are allocated to actors transferring the item across successive stages, incentivising completion of the recycling process. System efficiency is ensured by: (i) decentralised algorithms that avoid congestion at individual nodes; (ii) a decentralised AIMD-based algorithm that optimally splits the deposit across layers; and (iii) a feedback control loop that dynamically adjusts the deposit to achieve a desired throughput. The effectiveness of the framework is demonstrated through extensive simulations using realistic paper cup recycling data.","short_abstract":"In this paper, we formulate the design of efficient digitalised deposit return schemes as a control problem. We focus on the recycling of paper cups, though the proposed methodology applies more broadly to reverse logistics systems arising in circular economy R-strategies. Each item is assumed to carry a digital wallet...","url_abs":"https://arxiv.org/abs/2512.18630","url_pdf":"https://arxiv.org/pdf/2512.18630v1","authors":"[\"Pouria M. Oqaz\",\"Emanuele Crisostomi\",\"Elena Dieckmann\",\"Robert Shorten\"]","published":"2025-12-21T07:59:38Z","proceeding":"eess.SY","tasks":"[\"eess.SY\",\"econ.GN\",\"math.OC\"]","methods":"[]","has_code":false}
