Solving Decision Problems by Distributed Decomposition and Delegation

Foundations of a Theory and its Application within a Normative Group Decision Support System Framework
  • Oliver Wendt
  • Peter Rittgen
  • Wolfgang Koenig


This paper is based on the paradigm that the solution of a yet unstructured decision problem with discrete action alternatives requires planning of the problem solution process (the invention of a new solution) prior to the execution of this plan. First, we concentrate on the design of a distributed planning process using several agents (first phase of a decision process). Following a “modeling cost approach”, the foundations of a general theory of problem decomposition and delegation of sub-problems will be developed.

Based on this description of the decompositions and delegations using the domain independent and extendible language ANDORI, we derive rules to identify the particular region of a decomposition tree promising the best compromise between modeling cost and solution quality. That means that we provide means to select the optimal node to be decomposed next. Furthermore, models of task distribution to agents are evaluated. Finally, we describe a preliminary prototype of a group decision support system based on this theory as well as the organizational environment necessary for its application.


Decision Problem Leaf Node Search Tree Modeling Cost Search Cost 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. Aho, A.; Sethi R.; Ullman J.: Compilers: Principles, Techniques and Tools; Reading (Addison-Wesley) 1984.Google Scholar
  2. Finkel, R.A.; Manber U.: DIB — A distributed implementation of backtracking; ACM Trans. Prog. Lang. Syst. 9 (1987); pp. 235–256.CrossRefGoogle Scholar
  3. Garey, M.R,; Johnson, D.S.: Computers and Intractability; San Francisco (Freeman) 1979.Google Scholar
  4. Karp, R.M.; Zhang Y.: Randomized Parallel Algorithms for Backtrack Search and Branch-and-Bound Computation; Journal of the ACM 40 (1993); pp. 765–789.CrossRefGoogle Scholar
  5. Koenig, W.; Wendt O.: Optimale DV-Unterstützung der Logistik — dargestellt am Anwendungsbeispiel der Luftfrachtkommissionierung; submitted to Wirtschaftsinformatik.Google Scholar
  6. Pearl, J.: Heuristics: Intelligent search strategies for computer problem solving; Reading (Addison-Wesley) 1984.Google Scholar
  7. Wendt, O.; Rittgen P.: ANDORI Graphs — an Extension of AND/OR Graphs for Distributed Problem Solving and Reasoning; Research Paper (93-09); Institute of Applied Computer Sciences; Frankfurt University 1993.Google Scholar
  8. Wendt, O.; Rittgen P.: Coordination of Distributed Planning and Problem Solving; Research Paper (94-13); Institute of Applied Computer Sciences; Frankfurt University 1994.Google Scholar

Copyright information

© Springer-Verlag Berlin • Heidelberg 1996

Authors and Affiliations

  • Oliver Wendt
  • Peter Rittgen
  • Wolfgang Koenig

There are no affiliations available

Personalised recommendations