ROTATIONS - MATCHING SCHEMES THAT EFFICIENTLY PRESERVE THE BEST REPLYSTRUCTURE OF A ONE-SHOT GAME

Authors
Citation
U. Kamecke, ROTATIONS - MATCHING SCHEMES THAT EFFICIENTLY PRESERVE THE BEST REPLYSTRUCTURE OF A ONE-SHOT GAME, International journal of game theory, 26(3), 1997, pp. 409-417
Citations number
3
Categorie Soggetti
Social Sciences, Mathematical Methods","Mathematical, Methods, Social Sciences","Mathematics, Miscellaneous","Statistic & Probability
ISSN journal
00207276
Volume
26
Issue
3
Year of publication
1997
Pages
409 - 417
Database
ISI
SICI code
0020-7276(1997)26:3<409:R-MSTE>2.0.ZU;2-M
Abstract
Suppose that we have a two player game in which we want to test experi mentally whether the subjects learn to play the game theoretic solutio n. For this purpose we need a matching scheme which assures that a rat ional subject behaves in each round of the experiment as if he played a separate stage game. In this paper we show that such a 'best-reply-s tructure-preserving matching scheme' has to be free of repercussion ef fects, and that the rotation of two equally sized groups of subjects, which was introduced by Cooper, DeJong, Forsythe and Ross, solves the problem efficiently.