Iterative Query-Based Approach to Efficient Task Decomposition and Resource Allocation

Incrementally Refined Acquaintance Model for Distributed Planning and Resource Allocation in Semi-trusted Environments

“…In [6] we document the behavior of the presented algorithm on the set of experiments performed in the logistics domain. We illustrate how the acquaintance model predicts the undisclosed service capacity of the several providers (that were based on partially constant and partially linear distributions).…”

“…the agent may be never interested in what is the value for very high volume of services had it known that only a small amount of the service will be requested. Therefore a better representation of the error and the quality of the acquaintance model may be: (6) provided that v j is an expected utility of the information about this particular piece of information. The key problem is that those values are hard to predict.…”

“…The decomposition algorithm is polynomial and easy to construct (see [6]). Its behavior, however, worsens strongly with lower quality of information about the provider's resource availabilities stored in the requestors' acquaintance models.…”