Task allocation is a classic distributed problem in which a set of p potentially faulty processes must cooperate to perform a set of m tasks. This paper considers a new dynamic version of the problem, in which tasks are injected adversarially during an asynchronous execution. We give the first asynchronous shared-memory algorithm for dynamic task allocation, and we prove that our solution is op...

Existing task allocation methods broadcast a request when they do not know who to ask for a certain task. In many situations this is not a good idea, either because of the burden on all other agents, or because not everyone can be trusted with the information that this task is requested. When considering coalitions, existing methods try all combinations, but sometimes need to limit the maximum ...

We study dynamic task allocation when providers' expertise evolves endogenously through training. characterize optimal assignment protocols and compare them to discretionary procedures, where it is the clients who select their service providers. Our results indicate that welfare gains from centralization are greater tasks arrive more rapidly, training technologies improve. Monitoring seniors' b...