Search Results - subject:"dynamic programming"

Basak, Suleyman; Chabakauri, Georgy - C.E.P.R. Discussion Papers - 2009

the mean-variance criterion and deriving a recursive representation for it, which makes dynamic programming applicable. We …

Persistent link: https://www.econbiz.de/10005656376

Multiple solutions under quasi-exponential discounting

Vieille, Nicolas; Weibull, Jörgen - In: Economic Theory 39 (2009) 3, pp. 513-526

Persistent link: https://www.econbiz.de/10005596757

Approximate and exact algorithms for the double-constrained two-dimensional guillotine cutting stock problem

Hifi, M.; R. M’Hallah; Saadi, T. - In: Computational Optimization and Applications 42 (2009) 2, pp. 303-326

Persistent link: https://www.econbiz.de/10005760150

Improved time and space complexity for Kianfar's inequality rotation algorithm

Baz, D. El; Elkihel, M.; Gely, L.; Plateau, G. - In: European Journal of Industrial Engineering 3 (2009) 1, pp. 90-98

In this paper, constraint rotation techniques are considered for preconditioning 0?1 knapsack problems. These techniques permit one to generate new inequalities by means of rotation of the original ones in order to approach the convex hull associated with the feasible integer points. The time...

Persistent link: https://www.econbiz.de/10005553173

Killed Markov Decision Processes for Countable Models for Crash Function Assessment

Robert, Kowal - In: Folia Oeconomica Stetinensia 8 (2009) 1, pp. 99-112

the Markovian property is shown. Additionally dynamic programming principle is considered. …

Persistent link: https://www.econbiz.de/10010534133

On the Relative Performance of Linear vs. Piecewise-Linear-Threshold Intertemporal Incentives

Chen, Joseph Y.; Miller, Bruce L. - In: Management Science 55 (2009) 10, pp. 1743-1752

This paper employs numerical simulations to compare the relative performance of linear contracts with piecewise-linear-threshold contracts in the case where the agent chooses actions over time. These contracts are restricted to be functions of the ending value of aggregate output. We find strong...

Persistent link: https://www.econbiz.de/10009191833

Dynamic Programming Approach for Valuing Options in the GARCH Model

Ben-Ameur, Hatem; Breton, Michèle; Martinez, Juan-Manuel - In: Management Science 55 (2009) 2, pp. 252-266

procedure based on dynamic programming coupled with piecewise polynomial approximation to compute the value of a given option …

Persistent link: https://www.econbiz.de/10009197763

Improved time and space complexity for Kianfar's inequality rotation algorithm

Baz, D. El; Elkihel, M.; Gely, L.; Plateau, G. - In: European Journal of Industrial Engineering 3 (2009) 1, pp. 90-98

In this paper, constraint rotation techniques are considered for preconditioning 0â€“1 knapsack problems. These techniques permit one to generate new inequalities by means of rotation of the original ones in order to approach the convex hull associated with the feasible integer points. The...

Persistent link: https://www.econbiz.de/10008563659

A Dynamic Model of Consumer Replacement Cycles in the PC Processor Industry

Gordon, Brett R. - In: Marketing Science 28 (2009) 5, pp. 846-867

As high-tech markets mature, replacement purchases inevitably become the dominant proportion of sales. Despite the clear importance of product replacement, little empirical work examines the separate roles of adoption and replacement. A consumer's replacement decision is dynamic and driven by...

Persistent link: https://www.econbiz.de/10008787986

Website Morphing

Hauser, John R.; Urban, Glen L.; Liberali, Guilherme; … - In: Marketing Science 28 (2009) 2, pp. 202-223

time with expected Gittins indices. We apply the Bayesian updating and dynamic programming to an experimental BT Group …, dynamic programming does almost as well—purchase intentions can increase by almost 20%. If implemented system-wide, such …

Persistent link: https://www.econbiz.de/10008788016