The payoff matrix of a finite stage game is realized randomly, and then the stage game is repeated infinitely. The distribution over states of the world (a state corresponds to a payoff matrix) is commonly known, but players do not observe nature’s choice. Over time, they can learn the state...

We propose an extension to smooth fictitious play and prove that play converges to an ε-Markov perfect equilibrium with probability one in a class of stochastic games known as Markov potential games. We then prove a partial Folk theorem for repeated games under one-period perfect monitoring. We...

We examine collaboration in a one-arm bandit problem in which the players' actions affect the distribution over future payoffs. The players need to exert costly effort both to enhance the value of a risky technology and to learn about its current state. Both product value and learning are public...

Stochastic fictitious play (SFP) assumes that agents do not try to influence the future play of their current opponents, an assumption that is justified by appeal to a setting with a large population of players who are randomly matched to play the game. However, the dynamics of SFP have only...

Game theory has been employed traditionally as a modeling tool for describing and influencing behavior in societal systems. Recently, game theory has emerged as a valuable tool for controlling or prescribing behavior in distributed engineered systems. The rationale for this new perspective stems...