Quantifying the Expected Utility of Information in Multi-agent Scheduling Tasks

Abstract. In this paper we investigate methods for analyzing the expected value of adding information in distributed task scheduling problems. As scheduling problems are NP-complete, no polynomial algorithms exist for evaluating the impact a certain constraint, or relaxing the same constraint, will have on the global problem. We present a general approach where local agents can estimate their problem tightness, or how constrained their local subproblem is. This allows these agents to immediately identify many problems which are not constrained, and will not benefit from sending or receiving further information. Next, agents use traditional machine learning methods based on their specific local problem attributes to attempt to identify which of the constrained problems will most benefit from human attention. We evaluated this approach within a distributed cTAEMS scheduling domain and found this approach was overall quite effective.

• Type: Conference
• Year: 2007
• Where: CIA
• Authors: Avi Rosenfeld, Sarit Kraus, Charlie Ortiz
• Keywords: Artificial Intelligence, CIA 2007, Scheduling Problems, Specific Local Problem, Task Scheduling Problems