Abstract
Games of timing constitute a subclass of two-person, zero-sum, infinite games, where the problem facing each player is not what course of action to take, but rather when to take a prespecified action. The present study is an extension of previous research on games of timing with complete information (noisy duels) and equal accuracy functions, to noisy duels with unequal accuracy functions. The game-theoretic solution of this class of games, which has been recently derived, is briefly presented. Ten pairs of male subjects participated in two sessions each in a computer-controlled noisy duel experiment. Each pair played 256 duels in which both the accuracy functions and the starting number of bullets were varied systematically. The results are analyzed and discussed in terms of predictions derived from the game-theoretic solution.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.