MathNet 2011 Question 91

Each student of a group is friends with at least a half of the other students of this group. At the beginning, all students are partitioned into pairs according to the seats they occupy in the classroom. Per move any two students may swap their pairs.
Is it possible that after a finite number of such moves each pair consists of friends?