In this paper we use agency theory to study the active role of the chief executive in the formulation of corporate strategy. Unlike traditional applications of agency theory, we allow the agent (CEO) to play a role in defining the parameters of the agency problem. We argue that CEOs will have an...

This paper studies a machine (finite automaton) playing a two-player repeated game of a simple extensive-form game with perfect information. We introduce a new complexity measure called multiple complexity which incorporates a strategyʼs responsiveness to information in the stage game as well...

It is common to model costs of carrying out strategies in games in relation to the complexity, in some sense, of the strategies. We show a particularly general definition of complexity for this purpose, one that subsumes many alternatives as special cases. We explore how this definition can be...

Response times are a simple low-cost indicator of the process of reasoning in strategic games (Rubinstein, 2007; Rubinstein, 2016). We leverage the dynamic nature of response-time data from repeated strategic interactions to measure the strategic complexity of a situation by how long people think on...

This paper initiates the study of long term interactions where players' bounded rationality varies over time. Time dependent bounded rationality is reflected in part in the number $\psi(t)$ of distinct strategies in the first $t$-stages. We examine how the growth rate of $\psi_i(t)$ affects...

Evidence supports the contention that humans find it costly to carry out some sorts of strategies. Such costs are unlikely to be observed directly, but various models have been proposed to represent them. We discuss a method for testing the empirical worth of these models.

In this Paper we use agency theory to study the active role of the CEO in the formulation of corporate strategy. We allow the agent (CEO) to play a role in defining the parameters of the agency problem, in an incomplete contracting model in which the agent can be rewarded based only on financial...

One way to express bounded rationality of a player in a game theoretic models is by specifying a set of feasible strategies for that player. In dynamic game models with finite automata and bounded recall strategies, for example, feasibility of strategies is determined via certain complexity...

A central question in game theory and artificial intelligence is how a rational agent should behave in a complex environment, given that it cannot perform unbounded computations. We study strategic aspects of this question by formulating a simple model of a game with additional costs...