%T A Game-Theoretic Formulation of Multi-Agent Resource Allocation
%A Jonathan Bredin
%A Rajiv T. Maheswaran
%A Cagri Imer
%A Tamer Basar
%A David Kotz
%A Daniela Rus
%R Technical Report PCS-TR99-360
%I Dartmouth College, Computer Science
%C Hanover, NH
%D October 1999
%U http://www.cs.dartmouth.edu/reports/TR99-360.ps.Z
%X
 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.
%Z
 Submitted to "Autonomous Agents 2000".
 See <a href="http://agent.cs.dartmouth.edu/papers/#market">related papers.</a>