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

Avi Rosenfeld, S. Kraus, Charlie Ortiz

Research output: Chapter in Book/Report/Conference proceedingChapterpeer-review


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.
Original languageAmerican English
Title of host publicationCooperative Information Agents XI
EditorsMatthias Klusch, Koen V. Hindriks, Mike P. Papazoglou, Leon Sterling
PublisherSpringer Berlin Heidelberg
ISBN (Print)978-3-540-75119-9
StatePublished - 2007

Publication series

NameLecture Notes in Computer Science


Dive into the research topics of 'Quantifying the Expected Utility of Information in Multi-Agent Scheduling Tasks'. Together they form a unique fingerprint.

Cite this