An Axiomatic Approach to Robustness in Search Problems with Multiple Scenarios - Université Pierre et Marie Curie Accéder directement au contenu
Communication Dans Un Congrès Année : 2003

An Axiomatic Approach to Robustness in Search Problems with Multiple Scenarios

Olivier Spanjaard

Résumé

This paper is devoted to the search of robust solutions in state space graphs when costs depend on scenarios. We first present axiomatic requirements for preference compatibility with the intuitive idea of robustness.This leads us to propose the Lorenz dominance rule as a basis for robustness analysis. Then, after presenting complexity results about the determination of robust solutions, we propose a new sophistication of A* specially designed to determine the set of robust paths in a state space graph. The behavior of the algorithm is illustrated on a small example. Finally, an axiomatic justification of the refinement of robustness by an OWA criterion is provided.
Fichier principal
Vignette du fichier
pub_221_1_pposuai03.pdf (145.82 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01533744 , version 1 (30-06-2017)

Identifiants

  • HAL Id : hal-01533744 , version 1

Citer

Patrice Perny, Olivier Spanjaard. An Axiomatic Approach to Robustness in Search Problems with Multiple Scenarios. 19th conference on Uncertainty in Artificial Intelligence, Aug 2003, Acapulco, Mexico. pp.469-476. ⟨hal-01533744⟩
53 Consultations
23 Téléchargements

Partager

Gmail Facebook X LinkedIn More