Robust Reward Placement under Uncertainty

We consider a problem of placing generators of rewards to be collected by randomly moving agents in a network. In many settings, the precise mobility pattern may be one of several possible, based on parameters outside our control, such as weather conditions. The placement should be robust to this un...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	arXiv.org 2024-06
Hauptverfasser:	Petsinis, Petros, Zhang, Kaichen, Pavlogiannis, Andreas, Zhou, Jingbo, Karras, Panagiotis
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithms Budgets Dynamic programming Knapsack problem Placement Polynomials Robustness Uncertainty Weather
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!