On Concept Lattices of Efficiently Solvable Voting Protocols

Abstract

It is shown that concept lattices can be attached in a natural way to any voting protocol. The concept lattices of some voting protocols that are solvable with respect to some prominnent solution concepts and outcome-efficient are studied: it is proved that they typically amount to chains