Cycling with a Generalized Urn Scheme and a Learning Algorithm for 2X2 Games

Posch M (1994). Cycling with a Generalized Urn Scheme and a Learning Algorithm for 2X2 Games. IIASA Working Paper. IIASA, Laxenburg, Austria: WP-94-076

[img]
Preview
Text
WP-94-076.pdf

Download (815kB) | Preview

Abstract

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.

Item Type: Monograph (IIASA Working Paper)
Research Programs: Dynamic Systems (DYN)
Depositing User: IIASA Import
Date Deposited: 15 Jan 2016 02:04
Last Modified: 10 Nov 2016 11:10
URI: http://pure.iiasa.ac.at/4135

Actions (login required)

View Item View Item

International Institute for Applied Systems Analysis (IIASA)
Schlossplatz 1, A-2361 Laxenburg, Austria
Phone: (+43 2236) 807 0 Fax:(+43 2236) 71 313