Morton and Wecker (1977) stated that the value iteration algorithm solves a dynamic program's policy function faster than its value function when the limiting Markov chain is ergodic. I show that their proof is incomplete, and provide a new proof of this classic result. I use this result to...

We develop a minimum distance estimator for dynamic games of incomplete information. We take a two-step approach, following Hotz and Miller (1993), based on the pseudo-model that does not solve the dynamic equilibrium so as to circumvent the potential indeterminacy issues associated with...

A budget-constrained buyer wants to purchase items from a shortlisted set. Items are differentiated by quality and sellers have private reserve prices for their items. Sellers quote prices strategically, inducing a knapsack game. The buyer's problem is to select a subset of maximal quality. We...

A budget-constrained buyer wants to purchase items from a shortlisted set. Items are differentiated by quality and sellers have private reserve prices for their items. Sellers quote prices strategically, inducing a knapsack game. The buyer's problem is to select a subset of maximal quality. We...

The paper reports laboratory experiments on a day-to-day route choice game with two routes. Subjects had to choose between a main road M and a side road S. The capacity was greater for the main road. 18 subjects participated in each session. In equilibrium the number of subjects is 12 on M and 6...

In this paper I examine the influence which a population of different behavioral types may have on the provision of public goods. In particular, the population or subject pool consists of three behavioral types: myopic selfish agents, enlightened selfish agents and ethically motivated agents. I...