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-tr/index.html

@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}},
  institution =   {Dartmouth Computer Science},
  year =          1999,
  month =         {October},
  number =        {PCS-TR99-360},
  copyright =     {the authors},
  URL =           {https://kotz.cs.dartmouth.edu/research/bredin-game-tr/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. 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.},
}