@inproceedings{bredin:game,
    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},
    booktitle = {Proceedings of the Fourth International Conference on Autonomous
Agents},
    year = {2000},
    month = {June},
    pages = {349--356},
    publisher = {ACM Press},
    copyright = {ACM},
    earlier = {bredin:game-tr},
    doi = {10.1145/336595.337525},
    url = {http://www.cs.dartmouth.edu/~dfk/papers/bredin-game.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. From our game, we build a
market-based CPU allocation policy and a strategy with which an agent may
plan its expenditures for a multi-hop itinerary. 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 and
that our planning algorithm handles network delay gracefully.}
}