An axiomatic approach to robustness in search problems with multiple scenarios

Authors:
Patrice Perny;Olivier Spanjaard
Affiliations:
LIP6, University of Paris VI, Paris Cedex, France;LAMSADE, University of Paris IX, Paris Cedex, France
Venue:
UAI'03 Proceedings of the Nineteenth conference on Uncertainty in Artificial Intelligence
Year:
2002

Citing 10
Cited 3

Heuristics: intelligent search strategies for computer problem solving

Heuristics: intelligent search strategies for computer problem solving
On ordered weighted averaging aggregation operators in multicriteria decisionmaking

IEEE Transactions on Systems, Man and Cybernetics
Multiobjective A*

Journal of the ACM (JACM)
Multiobjective heuristic search in AND/OR graphs

Journal of Algorithms
Searching game trees under a partial order

Artificial Intelligence
A* with bounded costs

AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
On preference-based search in state space graphs

Eighteenth national conference on Artificial intelligence
A constraint satisfaction approach to the robust spanning tree problem with interval data

UAI'02 Proceedings of the Eighteenth conference on Uncertainty in artificial intelligence
Path planning under time-dependent uncertainty

UAI'95 Proceedings of the Eleventh conference on Uncertainty in artificial intelligence
Optimal factory scheduling using stochastic dominance A

UAI'96 Proceedings of the Twelfth international conference on Uncertainty in artificial intelligence

Search for Compromise Solutions in Multiobjective State Space Graphs

Proceedings of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy
State space search for risk-averse agents

IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Infinite order Lorenz dominance for fair multiagent optimization

Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 1

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper is devoted to the 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.