Rotations: Matching schemes that efficiently preserve the best reply structure of a one shot game

DOI10.1007/BF01263281zbMATH Open0880.90150OpenAlexW4239021648MaRDI QIDQ1365007FDOQ1365007

Authors: Ulrich Kamecke 

Publication date: 28 August 1997

Published in: International Journal of Game Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01263281

Recommendations

• Best-reply matching in games.
• Cost structures and Nash play in repeated Cournot games
• Learning behavior in an experimental matching pennies game
• Social games: matching and the play of finitely repeated games
• Efficient equilibrium selection in evolutionary games with random matching

zbMATH Keywords

experimental designrepeated gamesbest-reply-structure-preserving matching scheme

Mathematics Subject Classification ID

Multistage and repeated games (91A20)

Cites Work

• Cooperation without reputation: Experimental evidence from prisoner's dilemma games
• Social Norms and Community Enforcement

Cited In (6)

• Perfect versus imperfect observability -- an experimental test of Bagwell's result
• A randomized tabu search-based approach for perfect stranger matching in economic experiments
• Cognitive ability and the effect of strategic uncertainty
• Playing a game or making a decision? Methodological issues in the measurement of distributional preferences
• Do actions speak louder than words? An experimental comparison of observation and cheap talk
• Repetition and signalling: Experimental evidence from games with efficient equilibria

This page was built for publication: Rotations: Matching schemes that efficiently preserve the best reply structure of a one shot game

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1365007)