Abstract
A new game system formalism is presented. The system describes both strategies and a game master (who computes scores in a given game system) in terms of the λ-calculus. A prisoners’ dilemma game is revisited with this formalism, to discuss how meta-strategies emerge in this classical game, even without repetition.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Barendregt, H.G.: The Lambda Calculus: Its Syntax and Semantics Amsterdam, North Holland (1981).
Fontana, W., Buss L.W.: The Arrival of the Fittest: Toward a Theory of Biological Organization. Bulletin of Mathematical Biology 56 (1994) 1–64.
Hofstadter, D.R.: Metamagical Themas. BasicBooks (1985).
Howard, N.: The Theory of Meta-games. General Systems 11 (1966) 167–186.
Howard, N.: Paradoxes of Rationality: Theory of Metagames and Political Behavior. MIT Press, Cambridge MA. (1971).
Ikegami, T.: From Genetic Evolution to Emergence of Game Strategies. Physica D 75 (1994) 310–327.
Ikegami, T., Taiji, M.: Imitation and Cooperation in Coupled Dynamical Recognizers. In: Floreano, D. et al. (eds.): Advances in Artificial Life, Springer-Verlag (1999) 545–554.
Langton, C.G. et al. (eds): Artificial Life II. Addison-Wesley, CA. (1992).
Lindgren, K.: Evolutionary Phenomena in Simple Dynamics. In: Langton, C.G. et al. (eds): Artificial Life II. Addison-Wesley, CA. (1992) 295–311.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Masumoto, G., Ikegami, T. (2001). The λ-Game System: An Approach to a Meta-game. In: Kelemen, J., Sosík, P. (eds) Advances in Artificial Life. ECAL 2001. Lecture Notes in Computer Science(), vol 2159. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44811-X_80
Download citation
DOI: https://doi.org/10.1007/3-540-44811-X_80
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42567-0
Online ISBN: 978-3-540-44811-2
eBook Packages: Springer Book Archive