Monotone Approximation of Decision Problems
Operations Research, Forthcoming
35 Pages Posted: 9 Jan 2009 Last revised: 29 Apr 2010
Date Written: April 25, 2010
Abstract
Many decision problems exhibit structural properties in the sense that the objective function is a composition of different component functions that can be identified using empirical data. We consider the approximation of such objective functions, subject to general monotonicity constraints on the component functions. Using a constrained B-spline approximation, we provide a data-driven robust optimization method for environments that can be sample-sparse. The method, which simultaneously optimizes and identifies the decision problem, is illustrated for the problem of optimal debt settlement in the credit-card industry.
Keywords: B-Splines, Monotone Approximation, Nonparametric/Semiparametric Methods, Robust Optimization, Sample-Sparse Environments
JEL Classification: C10, C14
Suggested Citation: Suggested Citation
Do you have a job opening that you would like to promote on SSRN?
Recommended Papers
-
Testing the Validity of a Demand Model: An Operations Perspective
By Omar Besbes, Robert Phillips, ...
-
Bayesian Dynamic Pricing Policies: Learning and Earning Under a Binary Prior Distribution
By J. Michael Harrison, N. Bora Keskin, ...
-
On the (Surprising) Sufficiency of Linear Models for Dynamic Pricing with Demand Learning
By Omar Besbes and Assaf Zeevi