Loading...
Please wait, while we are loading the content...
Similar Documents
A Game-Theoretic Formulation of Multi-Agent Resource Allocation (2000)
| Content Provider | CiteSeerX |
|---|---|
| Author | Bredin, Jonathan Maheswaran, Rajiv T. Imer, Çagri Basar, Tamer Kotz, David Rus, Daniela |
| Description | In Proceedings of the Fourth International Conference on Autonomous Agents 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. 1 Introduction Mobile-agent systems allow user programs to autonomously relocate from one host to another. An agent may jump to one site to filter a database, jump to another site to access a camera, and to a third to process the results of the previous two hops before returning the results to the user. For each of the three hops, there may be alternative sites to access compatible resources and this choice of execution location subjects hosts to greater congestion volatility. Code mo... |
| File Format | |
| Language | English |
| Publisher | ACM Press |
| Publisher Date | 2000-01-01 |
| Access Restriction | Open |
| Subject Keyword | Perfect Information Game-theoretic Formulation Common Server Access Compatible Resource Code Mo Introduction Mobile-agent System Resource-allocation Mechanism Resource Allocation Multi-agent Resource Allocation User Program Congestion Volatility Alternative Site Computable Nash Equilibrium Execution Location Mobile Agent Multi-agent Game Computational Priority |
| Content Type | Text |
| Resource Type | Article |
