A preference processing model for cooperative agents
Journal of Intelligent Information Systems
| Hi-index | 0.00 |
Preferences are assigned on consumable resources during task execution. We have presented here a scheme for handling such preferences in non-preemptive allocations for two types of task in a multi-agent environment with the object of finding a solution that preserves the highest number of preferences. The task types are: distributed query processing (such as a travel plan) and object creation (such as cooperative design). In both cases, convergence can be guaranteed because of non-preemption, but the quickest path for the best solution is harder to identify.