This paper examines multi-battle contests whose extensive form can be represented in terms of a finite state machine. We start by showing that any contest that satisfies our assumptions decomposes into two phases, a principal phase (in which states cannot be revisited) and a concluding...

This paper examines multi-battle contests whose extensive form can be represented in terms of a finite state machine. We start by showing that any contest that satisfies our assumptions decomposes into two phases, a principal phase (in which states cannot be revisited) and a concluding...

We experimentally test the ability of subjects to identify repeated-game strategies from prisoner's dilemma choice data. In the experiments, subjects use a finite state grammar to build models to fit game histories. The histories are designed to distinguish between strategies with empirical and...

I study two-player undiscounted repeated games with imperfect private monitoring. When strategies are restricted to those implementable by nite automata, fewer equilibrium outcomes are possible. When only two-state automata are allowed, a simple strategy, "Win-Stay, Lose-Shift," leads to...

Предложен метод организации мультимодального интеллектуального интерфейса пользователя со средой в процессе распознавания возникающих в ней динамических...

Предлагается автоматный подход к идентификации и разрешению конфликтов в организационных системах, синтезирующий «языковую технику» теории игр и ее...