Simple complexity from imitation games

B-Tier
Journal: Games and Economic Behavior
Year: 2010
Volume: 68
Issue: 2
Pages: 683-688

Authors (2)

Score contribution per author:

1.005 = (α=2.01 / 2 authors) × 1.0x B-tier

α: calibrated so average coauthorship-adjusted count equals average raw count

Abstract

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.

Technical Details

RePEc Handle
repec:eee:gamebe:v:68:y:2010:i:2:p:683-688
Journal Field
Theory
Author Count
2
Added to Database
2026-01-26