We examine a repeated interaction between an agent, who undertakes experiments, and a principal who provides the requisite funding for these experiments. The agent's actions are hidden, and the principal, who makes the offers, cannot commit to future actions. We identify the unique Markovian...

We examine a repeated interaction between an agent, who undertakes experiments, and a principal who provides the requisite funding for these experiments. The repeated interaction gives rise to a dynamic agency cost — the more lucrative is the agent's stream of future rents following a failure,...

We examine a repeated interaction between an agent, who undertakes experiments, and a principal who provides the requisite funding for these experiments. The agent's actions are hidden, and the principal cannot commit to future actions. The repeated interaction gives rise to a dynamic agency...

We consider an example of a Markov game with lack of information on one side, that was first introduced by Renault (2002). We compute both the value and optimal strategies for a range of parameter values.

We examine a repeated interaction between an agent, who undertakes experiments, and a principal who provides the requisite funding for these experiments. The repeated interaction gives rise to a dynamic agency cost – the more lucrative is the agent's stream of future rents following a failure,...

We study the pure-strategy subgame-perfect Nash equilibria of stochastic games with perfect monitoring, geometric discounting, and public randomization. Novel algorithms are developed for calculating the discounted payoffs that can be attained in equilibrium. We also provide implementations of...