# Parallel Belief Revision via Order Aggregation

arXiv: https://arxiv.org/abs/2505.13914 · HTML: https://mlsanity.com/paper/2505.13914/

## Key facts

- No citing papers in the map yet (data through 14 Oct 2026).
- Builds on 3 of its 30 references that are in the map.
- First posted on arXiv 20 May 2025.

## Builds on (most cited first, 3 of 3)

- [On Strengthening the Logic of Iterated Belief Revision: Proper Ordinal Interval Operators](https://mlsanity.com/paper/1807.09942/) (2018)
- [Elementary Iterated Revision and the Levi Identity](https://mlsanity.com/paper/1907.01224/) (2019)
- [Parallel Belief Contraction via Order Aggregation](https://mlsanity.com/paper/2501.13295/) (2025)

## Abstract (arXiv)

Despite efforts to better understand the constraints that operate on single-step parallel (aka "package", "multiple") revision, very little work has been carried out on how to extend the model to the iterated case. A recent paper by Delgrande & Jin outlines a range of relevant rationality postulates. While many of these are plausible, they lack an underlying unifying explanation. We draw on recent work on iterated parallel contraction to offer a general method for extending serial iterated belief revision operators to handle parallel change. This method, based on a family of order aggregators known as TeamQueue aggregators, provides a principled way to recover the independently plausible properties that can be found in the literature, without yielding the more dubious ones.