TY - GEN
T1 - Distributed multiagent resource allocation in diminishing marginal return domains
AU - Bachrach, Yoram
AU - Rosenschein, Jeffrey S.
PY - 2008
Y1 - 2008
N2 - We consider a multiagent resource allocation domain where the marginal production of each resource is diminishing. A set of identical, self-interested agents requires access to sharable resources in the domain. We present a distributed and random allocation procedure, and demonstrate that the allocation converges to the optimal in terms of utilitarian social welfare. The procedure is based on direct interaction among the agents and resource owners (without the use of a central authority). We then consider potential strategic behavior of the self-interested agents and resource owners, and show tliat when both act rationally and the domain is highly competitive for the resource owners, the convergence result still holds. The optimal allocation is arrived at quickly; given a setting with k resources and n agents, we demonstrate that the expected number of timesteps to convergence is O(κ In n), even in the worst case, where the optimal allocation is extremely unbalanced. Our allocation procedure has advantages over a mechanism design approach based on Vickrey-Clarke-Groves (VCG) mechanisms: it does not require the existence of a central trusted authority, and it fully distributes the utility obtained by the agents and resource owners (i.e., it is strongly budget-Balanced.
AB - We consider a multiagent resource allocation domain where the marginal production of each resource is diminishing. A set of identical, self-interested agents requires access to sharable resources in the domain. We present a distributed and random allocation procedure, and demonstrate that the allocation converges to the optimal in terms of utilitarian social welfare. The procedure is based on direct interaction among the agents and resource owners (without the use of a central authority). We then consider potential strategic behavior of the self-interested agents and resource owners, and show tliat when both act rationally and the domain is highly competitive for the resource owners, the convergence result still holds. The optimal allocation is arrived at quickly; given a setting with k resources and n agents, we demonstrate that the expected number of timesteps to convergence is O(κ In n), even in the worst case, where the optimal allocation is extremely unbalanced. Our allocation procedure has advantages over a mechanism design approach based on Vickrey-Clarke-Groves (VCG) mechanisms: it does not require the existence of a central trusted authority, and it fully distributes the utility obtained by the agents and resource owners (i.e., it is strongly budget-Balanced.
KW - Multiagent systems
KW - Resource allocation
UR - http://www.scopus.com/inward/record.url?scp=84899974502&partnerID=8YFLogxK
M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???
AN - SCOPUS:84899974502
SN - 9781605604701
T3 - Proceedings of the International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS
SP - 1085
EP - 1092
BT - 7th International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS 2008
PB - International Foundation for Autonomous Agents and Multiagent Systems (IFAAMAS)
T2 - 7th International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS 2008
Y2 - 12 May 2008 through 16 May 2008
ER -