Notes on coalition lattices (Q1970931)

If \(P\) is a partially ordered set, then its subsets are called the coalitions of \(P\). For every coalitions \(X\) and \(Y\) of \(P\), \(X\leq Y\) means that there exists an injection \(\varphi:X\to Y\) such that \(x\leq \varphi(x)\) for each \(x\in X\). Then the set \({\mathcal L}(P)\) of all coalitions of \(P\) equipped with \(\leq\) is a partially ordered set. If \({\mathcal L}(P)\) is a lattice then \({\mathcal L}(P)\) is called the coalition lattice of \(P\). (Note that this concept has roots in game theory.) In the paper it is shown that every coalition lattice \({\mathcal L}(P)\) satisfies the Jordan-Hölder chain condition and that \({\mathcal L}(P)\) determines \(P\) up to isomorphism. Furthermore, a coalition \(X\) is said to be winning if \(P\setminus X\leq X\). The winning coalitions of a coalition lattice are shown to form a dual ideal in \({\mathcal L}(P)\).