common knowledge

In a game, a fact (such as the rules of the game) is common knowledge for the player if:

All the players know the fact.
All the players know that all the players know the fact.
All the players know that all the players know that all the players know the fact.
$\\cdots$

This is a much stronger condition than merely having all the players know the fact. By way of illustration, consider the following example:

There are three participants and an experimenter. The experimenter informs them that a hat, either blue or red, will be placed on their head so that the other participants can see it but the wearer cannot. The experimenter then puts red hats on each person and asks whether any of them know what color hat they have. Of course, none of them do. The experimenter then whispers to each of them that at least two people have red hats, and then asks out loud whether any of them know what color hat they have. Again, none of them do. Finally the experimenter announces out loud that at least two people have red hats, and asks whether any of them know what color hat they have. After a few seconds, all three realize that they must have red hats, since if they had a blue hat then both of the other people could have figured out that their own hat was red.

The significant thing about this example is that the fact that at least two of the participants have red hats was known to every participant from the beginning, but only once they knew that the other people also knew that could they figure out their own hat’s color. (This is only the second requirement in the list above, but more complicated examples can be constructed for any level in the infinite list).

单词	CommonKnowledge
释义	common knowledge In a game, a fact (such as the rules of the game) is common knowledge for the player if: All the players know the fact. All the players know that all the players know the fact. All the players know that all the players know that all the players know the fact. $\\cdots$ This is a much stronger condition than merely having all the players know the fact. By way of illustration, consider the following example: There are three participants and an experimenter. The experimenter informs them that a hat, either blue or red, will be placed on their head so that the other participants can see it but the wearer cannot. The experimenter then puts red hats on each person and asks whether any of them know what color hat they have. Of course, none of them do. The experimenter then whispers to each of them that at least two people have red hats, and then asks out loud whether any of them know what color hat they have. Again, none of them do. Finally the experimenter announces out loud that at least two people have red hats, and asks whether any of them know what color hat they have. After a few seconds, all three realize that they must have red hats, since if they had a blue hat then both of the other people could have figured out that their own hat was red. The significant thing about this example is that the fact that at least two of the participants have red hats was known to every participant from the beginning, but only once they knew that the other people also knew that could they figure out their own hat’s color. (This is only the second requirement in the list above, but more complicated examples can be constructed for any level in the infinite list).
随便看	path path Path1 PathAlgebraOfADisconnectedQuiver path algebra of a disconnected quiver PathAlgebraOfAQuiver path algebra of a quiver PathComponent path component pathConnectnessAsAHomotopyInvariant (path) connectness as a homotopy invariant Path Induction PathIntegral path integral Pathological pathological Pattern matching and recursion PaulAndreMeyer Paul-André Meyer PaulEhrenfest Paul Ehrenfest PauliMatrices Pauli matrices PaulLevyContinuityTheorem Paul Lévy continuity theorem