BibTeX
@MISC{Nongaillard09anagent-based,
author = {Antoine Nongaillard},
title = {An Agent-based Approach for Distributed Resource allocations},
year = {2009}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Resource allocation problems have been widely studied according to various scenarios in literature. In such problems, a set of resources must be allocated to a set of agents, according to their own preferences. Self-organization issues in telecommunication, scheduling problems or supply chain management problems can be modeled using resource allocation problems. Suchproblemsareusuallysolvedbymeansofcentralizedtechniques, whereanomnisciententitydetermineshowtooptimally allocate resources. However,thesesolving methods are not well-adapted for applications where privacy is required. Moreover, several assumptions made are not always plausible, which may prevent their use in practice, especially in the context of agent societies. For instance, dynamic applicationsrequireadaptivesolvingprocesses, whichcanhandletheevolutionofinitialdata. Such techniques never consider restricted communication possibilities whereas many applicationsarebasedonthem. For instance, inpeer-to-peer networks,apeercanonly communicate with a small subset of the systems. In this thesis, we focus on distributed methods to solve resource allocationproblems. Initial allocation evolves step by step thanks to local agent negotiations. We seek to
