Can Gale-Shapley be used to find a stable friendship among a group of people who give a list of people they'd like to be friends with?
Could we create a stable and a whole couple of friends?
So lets say we got 4 people and their lists:
A: B, C, D
B: C, D, A
C: D, B, A
D: A, B, C
now A goes first and picks B.
and C goes and picks D.
D and B disagree with the matching. is this proof by counter example acceptable?