We study the question of scheduling impatient customers in parallel server queuing systems. At the time of arrival, customers can be identified as one of many classes, where the class represents the service time and patience time distributions, and cost characteristics. From the system's...

Customers often stockpile reward points in linear loyalty programs (i.e., programs that do not reward stockpiling) despite several economic incentives against it (e.g., the time value of money). We develop a mathematical model of redemption choice that unites three explanations for why customers...

The rate of time preference is traditionally defined as the marginal rate of substitution between current and future consumption. This definition is not applicable when outcomes are indivisible. Such is the case in all discrete-choice dynamic problems which arise, for example, in modeling...