We introduce an accurate, easily implementable, and fast algorithm to compute optimal decisions in discrete-time long-horizon welfaremaximizing problems. The algorithm is useful when interest is only in the decisions up to period T, where T is small. It relies on a flexible parametrization of...

The Expectation-Maximization (EM) algorithm is a well-established estimation procedure which is used in many domains of econometric analysis. Recent application in a discrete choice framework (Train, 2008) facilitated estimation of latent class models allowing for very exible treatment of...

We consider a class of stochastic mathematical programs with complementarity constraints, in which both the objective and the constraints involve limit functions or expectations that need to be estimated or approximated.Such programs can be used for modeling average or steady-state behavior of...

The class of neighbour games is the intersection of the class of assignment games (cf. Shapley and Shubik (1972)) and the class of component additive games (cf. Curiel et al. (1994)). For assignment games and component additive games there exist polynomially bounded algorithms of order p4 for...

Abstract Introducing a ceiling on total carbon dioxide (CO2) emissions and allowing polluting industries to buy and sell permits to meet it (known as a cap-and-trade system) affects investment strategies, generation quantities, and prices in electricity markets. In this paper we analyze these...

This paper studies how the HP-Filter should be adjusted, when changing the frequency of observations. The usual choices in the literature are to adjust the smoothing parameter by multiplying it with either the square of the observation frequency ratios or simply with the observation frequency....

Random matching models with different states are an important class of dynamic games; for example, money search models, job search models, and some games in biology are special cases.In this paper, we investigate the basic structure of the models: the existence of equilibria, the global...

Harsanyi and Selten (1988) have proposed a theory of equilibrium selection that selects a unique Nash equilibrium for any non-cooperative N-person game. The heart of their theory is given by the tracing procedure, a mathematical construction that adjusts arbitrary prior beliefs into equilibrium...

Abstract: In this note we generalize a numerical algorithm presented in [9] to calculate all solutions of the scalar algebraic Riccati equations that play an important role in finding feedback Nash equilibria of the scalar N-player linear affine-quadratic differential game. The algorithm is...