Abstract
We describe a class of problems motivated by numerous real-world applications where there is a collection of objects that have both a cost and a value, but where some of those objects depend upon other objects to obtain their full value. Applications include finding an optimal order for transferring files under threat of system failure, ordering sequences of actions by a heterogeneous team of agents or robots, picking an optimal set of products to store in a warehouse, selecting courses to take at a university, or picking what products to cut from production. We formalize the problem of representing objects and their dependence relationships as a directed acyclic graph (DAG). We define simple formulae for calculating the utility of both sets and sequences of graph vertices. We motivate, using real-world examples, a taxonomy of problems associated with the model we present. We also prove that two variants of problems associated with our formalism are NP-hard, and present an efficient algorithm for solving a restricted version of a third problem.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Chakrabarti, P. P., Ghose, S., & DeSarkar, S. C. (1988). Best first search in and/or graphs. In Proceedings of the 1988 ACM sixteenth annual conference on computer science (pp. 256–261). New York: Assoc. Comput. Mech.
Das, S., & Kamenica, E. (2005). Two-sided bandits and the dating market. In Proceedings of the international joint conference on artificial intelligence (IJCAI-05) (pp. 947–952).
Desmedt, Y., & Wang, Y. (2002). Maximum flows and critical vertices in and/or graphs. In Computing and combinatorics: 8th annual international conference (pp. 238–248). Berlin: Springer.
Dignum, V., & Dignum, F. (2005). Task and social coordination in agent organizations. In Proceedings of the fourth international joint conference on Autonomous agents and multiagent systems (pp. 1183–1184).
Faltings, B., & Nguyen, Q. H. (2005). Multi-agent coordination using local search. In Proceedings of the international joint conference on artificial intelligence (IJCAI-05) (pp. 953–958).
Feldman, R. (1988). Design of a dependency-directed compiler for constraint propagation. In IEA/AIE ’88: Proceedings of the 1st international conference on Industrial and engineering applications of artificial intelligence and expert systems (pp. 141–146). New York: Assoc. Comput. Mech.
Garey, M. R., & Johnson, D. S. (1979). Computers and intractability: A guide to the theory of np-completeness. New York: Freeman.
Gusfield, D., & Irving, R. W. (1989). The stable marriage problem: structure and algorithms. Cambridge: MIT Press.
Hunsberger, L. (2005). A framework for specifying group decision-making mechanisms. In Proceedings of the fourth international joint conference on Autonomous agents and multiagent systems (pp. 1191–1192).
Isbell, C., Omojokun, O., & Pierce, J. (2004). From devices to tasks: Automatic task prediction for personalized appliance control. Personal and Ubiquitous Computing, 3, 146–153.
Kann, V. (2003). Maximum edge subgraph. In A compendium of NP optimization problems. http://www.ensta.fr/~diam//ro/online/viggo_wwwcompendium/node46.html.
Kwok, Y.-K., & Ahmad, I. (1998). Benchmarking the task graph scheduling algorithms. In Proceedings of the first merged international conference and symposium on parallel and distributed processing (pp. 531–537). New York: IEEE Press.
Mahanti, A., & Bagchi, A. (1985). And/or graph heuristic search methods. Journal of the ACM, 32(1), 28–51.
McCulloch, W., & Pitts, W. (1943). A logical calculus of ideas immanent in nervous activity. Bulletin of Mathematical Biophysics, 5, 115–133.
Nilsson, N. J. (1980). Principles of artificial intelligence. San Mateo: Morgan Kaufmann.
Pearce, J. P., Maheswaran, R. T., & Tambe, M. (2004). Dcop games for multi-agent coordination. In CP 2004 workshop on distributed constraint reasoning (DCR-04).
Roberts, D. L., Bhat, S., Isbell, C. L., Cooper, B. F., & Pierce, J. S. (2006). A decision-theoretic approach to file consistency in constrained peer-to-peer device networks. In Proceedings of the fifth international joint conference on autonomous agents and multiagent systems. Hakodate, Japan.
Zhu, D., Mossé, D., & Melhem, R. (2004). Power-aware scheduling for and/or graphs in real-time systems. In IEEE transactions of parallel and distributed systems (pp. 849–864). Los Alamitos: IEEE Comput. Soc.
Author information
Authors and Affiliations
Corresponding author
Additional information
Part of this research was performed while on appointment as a U.S. Department of Homeland Security (DHS) Fellow under the DHS Scholarship and Fellowship Program, a program administered by the Oak Ridge Institute for Science and Education (ORISE) for DHS through an interagency agreement with the U.S. Department of Energy (DOE). ORISE is managed by Oak Ridge Associated Universities under DOE contract number DE-AC05-00OR22750. All opinions expressed in this paper are the author’s and do not necessarily reflect the policies and views of DHS, DOE, or ORISE.
Rights and permissions
About this article
Cite this article
Roberts, D.L., Isbell, C.L. & Littman, M.L. Optimization problems involving collections of dependent objects. Ann Oper Res 163, 255–270 (2008). https://doi.org/10.1007/s10479-008-0350-1
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10479-008-0350-1