For those problems arena allocators tend to perform even better.

Yeah, but if you actually need to retain a live subgraph of the allocated heap, the arena can't help you. So you make an arena allocator that only frees its slab after moving out the reachable set to a new compacted arena. Congratulations, you've implemented a Cheney-style compacting GC!

Not for all allocation patterns. It's hard to beat bump pointer allocation and escape analysis in general.