Adaptive arrivals and joint policy selection

Investigate deletion ordering when requests arrive adaptively and when the request-wise update policy is selected jointly with the execution order.

Background

The analysis conditions on a fixed finite batch of deletion requests, a fixed request-wise policy, and a fixed terminal objective; only the order of the pending requests is optimized. Consequently, it does not resolve settings in which requests arrive adaptively or in which the update policy itself is chosen together with the order.

The paper explicitly identifies both adaptive arrivals and joint policy selection as unresolved extensions. These directions would broaden the modeled decision problem beyond permutation optimization under a fixed sequential policy.

References

Adaptive arrivals, joint policy selection, and exact complexity under contraction bounded away from one remain open; the last boundary is detailed in Appendix A.2.

— When Is Deletion Ordering Tractable? From Update Dynamics to Permutation Structure  (2610.01149 - Wang et al., 1 Oct 2026) in Section F, Limitations and Scope