A Game-Theoretic Formulation of Multi-Agent Resource Allocation

Jonathan Bredin, Dartmouth College
Rajiv T. Maheswaran, University of Illinois
Çagri Imer, University of Illinois
Tamer Başar, University of Illinois
David Kotz, Dartmouth College
Daniela Rus, Dartmouth College

Department of Computer Science Technical Report TR 2000-363


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.