Showing 1 - 10 of 66
Persistent link: https://www.econbiz.de/10005475292
Persistent link: https://www.econbiz.de/10005475297
When calibrated, the Mortensen & Pissarides [1994] is able to produce some stylized facts highlighted by empirical studies on US gross job flowa. However, other stylized facts concerning their asymmetric properties are generally neglected at the aggregate level. The aim of this paper is to test...
Persistent link: https://www.econbiz.de/10005663586
Persistent link: https://www.econbiz.de/10005663599
This paper investigates the stability of households' consumption behaviour in France through a prcedure of discriminating between feedback and feedforward models connected to the notions of encompassing in invariance initially proposed by Hendry (1988).
Persistent link: https://www.econbiz.de/10005630678
Persistent link: https://www.econbiz.de/10005630693
In this paper, we define and study a new class of optimal stochastic control problems which is closely related to the theory of Backward SDE's and forward-backward SDE's. The controlled process takes values in RXR and a given initial data for X(O). Then, the control problem is to find the...
Persistent link: https://www.econbiz.de/10005475332
We analyze the approximation behaviour of some of the best-known polynomial time approximation algorithms for bin-packing under an approximation criterion, called differential ratio. This measure has originally been introduced by Ausiello, D'Atri and Protasi and more recently revisited, in a...
Persistent link: https://www.econbiz.de/10005475336
We devise an approximation-preserving reduction of expansion O between weighted and unweighted versions of a class of problems called weighted hereditary induced-subgraph maximisation problems. This allows us to perform a first improvement of the best approximation ratio for the weighted...
Persistent link: https://www.econbiz.de/10005630673
We shape a formal framework for distinguishing the behaviour of constructive and non-constructive polynomial time approximation algorithms for NP optimization problems. We introduce a new class, called SubNPO, that includes NPO and also some other problems used in recent works.
Persistent link: https://www.econbiz.de/10005630682