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

  • Avi Rosenfeld
  • Sarit Kraus
  • Charlie Ortiz
Conference paper

DOI: 10.1007/978-3-540-75119-9_8

Part of the Lecture Notes in Computer Science book series (LNCS, volume 4676)
Cite this paper as:
Rosenfeld A., Kraus S., Ortiz C. (2007) Quantifying the Expected Utility of Information in Multi-agent Scheduling Tasks. In: Klusch M., Hindriks K.V., Papazoglou M.P., Sterling L. (eds) Cooperative Information Agents XI. CIA 2007. Lecture Notes in Computer Science, vol 4676. Springer, Berlin, Heidelberg

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2007

Authors and Affiliations

  • Avi Rosenfeld
    • 1
    • 2
  • Sarit Kraus
    • 2
  • Charlie Ortiz
    • 3
  1. 1.Department of Industrial Engineering, Jerusalem College of Technology, JerusalemIsrael
  2. 2.Department of Computer Science Bar Ilan University, Ramat GanIsrael
  3. 3.SRI International, 333 Ravenswood Avenue Menlo Park, CA 94025-3493USA

Personalised recommendations