A Game-Theoretic Formulation of Multi-Agent Resource Allocation


Jonathan Bredin, Rajiv T. Maheswaran, Çagri Imer, Tamer Başar, David Kotz, and Daniela Rus. A Game-Theoretic Formulation of Multi-Agent Resource Allocation. Technical Report number PCS-TR99-360, Dartmouth Computer Science, October 1999. ©Copyright the authors. Later revised as bredin:game.


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. 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.

Citable with [BibTeX]

Projects: [dagents]

Keywords: [agents] [markets]

Available from the publisher: [page]

Available from the author: [bib] [pdf] [ps.gz]
This pdf was produced by the publisher and its posting here is permitted by the publisher.

[Kotz research]