 In the game theoretic literature, bounded agents have often been represented as finite state machines (Gutierrez, Harrenstein, &amp; Wooldridge 2015; Binmore &amp; Samuelson 1992). Limitations on reasoning capacities or memory size then translate into bounds on the machine size. The resulting hierarchy allows for a fine grained analysis of information processing, reasoning, and thus bounded players of different types. This perspective fits well with the logical study of agency in computer science, (Grädel, Thomas, &amp; Wilke 2002; Wooldridge 2009).