We study a two-person zero-sum game where players simultaneously choose sequences of actions, and the overall payoff is the average of a one-shot payoff over the joint sequence. We consider the maxmin value of the game played in pure strategies by boundedly rational players and model bounded...

We study a two-person zero-sum game where players simultaneously choose sequences of actions, and the overall payoff is the average of a one-shot payoff over the joint sequence. We consider the maxmin value of the game played in pure strategies by boundedly rational players and model bounded...

This paper studies a repeated minority game with public signals, symmetric bounded recall, and pure strategies. We investigate both public and private equilibria of the game with fixed recall size. We first show how public equilibria in such a repeated game can be represented as colored...

This paper studies a repeated minority game with public signals, symmetric bounded recall, and pure strategies. We investigate both public and private equilibria of the game with fixed recall size. We first show how public equilibria in such a repeated game can be represented as colored...

We study a two-person zero-sum game where players simultaneously choose sequences of actions, and the overall payoff is the average of a one-shot payoff over the joint sequence. We consider the maxmin value of the game played in pure strategies by boundedly rational players and model bounded...

We consider a model of bottleneck congestion in discrete time with a penalty cost for being late. This model can be applied to several situations where agents need to use a capacitated facility in order to complete a task before a hard deadline. A possible example is a situation where commuters...