@techreport{bredin:lottery-tr, 
    author = {Jonathan Bredin and David Kotz and Daniela Rus}, 
    title = {Mobile-Agent Planning in a Market-Oriented Environment}, 
    year = {1999}, 
    month = {May}, 
    number = {PCS-TR99-345}, 
    institution = {Dept. of Computer Science, Dartmouth College}, 
    copyright = {the authors}, 
    note = {Revision 1 of May 20, 1999}, 
    later = {bredin:lottery}, 
    url = {http://www.cs.dartmouth.edu/~dfk/papers/bredin-lottery-tr.pdf}, 
    keyword = {mobile agent, market-based control, scheduling, dfk}, 
    abstract = {We propose a method for increasing incentives for sites to host
arbitrary mobile agents in which mobile agents purchase their computing needs
from host sites. We present a scalable market-based CPU allocation policy and
an on-line algorithm that plans a mobile agent's expenditure over a multihop
ordered itinerary. The algorithm chooses a set of sites at which to execute
and computational priorities at each site to minimize execution time while
preserving a prespecified budget constraint. We present simulation results of
our algorithm to show that our allocation policy and planning algorithm scale
well as more agents are added to the system.}
}