Skip to main content
SpringerLink
Log in

On Possibly Optimal Tradeoffs in Multicriteria Spanning Tree Problems

  • Conference paper
  • First Online:
Algorithmic Decision Theory (ADT 2015)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 9346))

Included in the following conference series:

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Notes

  1. 1.

    We wish to thank an anonymous reviewer for pointing out this reference.

References

  1. Benabbou, N., Perny, P.: Combining preference elicitation and search in multiobjective state-space graphs. In: Proceedings of IJCAI 2015 (2015)

    Google Scholar 

  2. Benabbou, N., Perny, P.: Incremental weight elicitation for multiobjective state space search. In: Proceedings of AAAI 2015, pp. 1093–1099 (2015)

    Google Scholar 

  3. Benabbou, N., Perny, P., Viappiani, P.: Incremental elicitation of choquet capacities for multicriteria decision making. In: Proceedings of ECAI 2014, pp. 87–92 (2014)

    Google Scholar 

  4. 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)

    Article  MathSciNet  Google Scholar 

  5. Braziunas, D., Boutilier, C.: Minimax regret based elicitation of generalized additive utilities. In: Proceedings of UAI 2007, pp. 25–32 (2007)

    Google Scholar 

  6. Braziunas, D.: Decision-theoretic elicitation of generalized additive utilities. Ph.D. thesis, University of Toronto (2011)

    Google Scholar 

  7. Cayley, A.: A theorem on trees. Q. J. Math. 23, 376–378 (1889)

    MATH  Google Scholar 

  8. Chajewska, U., Koller, D., Parr, R.: Making rational decisions using adaptive utility elicitation. In: Proceedings of AAAI 2000, pp. 363–369 (2000)

    Google Scholar 

  9. Drummond, J., Boutilier, C.: Preference elicitation and interview minimization in stable matchings. In: Proceedings of AAAI 2014, pp. 645–653 (2014)

    Google Scholar 

  10. Ehrgott, M.: Multicriteria Optimization. Springer, Heidelberg (2006)

    MATH  Google Scholar 

  11. 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)

    Article  MathSciNet  Google Scholar 

  12. Hamacher, H.W., Ruhe, G.: On spanning tree problems with multiple objectives. Ann. Oper. Res. 52, 209–230 (1994)

    Article  MathSciNet  Google Scholar 

  13. Kalech, M., Kraus, S., Kaminka, G.A.: Practical voting rules with partial information. Auton. Agent. Multi-Agent Syst. 22(1), 151–182 (2010)

    Article  Google Scholar 

  14. Kruskal, J.B.: On the shortest spanning subtree of a graph and the traveling salesman problem. Proc. Am. Math. Soc. 7, 48–50 (1956)

    Article  MathSciNet  Google Scholar 

  15. Lu, T., Boutilier, C.: Robust approximation and incremental elicitation in voting protocols. In: Proceedings of IJCAI 2011, pp. 287–293 (2011)

    Google Scholar 

  16. 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)

    Article  MathSciNet  Google Scholar 

  17. Prim, R.C.: Shortest connection networks and some generalizations. Bell Syst. Tech. J. 36, 1389–1401 (1957)

    Article  Google Scholar 

  18. 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)

    Article  MathSciNet  Google Scholar 

  19. Regan, K., Boutilier, C.: Eliciting additive reward functions for markov decision processes. In: Proceedings of IJCAI 2011, pp. 2159–2164 (2011)

    Google Scholar 

  20. 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)

    Chapter  Google Scholar 

  21. Seipp, F.: On adjacency, cardinality, and partial dominance in discrete multiple objective optimization. Ph.D. thesis, Technischen Universitat Kaiserslautern (2013)

    Google Scholar 

  22. 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)

    Article  MathSciNet  Google Scholar 

  23. Wang, T., Boutilier, C.: Incremental utility elicitation with the minimax regret decision criterion. In: Proceedings of IJCAI 2003, pp. 309–316 (2003)

    Google Scholar 

  24. Weng, P., Zanuttini, B.: Interactive value iteration for Markov decision processes with unknown rewards. In: Proceedings of IJCAI 2013, pp. 2415–2421 (2013)

    Google Scholar 

Download references

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

  1. CNRS, LIP6 UMR 7606, Sorbonne Universités, UPMC Univ Paris 06, 4 Place Jussieu, 75005, Paris, France

    Nawal Benabbou & Patrice Perny

Authors
  1. Nawal Benabbou
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Patrice Perny
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Patrice Perny .

Editor information

Editors and Affiliations

  1. University of New South Wales, Kensington, Australia

    Toby Walsh

Rights and permissions

Reprints 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)

Publish with us

Policies and ethics

Search

Navigation