BibTeX for a paper by David Kotz at Dartmouth College.
For more information about this paper, visit this web page:
https://kotz.cs.dartmouth.edu/research/bredin-game/index.html

@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 International Conference on Autonomous Agents}},
  year =          2000,
  month =         {June},
  pages =         {349--356},
  publisher =     {ACM},
  copyright =     {ACM},
  DOI =           {10.1145/336595.337525},
  URL =           {https://kotz.cs.dartmouth.edu/research/bredin-game/index.html},
  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.},
}