Serialisability-Based Ranking

The serialisability-based ranking associates to any AF $F$ a ranking $\succeq^{\theta^{\mathsf{ser}}}_F$ on $A$ such that $\forall a,b \in A$ : $a \succeq^{\theta^{\mathsf{ser}}}_F b$ iff $\mathsf{ser}_F(a) \leq \mathsf{ser}_F(b)$ , where $\mathsf{ser}_F$ is the serialisation index.

Reference

Blümel, L. & Thimm, M. (2022). A Ranking Semantics for Abstract Argumentation Based on Serialisability. In: Computational Models of Argument (COMMA 2022), FAIA 353, pp. 104–115. IOS Press.