There are these options:

1 - (1,1,1);

nobody - (1,2,3);

nobody - (1,3,2);

3 - (1,3,3);

2 - (1,2,2);

1 - (1,1,3);

1 - (1,3,1);

1 - (1,2,1);

1 - (1,1,2);

3 - (2,3,3);

2 - (2,2,3);

2 - (2,3,2);

1 - (2,1,1);

2 - (2,1,2);

2 - (2,2,1);

2 - (1,2,2);

nobody - (2,3,1);

nobody - (2,1,3);

2 - (2,2,2);

1 - (3,1,1);

2 - (3,2,2);

3 - (3,3,2);

3 - (3,1,3);

3 - (3,3,1);

nobody - (3,2,1);

nobody - (3,1,2).

If no one has won, then all models of independence can be considered good. A player who feels that way can keep his model or accept the model of any of the other two players. Or we could assume all three models are bad. A player who feels that way can abandon his model and look for another. So there’s a way out of a situation where no one wins.