vince3455

In a post office, open a letter, burn the envelope. The content now exists, but the message does not.

>models under which "it doesn't matter if you switch or not".

Could you provide an example? It seems obvious that a switcher wins exactly when a non switcher looses, which is 2 / 3 ?

Whenever you visit a node you need one edge to walk in and one to walk out, except for the first and last node. So all K_n with even n , you can walk all the edges. For odd n, you lose one edge per node, except for 2 of them