no code implementations • 19 Sep 2023 • Bernd Simon, Andrea Ortiz, Walid Saad, Anja Klein
The task assignment problem is modeled as a matching game considering the MCSP's and MUs' individual goals while the MUs learn their efforts online.
no code implementations • 10 May 2017 • Sabrina Klos, Cem Tekin, Mihaela van der Schaar, Anja Klein
In our algorithm, a local controller (LC) in the mobile device of a worker regularly observes the worker's context, her/his decisions to accept or decline tasks and the quality in completing tasks.
no code implementations • 14 Jun 2016 • Sabrina Müller, Onur Atan, Mihaela van der Schaar, Anja Klein
We derive a sublinear regret bound, which characterizes the learning speed and proves that our algorithm converges to the optimal cache content placement strategy in terms of maximizing the number of cache hits.