@TechReport{Dartmouth:TR99-360,
  author = {Jonathan Bredin and Rajiv T. Maheswaran and Cagri Imer and Tamer Basar and David Kotz and Daniela Rus},
  title = {{A Game-Theoretic Formulation of Multi-Agent Resource Allocation}},
  institution = {Dartmouth College, Computer Science},
  address = {Hanover, NH},
  number = {PCS-TR99-360},
  year = {1999},
  month = {October},
  URL = {http://www.cs.dartmouth.edu/reports/TR99-360.ps.Z},
  comment = {
    Submitted to "Autonomous Agents 2000".
    See <a href="http://agent.cs.dartmouth.edu/papers/#market">related papers.</a>
  },
  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.
  }
}