We study the notion of robustness in stable matching problems. We first define robustness by introducing (a,b)-supermatches. An (a, b)-supermatch is a stable matching in which if any a pairs break up it is possible to find another stable matching by changing the partners of those a pairs and the partners of at most b other pairs. In this context, we define the most robust stable matching as a (...

The influence of a range of actors is discernible in nutrition projects during the period after the Second World War in the South Pacific. Influences include: international trends in nutritional science, changing ideas within the British establishment about state responsibility for the welfare of its citizens and the responsibility of the British Empire for its subjects; the mixture of outside ...

The 2022 World Fair (aka ‘Expo’) held in Dubai has recently drawn to a close. next Expo will be hosted by Buenos Aires 2023; the one after that staged Osaka 2025. These Expos are all linked first of them all: Great Exhibition London 1851. To sure, term ‘great’ is an understatement. 1851 event, and those followed it, were—and remain—colossal undertakings. They take years planning, attract millio...

In cooperative pathfinding problems, non-interfering paths that bring each agent from its current state to its goal state must be planned for multiple agents. We present the first practical, admissible, and complete algorithm for solving problems of this kind. First, we propose a technique called operator decomposition, which can be used to reduce the branching factors of many search algorithms...

Most research in evolutionary dynamic optimization is based on the assumption that the primary goal in solving Dynamic Optimization Problems (DOPs) is Tracking Moving Optimum (TMO). Yet, TMO is impractical in cases where keeping changing solutions in use is impossible. To solve DOPs more practically, a new formulation of DOPs was proposed recently, which is referred to as Robust Optimization Ov...