An Axiomatic Approach to Robustness in Search Problems with Multiple Scenarios

10/19/2012
by   Patrice Perny, et al.
0

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.

READ FULL TEXT
research
04/12/2023

When Should You Wait Before Updating? Toward a Robustness Refinement

Consider a dynamic network and a given distributed problem. At any point...
research
02/21/2022

Analysis of Two-Station Polling Queues with Setups using Continuous Time Markov Chain

The paper analyzes the performance of tandem network of polling queue wi...
research
06/24/2021

A Note on Exhaustive State Space Search for Efficient Code Generation

This note explores state space search to find efficient instruction sequ...
research
05/14/2019

Parallel and Memory-limited Algorithms for Optimal Task Scheduling Using a Duplicate-Free State-Space

The problem of task scheduling with communication delays is strongly NP-...
research
11/08/2017

Recency-weighted Markovian inference

We describe a Markov latent state space (MLSS) model, where the latent s...
research
01/21/2019

Optimal Task Scheduling Benefits From a Duplicate-Free State-Space

The NP-hard problem of task scheduling with communication delays (P|prec...
research
10/27/2020

Nonlinear State-Space Generalizations of Graph Convolutional Neural Networks

Graph convolutional neural networks (GCNNs) learn compositional represen...

Please sign up or login with your details

Forgot password? Click here to reset