ENGLISH

A Game-Theoretic Formulation of Multi-Agent Resource Allocation

By Basar T. , Bredin J. Maheswaran R.T. , Imer C. , Kotz D. , Rus D.

Book information

Language
english
Format
PDF
Filesize
364 kB (372916 bytes)
Pages
\8
Library
twirpx
Time added
2017-08-07 07:01:42
Информатика и вычислительная техника;Вычислительнысистемы и сети (ВМСС)

Description

Dartmouth College Department of Computer Science. Technical Report PCS-TR99-360. 1999. 8 стр. The paper considers resource allocation in a network with mobile agents competing for computational priority. The authors formulate this problem as a multi-agent game with the players being agents purchasing service from a common server. Existens of a computable Nash equilibrium is proved, assuming that agents have perfect information into the future. Simulation of a network of hosts and agents using the suggested strategy shows that our resource-allocation mechanism effectively prioritizes agents according to their endowments.Abstract1 Introduction2 System Model3 Single Agent Optimization4 Existence of Nash Equilibrium for Multiple Agents at the Same Provider5 Uniqueness of Nash Equilibrium for Multiple Agents at the Same Provider6 Simulation and Results7 Discussion and FutureWork8 RelatedWork9 ConclusionAppendixAcknowledgmentsReferences

Similar books