Burden-Based Ranking

The burden-based ranking associates to any AF $F$ a ranking $\succeq^{\theta^{\mathsf{Bbs}}}_F$ on $A$ such that $\forall a,b \in A$ : $a \succeq^{\theta^{\mathsf{Bbs}}}_F b$ iff $\mathsf{Bur}_F(a) \preceq_{\mathrm{lex}} \mathsf{Bur}_F(b)$ , where $\mathsf{Bur}_F$ is the burden number.

Reference

Amgoud, L. & Ben-Naim, J. (2013). Ranking-Based Semantics for Argumentation Frameworks. In: Scalable Uncertainty Management (SUM 2013), LNCS 8078, pp. 134–147. Springer.