Elicitation of strategies in four variants of a round-robin tournament: the case of Goofspiel

Dror, Moshe and Kendall, G. and Rapoport, Amnon (2016) Elicitation of strategies in four variants of a round-robin tournament: the case of Goofspiel. IEEE Transactions on Computational Intelligence and AI in Games, 8 (3). pp. 209-217. ISSN 1943-0698

Full text not available from this repository.

Abstract

Goofspiel is a simple two-person zero-sum game for which there exist no known equilibrium strategies. To gain insight into what constitute winning strategies, we conducted a round-robin tournament in which participants were asked to provide computerized programs for playing the game with or without carryover. Each of these two variants was to be played under two quite different objective functions, namely, maximization of the cumulative number of points won across all opponents (as in Axelrod's tournament), and maximization of the probability of winning any given round. Our results show that there are, indeed, inherent differences in the results with respect to the complexity of the game and its objective function, and that winning strategies exhibit a level of sophistication, depth, and balance that are not captured by present models of adaptive learning.

Item Type: Article
RIS ID: https://nottingham-repository.worktribe.com/output/974997
Keywords: Goofspiel, strategy
Schools/Departments: University of Nottingham, Malaysia > Faculty of Science > School of Computer Science
University of Nottingham, UK > Faculty of Science > School of Computer Science
Identification Number: https://doi.org/10.1109/TCIAIG.2014.2377250
Depositing User: Kendall, Graham
Date Deposited: 06 Feb 2018 14:54
Last Modified: 04 May 2020 20:01
URI: http://eprints.nottingham.ac.uk/id/eprint/49524

Actions (Archive Staff Only)

Edit View Edit View