Task-Oriented Domains

The Effects of Cooperation on Multiagent Search in Task-Oriented Domains

The task allocation problem consists of:
- T: tasks
- A: agents
- c_i : 2 ^T -> Reals. cost to agent i to do a subset of tasks.
- (t₁, t₂,..., t_|A|): an initial allocation of tasks to agents.
The cost function is monotonic.
The cost of doing nothing is 0.
A deal between two agents 1 and 2 re-allocates the tasks that they had: from (T₁, T₂) to (D₁, D₂).
This is an instance of the multiagent search problem.