How do people play against Nash opponents in gameswhich have a mixed strategy equilibrium
Jason Shachat, Todd D. Swarthout
Abstract
Open-access reader
Jason Shachat, Todd D. Swarthout
Abstract
Open-access reader
We examine experimentally how humans behave when they, unbeknownst to them, play against a computer which implements its part of a mixed strategy Nash equilibrium. We consider two games, one zero-sum and another unprofitable with a pure minimax strategy. A minority of subjects' play was consistent with their Nash equilibrium strategy. But a larger percentage of subjects' play was more consistent with different models of play: equal-probable play for the zero-sum game, and the minimax strategy in the non-profitable game.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
We examine experimentally how humans behave when they, unbeknownst to them, play against a computer which implements its part of a mixed strategy Nash equilibrium. We consider two games, one zero-sum and another unprofitable with a pure minimax strategy. A minority of subjects' play was consistent with their Nash equilibrium strategy. But a larger percentage of subjects' play was more consistent with different models of play: equal-probable play for the zero-sum game, and the minimax strategy in the non-profitable game.
Key concepts: Nash equilibrium, Minimax, Best response, Mathematical economics, Strategy, Epsilon-equilibrium, Correlated equilibrium, Zero-sum game