Programming Games and their Equilibria in Maude

In this short paper we explore how strategic and extensive games, from Game Theory, may be represented as rewrite theories. We also discuss how to calculate Nash and Subgame Perfect Equilibria using term rewriting. We have coded some simple, and yet relevant, games in the rewriting language Maude, an implementation of Rewriting Logic. Our coding technique takes advantage of the Rewriting Logic calculus and rewriting modulo theories implemented in Maude.