Varying Domain Representations in Hagl

Authors:
Eric Walkingshaw;Martin Erwig
Affiliations:
School of Electrical Engineering and Computer Science, Oregon State University, Corvallis, USA OR 97331;School of Electrical Engineering and Computer Science, Oregon State University, Corvallis, USA OR 97331
Venue:
DSL '09 Proceedings of the IFIP TC 2 Working Conference on Domain-Specific Languages
Year:
2009

Citing 5
Cited 0

Pure Nash equilibria: hard and easy games

Proceedings of the 9th conference on Theoretical aspects of rationality and knowledge
Associated types with class

Proceedings of the 32nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
FUNCTIONAL PEARLS: Probabilistic functional programming in Haskell

Journal of Functional Programming
A visual language for representing and explaining strategies in game theory

VLHCC '08 Proceedings of the 2008 IEEE Symposium on Visual Languages and Human-Centric Computing
A domain-specific language for experimental game theory

Journal of Functional Programming

Quantified Score

Hi-index	0.00

Visualization

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.