Hierarchies in Voting Simple Games

A work by Friedman, McGrath and Parker introduced the concept of a hierarchy of a simple voting game and characterized which hierarchies, induced by the desirability relation, are achievable in weighted games. They proved that no more hierarchies are obtainable if weighted games are replaced by the larger class of linear games.
In a subsequent paper by Freixas and Pons, it was proved that only four hierarchies, conserving the ordinal equivalence between the Shapley–Shubik and the Penrose–Banzhaf–Coleman power indices, are non–achievable in simple games. It was also proved that all achievable hierarchies are obtainable in the class of weakly linear games.
In this paper, we define a new class of totally pre–ordered games, the almost linear games, smaller than the class of weakly linear games, and prove that all hierarchies achievable in simple games are already achievable in almost linear games.