We develop a methodology for studying ''large deviations type'' questions. Our approach does not require that the large deviations principle holds, and is thus applicable to a larg class of systems. We study a system of queues with exponential servers, which share an arrival stream. Arrivals are...

In this paper, we perform an in - depth investigation of relative merits of two adaptive learning algorithms with constant gain, Recursive Least Squares (RLS) and Stochastic Gradient (SG), using the Phelps model of monetary policy as a testing ground. The behavior of the two learning algorithms...

This paper provides a concise guide to dynamic optimization with an integral treatment on various optimal control and dynamic programming problems. It presents essential theorems and methods for obtaining and characterizing solutions to these problems. The paper discusses Pontryagin's maximum...

We characterize optimal reward-based crowdfunding where production is contingent on an aggregate funding threshold. Crowdfunding adapts project-implementation to demand (market-testing) and its multiple prices enhance rent-extraction via pivotality, even for large crowds, indeed arbitrarily...

This paper investigates the optimal design of crowdfunding where crowdfunders are potential consumers with standard motivations and entrepreneurs are profit maximizing agents. We characterize the typical crowdfunding mechanism where the entrepreneur commits to produce only if aggregate funding...

Market mechanisms are increasingly being used as a tool for allocating somewhat scarce but unpriced rights and resources, and the European Emission Trading Scheme is an example. By means of dynamic optimization in the contest of firms covered by such environmental regulations, this paper...

Objective: The objective of the article is to present the concept of evolutionary algorithms and indicates the possibility of their implementation for the needs of the economy, especially the entrepreneurial economy. Research Design & Methods: This conceptual article relies on literature review...

As a refinement of the concept of stationary point, the notion of perfect stationary point was formulated in the literature. Although simplicial methods could be applied to approximate such a point, these methods do not make use of the possible differentiability of the problem and can be very...

Structural estimation of macroeconomic models and new HANK-type models with extremely high dimensionality require fast and robust methods to efficiently deal with occasionally binding constraints (OBCs). This paper proposes a novel algorithm that solves for the perfect foresight path of...

We present the first necessary and sufficient conditions for the existence of a unique perfect-foresight solution, returning to a given steady-state, in an otherwise linear model with occasionally binding constraints. We derive further conditions on the existence of a solution in such models,...