||Arrows impossibility theorem presents us with the problem in Voting Theory that no voting system can exist, which satisfies some basic properties, such as unanimity or non-dictatorship simultaneously. Furthermore, we know from the Gibbard-Satterthwaite theorem that any voting system can be manipulated. For this reason, Michel Balinski and Rida Laraki developed, a new concept for aggregating preferences, which is based on ratings of the candidates. In this seminar we will deal with the basics of the above theorems first and then with the Balinski and Laraki designed by Majority Judgment. We will also discuss some extensions and critical considerations of this model.