The Sixth International Conference on Computing in Economics and Finance
Department of Computer Science
Mobile-agent systems allow user programs to autonomously relocate from one host site to another. This autonomy provides a powerful, flexible architecture on which to build distributed applications. The asynchronous, decentralized nature of mobile-agent systems makes them flexible, but also hinders their deployment. We argue that a market-based approach where agents buy computational resources from their hosts solves many problems faced by mobile-agent systems. \par In our earlier work, we propose a policy for allocating general computational priority among agents posed as a competitive game for which we derive a unique computable Nash equilibrium. Here we improve on our earlier approach by implementing resource guarantees where mobile-agent hosts issue call options on computational resources. Call options allow an agent to reserve and guarantee the cost and time necessary to complete its itinerary before the agent begins execution. \par We present an algorithm based upon the binomial options-pricing model that estimates future congestion to allow hosts to evaluate call options; methods for agents to measure the risk associated with their performance and compare their expected utility of competing in the computational spot market with utilizing resource options; and test our theory with simulations to show that option trade reduces variance in agent completion times.
Jonathan Bredin, David Kotz, and Daniela Rus. Trading Risk in Mobile-Agent Computational Markets. In the Sixth International Conference on Computing in Economics and Finance, July 2007.
Dartmouth Digital Commons Citation
Bredin, Jonathan; Kotz, David; and Rus, Daniela, "Trading Risk in Mobile-Agent Computational Markets" (2000). Dartmouth Scholarship. 3063.