Game-theoretic formulation of multi-agent resource allocation

Jonathan Bredin, Rajiv T. Maheswaran, Cagri Imer, Tamer Basar, David Kotz, Daniela Rus

Research output: Contribution to conferencePaperpeer-review

Abstract

This paper considers resource allocation in a network with mobile agents competing for computational priority. We formulate this problem as a multi-agent game with the players being agents purchasing service from a common server. We show that there exists a computable Nash equilibrium when agents have perfect information into the future. From our game, we build a market-based CPU allocation policy and a strategy with which an agent may plan its expenditures for a multi-hop itinerary. We simulate a network of hosts and agents using our strategy to show that our resource-allocation mechanism effectively prioritizes agents according to their endowments and that our planning algorithm handles network delay gracefully.

Original languageEnglish (US)
Pages349-356
Number of pages8
StatePublished - 2000
Externally publishedYes
Event4th International Conference on Autonomous Agents - Barcelona, Spain
Duration: Jun 3 2000Jun 7 2000

Other

Other4th International Conference on Autonomous Agents
CityBarcelona, Spain
Period6/3/006/7/00

ASJC Scopus subject areas

  • General Engineering

Fingerprint

Dive into the research topics of 'Game-theoretic formulation of multi-agent resource allocation'. Together they form a unique fingerprint.

Cite this