Average Testing and the Efficient Boundary
We propose a simple adaptive procedure for playing strategic games: average testing. In this procedure each player sticks to her current strategy if it yields a payoff that exceeds her average payoff by at least some fixed \epsilon > 0; otherwise she chooses a strategy at random. We consider generic two-person games where both players play according to the average testing procedure on blocks of k-periods. We demonstrate that for all k large enough, the pair of time-average payoffs converges (almost surely) to the 3\epsilon-Pareto efficient boundary.
|Date of creation:||Feb 2011|
|Date of revision:|
|Contact details of provider:|| Postal: Feldman Building - Givat Ram - 91904 Jerusalem|
Web page: http://www.ratio.huji.ac.il/
More information through EDIRC
When requesting a correction, please mention this item's handle: RePEc:huj:dispap:dp567. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Tomer Siedner)
If references are entirely missing, you can add them using this form.