Skip navigation
Skip navigation

Simple complexity from imitation games

McLennan, Andrew; Tourky, Rabee


We give simple proofs of refinements of the complexity results of Gilboa and Zemel (1989), and we derive additional results of this sort. Our constructions employ imitation games, which are two person games in which both players have the same sets of pure strategies and the second player wishes to play the same pure strategy as the first player.

CollectionsANU Research Publications
Date published: 2013
Type: Journal article
Source: Games and Economic Behavior
DOI: 10.1016/j.geb.2009.10.003


File Description SizeFormat Image
01_McLennan_Simple_complexity_from_2013.pdf157.21 kBAdobe PDF    Request a copy

Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.

Updated:  17 November 2022/ Responsible Officer:  University Librarian/ Page Contact:  Library Systems & Web Coordinator