Document Type

Article

Publication Date

10-1999

Publication Title

Department of Computer Science Technical Report TR 2000-363

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.

Comments

Department of Computer Science Technical Report TR 2000-363

Share

COinS