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

Authors:
Avi Rosenfeld;Sarit Kraus;Charlie Ortiz
Affiliations:
Department of Industrial Engineering, Jerusalem College of Technology, Jerusalem, Israel and Department of Computer Science Bar Ilan University, Ramat Gan, Israel;Department of Computer Science Bar Ilan University, Ramat Gan, Israel;SRI International, 333 Ravenswood Avenue Menlo Park, CA 94025-3493, USA
Venue:
CIA '07 Proceedings of the 11th international workshop on Cooperative Information Agents XI
Year:
2007

Citing 12
Cited 0

MetaCost: a general method for making classifiers cost-sensitive

KDD '99 Proceedings of the fifth ACM SIGKDD international conference on Knowledge discovery and data mining
Machine Learning

Machine Learning
The Distributed Constraint Satisfaction Problem: Formalization and Algorithms

IEEE Transactions on Knowledge and Data Engineering
Resource-aware exploration of the emergent dynamics of simulated systems

AAMAS '03 Proceedings of the second international joint conference on Autonomous agents and multiagent systems
Evolution of the GPGP/TÆMS Domain-Independent Coordination Framework

Autonomous Agents and Multi-Agent Systems
Taking DCOP to the Real World: Efficient Complete Solutions for Distributed Multi-Event Scheduling

AAMAS '04 Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems - Volume 1
Solving Distributed Constraint Optimization Problems Using Cooperative Mediation

AAMAS '04 Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems - Volume 1
Agent interaction in distributed POMDPs and its implications on complexity

AAMAS '06 Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems
Data Mining: Practical Machine Learning Tools and Techniques, Second Edition (Morgan Kaufmann Series in Data Management Systems)

Data Mining: Practical Machine Learning Tools and Techniques, Second Edition (Morgan Kaufmann Series in Data Management Systems)
Estimating information value in collaborative multi-agent planning systems

Proceedings of the 6th international joint conference on Autonomous agents and multiagent systems
Towards adjustable autonomy for the real world

Journal of Artificial Intelligence Research
Where the really hard problems are

IJCAI'91 Proceedings of the 12th international joint conference on Artificial intelligence - Volume 1

Quantified Score

Hi-index	0.00

Visualization

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.