Dartmouth College Department of Computer Science. Technical Report PCS-TR99-360. 1999. 8 стр.
The paper considers resource allocation in a network with mobile agents competing for computational priority. The authors formulate this problem as a multi-agent game with the players being agents purchasing service from a common server. Existens of a computable Nash equilibrium is proved, assuming that agents have perfect information into the future. Simulation of a network of hosts and agents using the suggested strategy shows that our resource-allocation mechanism effectively prioritizes agents according to their endowments.Abstract
1 Introduction
2 System Model
3 Single Agent Optimization
4 Existence of Nash Equilibrium for Multiple Agents at the Same Provider
5 Uniqueness of Nash Equilibrium for Multiple Agents at the Same Provider
6 Simulation and Results
7 Discussion and FutureWork
8 RelatedWork
9 Conclusion
Appendix
Acknowledgments
References
