@techreport{bredin:game-tr,
    author = {Jonathan Bredin and Rajiv T. Maheswaran and \c{C}agri Imer and
Tamer Ba\c{s}ar and David Kotz and Daniela Rus},
    title = {A Game-Theoretic Formulation of Multi-Agent Resource Allocation},
    year = {1999},
    month = {October},
    number = {PCS-TR99-360},
    institution = {Dept. of Computer Science, Dartmouth College},
    copyright = {the authors},
    group = {dfk, agents, coabs, actcomm, cmc},
    vitatype = {02},
    later = {bredin:game},
    url = {http://www.cs.dartmouth.edu/reports/abstracts/TR99-360/},
    urlpdf = {http://www.cs.dartmouth.edu/~dfk/papers/bredin:game-tr.pdf},
    keyword = {mobile agent, market-based control, game theory, resource
allocation, scheduling, load balancing, dfk},
    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.}
}