Maria Kozlovskaya - Academia.edu (original) (raw)

Uploads

Papers by Maria Kozlovskaya

Subjects who played a payoff-maximising strategy against a computer algorithm (" sophisticates ")... more Subjects who played a payoff-maximising strategy against a computer algorithm (" sophisticates ") are more cooperative in a finitely repeated Prisoner's Dilemma than subjects who did not play a payoff-maximising strategy (" naifs "). The difference in cooperation rates increases as the subjects gain experience with the game. As a result, sophisticates earn more than naifs, when paired with players of their own type. This finding implies that cooperation in the game is not a result of reasoning fault.

Subjects who played a payoff-maximising strategy against a computer algorithm (" sophisticates ")... more Subjects who played a payoff-maximising strategy against a computer algorithm (" sophisticates ") are more cooperative in a finitely repeated Prisoner's Dilemma than subjects who did not play a payoff-maximising strategy (" naifs "). The difference in cooperation rates increases as the subjects gain experience with the game. As a result, sophisticates earn more than naifs, when paired with players of their own type. This finding implies that cooperation in the game is not a result of reasoning fault.

Log In