This paper studies the allocation of buffer times in a single machine environment. Buffer times are a common tool to protect the schedule against disruptions such as machine failures. We introduce new classes of robust machine scheduling problems. For an arbitrary scheduling problem 1

This paper addresses the robust shortest path problem with interval data, i.e. the case of classical shortest path problem with given source and sink when arc weights are not fixed but take their values from some intervals associated with arcs. The problem consists in finding a shortest path...

This paper studies the design of optimal fiscal policy when a government that fully trusts the probability model of government expenditures faces a fearful public that forms pessimistic expectations. We identify two forces that shape our results. On the one hand, the government has an incentive...

In this paper, I evaluate the performance deterioration that occurs when the central bank employs an optimal targeting rule that is based on incorrect parameter values. I focus on two parameters — the degree of inflation inertia and the degree of price stickiness. I explicitly account for the...

Previous studies have interpreted the rise and fall of U.S. inflation after World War II in terms of the Fed's changing views about the natural rate hypothesis but have left an important question unanswered. Why was the Fed so slow to implement the low-inflation policy recommended by a natural...

In this paper, we examine the cost of insurance against model uncertainty for the Euro area considering four alternative reference models, all of which are used for policy-analysis at the ECB. We find that maximal insurance across this model range in terms of a Minimax policy comes at moderate...