We study the problem of controlling the arrivals to a single-server queue with general interarrival-time distribution and exponential service-time distribution (a GI/M/1 system). Control is exercised by accepting or rejecting arriving customers or by charging entering customers a toll or...

Given an acyclic network and a preference-order relation on paths, when and how can Bellman's principle of optimality be combined with interactive programming to efficiently locate an optimal path? We show that if preferences are defined via a collection of attributes, then, under common...