Simple complexity from imitation games
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.
|Collections||ANU Research Publications|
|Source:||Games and Economic Behavior|
|01_McLennan_Simple_complexity_from_2013.pdf||157.21 kB||Adobe PDF||Request a copy|
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.