Skip to main content
SpringerLink
Log in

Anytime Algorithms for Adaptive Robust Optimization with OWA and WOWA

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

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

Included in the following conference series:

Abstract

We consider optimization problems in graphs where the utilities of solutions depend on different scenarios. In this context, we study incremental approaches for the determination of robust solutions, i.e. solutions yielding good outcomes in all scenarios. Our approach consists in interleaving adaptive preference elicitation methods aiming to assess the attitude of the Decision Maker towards robustness or risk with combinatorial optimization algorithms aiming to determine a robust solution. Our work focuses on the use of ordered weighted average (OWA) and weighted ordered weighted average (WOWA) to respectively model preferences under uncertainty and risk while accounting for the idea of robustness. These models are parameterized by weighting coefficients or weighting functions that must be fitted to the value system of the Decision Maker. We introduce and justify anytime algorithms for the adaptive elicitation of these parameters until a robust solution can be determined. We also test these algorithms on the robust assignment problem.

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

References

  1. Aissi, H., Bazgan, C., Vanderpooten, D.: Complexity of the minmax and minmax regret assignment problems. OR Lett. 33(6), 634–640 (2005)

    MATH  Google Scholar 

  2. Aron, I.D., Van Hentenryck, P.: On the complexity of the robust spanning tree problem with interval data. OR Lett. 32(1), 36–40 (2004)

    MathSciNet  MATH  Google Scholar 

  3. Benabbou, N., Perny, P.: Incremental weight elicitation for multiobjective state space search. In: Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, pp. 1093–1099 (2015)

    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. Deı, V.G., Woeginger, G.J.: On the robust assignment problem under a fixed number of cost scenarios. OR Lett. 34(2), 175–179 (2006)

    MathSciNet  Google Scholar 

  6. Eppstein, D.: Finding the k shortest paths. SIAM J. Comput. 28(2), 652–673 (1998)

    Article  MathSciNet  Google Scholar 

  7. Galand, L., Spanjaard, O.: Exact algorithms for OWA-optimization in multiobjective spanning tree problems. Comput. Oper. Res. 39(7), 1540–1554 (2012)

    Article  MathSciNet  Google Scholar 

  8. Heinen, T., Nguyen, N.-T., Rothe, J.: Fairness and rank-weighted utilitarianism in resource allocation. In: Walsh, T. (ed.) ADT 2015. LNCS (LNAI), vol. 9346, pp. 521–536. Springer, Cham (2015). doi:10.1007/978-3-319-23114-3_31

    Chapter  Google Scholar 

  9. Hong, C.S., Karni, E., Safra, Z.: Risk aversion in the theory of expected utility with rank dependent probabilities. J. Econ. Theory 42(2), 370–381 (1987)

    Article  MathSciNet  Google Scholar 

  10. Jiménez, V.M., Marzal, A.: A lazy version of Eppstein’s K shortest paths algorithm. In: Jansen, K., Margraf, M., Mastrolilli, M., Rolim, J.D.P. (eds.) WEA 2003. LNCS, vol. 2647, pp. 179–191. Springer, Heidelberg (2003). doi:10.1007/3-540-44867-5_14

    Chapter  Google Scholar 

  11. Kouvelis, P., Yu, G.: Robust Discrete Optimization and Its Applications, vol. 14. Springer Science & Business Media, New York (2013)

    MATH  Google Scholar 

  12. Lesca, J., Perny, P.: LP solvable models for multiagent fair allocation problems. In: Proceedings of the 2010 Conference on ECAI 2010: 19th European Conference on Artificial Intelligence, pp. 393–398. IOS Press (2010)

    Google Scholar 

  13. Marshall, A.W., Olkin, I., Arnold, B.C.: Inequalities: Theory of Majorization and Its Applications, vol. 143. Springer, New York (1979)

    MATH  Google Scholar 

  14. Montemanni, R., Gambardella, L.M.: An exact algorithm for the robust shortest path problem with interval data. Comput. Oper. Res. 31(10), 1667–1680 (2004)

    Article  MathSciNet  Google Scholar 

  15. Murthy, I., Her, S.-S.: Solving min-max shortest-path problems on a network. Nav. Res. Logist. (NRL) 39(5), 669–683 (1992)

    Article  MathSciNet  Google Scholar 

  16. Murthy, K.G.: An algorithm for ranking all the assignments in order of increasing costs. Oper. Res. 16(3), 682–687 (1968)

    Article  Google Scholar 

  17. Ogryczak, W.: Multicriteria models for fair resource allocation. Control Cybern. 36(2), 303–332 (2007)

    MathSciNet  MATH  Google Scholar 

  18. Perny, P., Spanjaard, O., Storme, L.-X.: A decision-theoretic approach to robust optimization in multivalued graphs. Ann. Oper. Res. 147(1), 317–341 (2006)

    Article  MathSciNet  Google Scholar 

  19. Perny, P., Viappiani, P., Boukhatem, A.: Incremental preference elicitation for decision making under risk with the rank-dependent utility model. In: Proceedings of UAI 2016 (2016)

    Google Scholar 

  20. Ramsay, J.O.: Monotone regression spline in action. Stat. Sci. 3, 425–441 (1988)

    Article  Google Scholar 

  21. Stiglitz, J.E., Rothschild, M.: Increasing risk. I. A definition. J. Econ. Theory 2(3), 225–243 (1970)

    Article  MathSciNet  Google Scholar 

  22. Torra, V.: The weighted OWA operator. Int. J. Intell. Syst. 12, 153–166 (1997)

    Article  Google Scholar 

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

    Google Scholar 

  24. Wu, W., Iori, M., Martello, S., Yagiura, M.: Algorithms for the min-max regret generalized assignment problem with interval data. In: Proceedings of IEEM, pp. 734–738. IEEE (2014)

    Google Scholar 

  25. Yaari, M.E.: The dual theory of choice under risk. Econometrica 55, 95–115 (1987)

    Article  MathSciNet  Google Scholar 

  26. Yager, R.R.: On ordered weighted averaging aggregation operators in multicriteria decision making. IEEE Trans. Syst. Man Cybern. 18, 183–190 (1998)

    Article  Google Scholar 

  27. Yaman, H., Karaşan, O.E., Pınar, M.Ç.: The robust spanning tree problem with interval data. Oper. Res. Lett. 29(1), 31–40 (2001)

    Article  MathSciNet  Google Scholar 

  28. Gang, Y.: Min-max optimization of several classical discrete optimization problems. J. Optim. Theory Appl. 98(1), 221–242 (1998)

    Article  MathSciNet  Google Scholar 

  29. Gang, Y., Yang, J.: On the robust shortest path problem. Comput. Oper. Res. 25(6), 457–468 (1998)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

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

    Nadjet Bourdache & Patrice Perny

Authors
  1. Nadjet Bourdache
    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. Heinrich Heine University, Düsseldorf, Germany

    Jörg Rothe

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this paper

Cite this paper

Bourdache, N., Perny, P. (2017). Anytime Algorithms for Adaptive Robust Optimization with OWA and WOWA. In: Rothe, J. (eds) Algorithmic Decision Theory. ADT 2017. Lecture Notes in Computer Science(), vol 10576. Springer, Cham. https://doi.org/10.1007/978-3-319-67504-6_7

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-67504-6_7

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-67503-9

  • Online ISBN: 978-3-319-67504-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation