BIB-VERSION:: CS-TR-v2.0
ID:: ncstrl.dartmouthcs//TR99-360
ENTRY:: October 25, 1999
ORGANIZATION:: Dartmouth College, Computer Science
TITLE:: A Game-Theoretic Formulation of Multi-Agent Resource Allocation
TYPE:: Technical Report (paper)
REVISION:: 1
AUTHOR:: Bredin, Jonathan
AUTHOR:: Maheswaran, Rajiv T.
AUTHOR:: Imer, Cagri
AUTHOR:: Basar, Tamer
AUTHOR:: Kotz, David
AUTHOR:: Rus, Daniela
DATE:: October 1999
RETRIEVAL:: For a paper copy, email <reports@cs.dartmouth.edu>
RETRIEVAL:: For a paper copy, write to
       Technical Report Librarian
       Department of Computer Science
       Dartmouth College
       6211 Sudikoff Laboratory
       Hanover, NH 03755-3510
       USA
RETRIEVAL:: Compressed Postscript at http://www.cs.dartmouth.edu/reports/TR99-360.ps.Z
RETRIEVAL:: PDF at http://www.cs.dartmouth.edu/reports/TR99-360.pdf
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.
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.
NOTE:: 
Submitted to "Autonomous Agents 2000".
See <a href="http://agent.cs.dartmouth.edu/papers/#market">related papers.</a>
END:: ncstrl.dartmouthcs//TR99-360