TY  - RPRT
CY  - IIASA, Laxenburg, Austria
ID  - iiasa4135
UR  - https://pure.iiasa.ac.at/id/eprint/4135/
A1  - Posch, M.
Y1  - 1994/08//
N2  - In this paper we explore a learning algorithm for 2x2 games. We assume that the players neither know the payoff matrix of their opponent nor their own and can only observe their own actions and their own payoffs. We prove that the learning process, which is modelled by a generalized urn scheme, converges to a pure strategy profile if the game has at least one strict Nash equilibrium. In case there is no strict Nash equilibrium, the learning algorithm exhibits oscillations. We derive sufficient conditions that cycling occurs in a generalized urn scheme.
PB  - WP-94-076
M1  - working_paper
TI  - Cycling with a Generalized Urn Scheme and a Learning Algorithm for 2X2 Games
AV  - public
EP  - 43
ER  -