A Partial Folk Theorem for Games with Unknown Payoff Distributions
Thomas Wiseman
Abstract
Thomas Wiseman
Abstract
Repeated games with unknown payoff distributions are analogous to a single decision maker's “multi-armed bandit” problem. Each state of the world corresponds to a different payoff matrix of a stage game. When monitoring is perfect, information about the state is public, and players are sufficiently patient, the following result holds: For any function that maps each state to a payoff vector that is feasible and individually rational in that state, there is a sequential equilibrium in which players experiment to learn the realized state and achieve a payoff close to the one specified for that state.
OpenAlex reports 43 citations for this work. Citation counts describe recorded attention and do not establish research quality.
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.
Repeated games with unknown payoff distributions are analogous to a single decision maker's “multi-armed bandit” problem. Each state of the world corresponds to a different payoff matrix of a stage game. When monitoring is perfect, information about the state is public, and players are sufficiently patient, the following result holds: For any function that maps each state to a payoff vector that is feasible and individually rational in that state, there is a sequential equilibrium in which players experiment to learn the realized state and achieve a payoff close to the one specified for that state.
Key concepts: Stochastic game, Mathematical economics, State (computer science), Repeated game, Mathematics, Normal-form game, Function (biology), Folk theorem