Abstract
Experimental game theory is an increasingly important research tool in many fields, providing insight into strategic behavior through simulation and experimentation on game theoretic models. Unfortunately, despite relying heavily on automation, this approach has not been well supported by tools. Here we present our continuing work on Hagl, a domain-specific language embedded in Haskell, intended to drastically reduce the development time of such experiments and support a highly explorative research style.
In this paper we present a fundamental redesign of the underlying game representation in Hagl. These changes allow us to better utilize domain knowledge by allowing different classes of games to be represented differently, exploiting existing domain representations and algorithms. In particular, we show how this supports analytical extensions to Hagl, and makes strategies for state-based games vastly simpler and more efficient.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Fudenberg, D., Tirole, J.: Game Theory, xvii–xx, pp. 11–23. MIT Press, Cambridge (1991)
Nagel, R.: Unraveling in Guessing Games: An Experimental Study. American Economic Review 85, 1313–1326 (1995)
Ho, T., Camerer, C., Weigelt, K.: Iterated Dominance and Iterated Best-response in p-Beauty Contests. American Economic Review 88(4), 947–969 (1998)
Crawford, V.: Introduction to Experimental Game Theory. Journal of Economic Theory 104(1), 1–15 (2002)
Axelrod, R.: The Evolution of Cooperation. Basic Books, New York (1984)
Kendall, G., Darwen, P., Yao, X.: The Prisoner’s Dilemma Competition (2005), http://www.prisoners-dilemma.com
Walkingshaw, E., Erwig, M.: A Domain-Specific Language for Experimental Game Theory. Under consideration for publication in the Journal of Functional Programming (2008)
Erwig, M., Kollmansberger, S.: Functional Pearls: Probabilistic functional programming in Haskell. Journal of Functional Programming 16(01), 21–34 (2005)
Papadimitriou, C.: The Complexity of Finding Nash Equilibria. Algorithmic Game Theory, 29–52 (2007)
Gottlob, G., Greco, G., Scarcello, F.: Pure Nash Equilibria: Hard and Easy Games. In: Proceedings of the 9th conference on Theoretical aspects of rationality and knowledge, pp. 215–230. ACM, New York (2003)
Straffin, P.: Game Theory and Strategy, pp. 7–12, 65–80. The Mathematical Association of America, Washington (1993)
Chakravarty, M., Keller, G., Jones, S., Marlow, S.: Associated types with class. In: Proceedings of the 32nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages, vol. 40, pp. 1–13. ACM, New York (2005)
Peyton Jones, S.L.: Haskell 98 Language and Libraries: The Revised Report. Cambridge University Press, Cambridge (2003)
GHC: The Glasgow Haskell Compiler (2004), http://haskell.org/ghc
Groves, T., Ledyard, J.: Optimal Allocation of Public Goods: A Solution to the Free Rider Problem. Econometrica 45(4), 783–809 (1977)
Erwig, M., Walkingshaw, E.: A Visual Language for Representing and Explaining Strategies in Game Theory. In: IEEE Int. Symp. on Visual Languages and Human-Centric Computing, pp. 101–108 (2008)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 IFIP International Federation for Information Processing
About this paper
Cite this paper
Walkingshaw, E., Erwig, M. (2009). Varying Domain Representations in Hagl. In: Taha, W.M. (eds) Domain-Specific Languages. DSL 2009. Lecture Notes in Computer Science, vol 5658. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-03034-5_15
Download citation
DOI: https://doi.org/10.1007/978-3-642-03034-5_15
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-03033-8
Online ISBN: 978-3-642-03034-5
eBook Packages: Computer ScienceComputer Science (R0)