Abstract
In this paper, we propose an interactive approach to determine a compromise solution in the multicriteria spanning tree problem. We assume that the Decision Maker’s preferences over spanning trees can be represented by a weighted sum of criteria but that weights are imprecisely known. In the first part of the paper, we propose a generalization of Prim’s algorithm to determine the set of possibly optimal tradeoffs. In the second part, we propose an incremental weight elicitation method to reduce the set of feasible weights so as to identify a necessary optimal tradeoff. Numerical tests are given to demonstrate the practical feasibility of the approach.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
We wish to thank an anonymous reviewer for pointing out this reference.
References
Benabbou, N., Perny, P.: Combining preference elicitation and search in multiobjective state-space graphs. In: Proceedings of IJCAI 2015 (2015)
Benabbou, N., Perny, P.: Incremental weight elicitation for multiobjective state space search. In: Proceedings of AAAI 2015, pp. 1093–1099 (2015)
Benabbou, N., Perny, P., Viappiani, P.: Incremental elicitation of choquet capacities for multicriteria decision making. In: Proceedings of ECAI 2014, pp. 87–92 (2014)
Boutilier, C., Patrascu, R., Poupart, P., Schuurmans, D.: Constraint-based optimization and utility elicitation using the minimax decision criterion. Artif. Intell. 170(8–9), 686–713 (2006)
Braziunas, D., Boutilier, C.: Minimax regret based elicitation of generalized additive utilities. In: Proceedings of UAI 2007, pp. 25–32 (2007)
Braziunas, D.: Decision-theoretic elicitation of generalized additive utilities. Ph.D. thesis, University of Toronto (2011)
Cayley, A.: A theorem on trees. Q. J. Math. 23, 376–378 (1889)
Chajewska, U., Koller, D., Parr, R.: Making rational decisions using adaptive utility elicitation. In: Proceedings of AAAI 2000, pp. 363–369 (2000)
Drummond, J., Boutilier, C.: Preference elicitation and interview minimization in stable matchings. In: Proceedings of AAAI 2014, pp. 645–653 (2014)
Ehrgott, M.: Multicriteria Optimization. Springer, Heidelberg (2006)
Gelain, M., Pini, M.S., Rossi, F., Venable, K.B., Walsh, T.: Elicitation strategies for soft constraint problems with missing preferences: properties, algorithms and experimental studies. Artif. Intell. J. 174(3–4), 270–294 (2010)
Hamacher, H.W., Ruhe, G.: On spanning tree problems with multiple objectives. Ann. Oper. Res. 52, 209–230 (1994)
Kalech, M., Kraus, S., Kaminka, G.A.: Practical voting rules with partial information. Auton. Agent. Multi-Agent Syst. 22(1), 151–182 (2010)
Kruskal, J.B.: On the shortest spanning subtree of a graph and the traveling salesman problem. Proc. Am. Math. Soc. 7, 48–50 (1956)
Lu, T., Boutilier, C.: Robust approximation and incremental elicitation in voting protocols. In: Proceedings of IJCAI 2011, pp. 287–293 (2011)
Naamani-Dery, L., Kalech, M., Rokach, L., Shapira, B.: Reaching a joint decision with minimal elicitation of voter preferences. Inf. Sci. 278, 466–487 (2014)
Prim, R.C.: Shortest connection networks and some generalizations. Bell Syst. Tech. J. 36, 1389–1401 (1957)
White III, C.C., Sage, A.P., Dozono, S.: A model of multiattribute decisionmaking and trade-off weight determination under uncertainty. IEEE Trans. Syst. Man Cybern. 14(2), 223–229 (1984)
Regan, K., Boutilier, C.: Eliciting additive reward functions for markov decision processes. In: Proceedings of IJCAI 2011, pp. 2159–2164 (2011)
Ruzika, S., Hamacher, H.W.: A survey on multiple objective minimum spanning tree problems. In: Lerner, J., Wagner, D., Zweig, K.A. (eds.) Algorithmics of Large and Complex Networks, pp. 104–116. Springer, Heidelberg (2009)
Seipp, F.: On adjacency, cardinality, and partial dominance in discrete multiple objective optimization. Ph.D. thesis, Technischen Universitat Kaiserslautern (2013)
Sourd, F., Spanjaard, O.: A multiobjective branch-and-bound framework: application to the biobjective spanning tree problem. INFORMS J. Comput. 20(3), 472–484 (2008)
Wang, T., Boutilier, C.: Incremental utility elicitation with the minimax regret decision criterion. In: Proceedings of IJCAI 2003, pp. 309–316 (2003)
Weng, P., Zanuttini, B.: Interactive value iteration for Markov decision processes with unknown rewards. In: Proceedings of IJCAI 2013, pp. 2415–2421 (2013)
Acknowledgments
This work is part of the ELICIT project supported by the French National Research Agency through the Idex Sorbonne Universités under grant ANR-11-IDEX-0004-02.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Benabbou, N., Perny, P. (2015). On Possibly Optimal Tradeoffs in Multicriteria Spanning Tree Problems. In: Walsh, T. (eds) Algorithmic Decision Theory. ADT 2015. Lecture Notes in Computer Science(), vol 9346. Springer, Cham. https://doi.org/10.1007/978-3-319-23114-3_20
Download citation
DOI: https://doi.org/10.1007/978-3-319-23114-3_20
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-23113-6
Online ISBN: 978-3-319-23114-3
eBook Packages: Computer ScienceComputer Science (R0)