Relevant Thesis-Based Degree Programs
Graduate Student Supervision
Doctoral Student Supervision
Dissertations completed in 2010 or later are listed below. Please note that there is a 6-12 month delay to add the latest dissertations.
The full abstract for this thesis is available in the body of the thesis, and will be available when the embargo expires.
This dissertation addresses the implications of the satisficing decision making in retail and revenue management. In the first essay, we incorporate the satisficing behavior of customers in an assortment optimization problem. While different approaches to modelling customer choice have been adopted in assortment planning, all assume customers are utility maximizers. Our work bridges the research streams of assortment planning and bounded rationality, particularly satisficing behavior. Furthermore, by defining a limit for the search budget of customers, based on which customers leave without purchase after examining a certain number of items, we bring a new perspective to the assortment planning literature. We formulate this optimization problem and prove that the firm's problem of finding the optimal assortment is NP-hard. We also establish certain structural properties of the optimal decision to reformulate the problem as a mixed integer program. We show the size of the optimal assortment cannot exceed the maximum search budget of all customers. The second essay investigates the consequences of ignoring the satisficing behavior of customers. We identify analytically a tight upper bound on the firm's percentage loss of expected profit for small instances when it assumes incorrectly that its customers are utility maximizers. In this regard, we take the multinomial logit choice model as the representative of a utility maximizing model. For larger instances, we take a numerical approach to characterize the loss. Our results indicate that when the firm is dealing with satisficers, it may face considerable profit loss by ignoring this type of behavior.In the third essay, we propose a price optimization model for a firm offering two substitutable items to satisficing customers. We define acceptability probability functions for each item and formulate the demand of each product based on the assumption that customers examine the items one-by-one until they find an acceptable alternative. We prove unimodality of the revenue function when the acceptability probabilities follow certain structures. We then provide insights into price dispersion of a utility maximizing pricing model and our satisficing model, as well as the revenue loss of a firm adopting an incorrect choice model.
This thesis comprises three studies. Within each study, we analyze a stochastic multi-period decision making problem in the area of service management. Throughout the dissertation, we incorporate dynamic programming techniques to develop the mathematical models and analyze the solution approaches for each of the discussed problems.In the first two studies, we consider a queueing system in which customers require some conditions to be met prior to receiving service. We investigate whether an individual arriving to this system should join the queue at that time, or wait to join at some future time. Chapters 2 and 3 discuss two variations of this problem. We formulate the problem as a Markov decision process and show how the structure of the optimal policy depends on various parameters of the model.Furthermore, in Chapter 3, we use the construct of “level-k” thinking from the behavioral and experimental economics literature to model the bounded rationality of customers, and also to characterize their equilibrium strategy. We present the structural results of the customers’ joining policies and show the threshold structure of customers’ decisions with different levels of rationality. We also analyze the socially optimal solution and compare it to the equilibrium policy. The optimal policies we derive allow for a better management of customers’ waiting time and also give information on their joining behavior to service providers.In the third study, we analyze another dynamic decision making problem in a different context than the previous two studies. Through tracking drivers’ behavior, Usage Based Insurance (UBI) allows insurance companies to connect insurers’ premiums more closely to their actual driving performance. Chapter 4 provides a theoretical model to capture the effects of UBI on the auto insurance market. We formulate the underlying problem as a dynamic principal-agent model with hidden information and hidden action. Developing a dynamic programming algorithm, we characterize the full history-dependent optimal contract. Our model results shed light on how to design the contract to manage a UBI program, the extent to which a UBI policy can outperform a traditional policy, and how the potential gains depend on the demographics of the target market.
This thesis comprises three chapters with applications of stochastic optimization models to vascular access planning for patients with chronic kidney disease (CKD). Hemodialysis (HD) is the most common treatment for patients with end-stage renal disease, the last stage of CKD. There are two primary types of vascular accesses used for HD, arteriovenous fistula (AVF), and central venous catheter (CVC). An AVF, which is created via a surgical procedure, is often considered the gold standard for delivering HD due to better patient survival and higher quality of life. However, there exists a preparation lead-time for establishing a functional AVF since it takes several months to know whether the surgery was successful, and a majority of AVF surgeries end in failure. In this thesis, we address the question of whether and when to perform AVF surgery on patients with CKD with the aim of finding individualized policies that optimize patient outcomes. In Chapter 2 we focus on vascular access planning for HD dependent patients. Using a continuous-time dynamic programming model and under data-driven assumptions, we establish structural properties of optimal policies that maximize a patient's probability of survival and quality-adjusted life expectancy. We provide further insights for policy makers through our numerical experiments. In Chapter 3 we develop a Monte-Carlo simulation model to address the timing of AVF preparation for progressive CKD patients who have not yet initiated HD. We consider two types of strategies based on approaches suggested in recently published guidelines. We evaluate these strategies over a range of values for each strategy, compare them with respect to different performance metrics (e.g., percentage of patients with an unnecessary AVF creation), and provide policy recommendations. Our simulation results suggest that the timing of AVF referral should be guided by the individual rate of CKD progression. Motivated by our findings in Chapter 3, we develop a dynamic programming model in Chapter 4 that incorporates patient heterogeneity in disease progression when making clinical decisions. We then apply this modeling framework to the case of the AVF preparation timing problem introduced in Chapter 3 and provide recommendations that consider patient heterogeneity in CKD progression.
This thesis comprises three chapters with applications of the stochastic optimization models in healthcare as a central theme. The first chapter considers a patient screening problem. Patients on the kidney transplant waiting list are at higher risk for developing cardiovascular disease (CVD), which makes them ineligible for transplant. Therefore, transplant centers screen waiting patients to identify patients with severe CVD. We propose a model for finding screening strategies, with the objective of minimizing sum of the expected screening cost and the expected penalty cost associated with transplanting an organ to an ineligible patient. Our results suggest that current screening guidelines, which are only based on patients' risk for developing CVD, are significantly dominated by policies that also consider factors related to patients' waiting time.In the second chapter, we extend our results from the first chapter to the case of inspecting a vital component which is needed at a random future time when an emergency occurs. If the component is not operational at that time, the system incurs a large penalty, which we want to avoid through inspections and replacements. We propose a model and solution algorithm for finding an inspection policy that minimizes the infinite horizon discounted expected penalty, replacement, and inspection costs. We also discuss other structural properties of the solution, as well as insights based on numerical results. In the third chapter, we consider inventory decisions regarding issuing blood in a hospital. This research is motivated by recent findings in medicine that the age of transfused blood can affect health outcomes, with older blood contributing to more complications. Current practice at hospital blood banks is to issue blood in order from oldest to youngest inventory, so as to minimize shortage. However, the conflicting objective of reducing the age of blood transfused requires an issuing policy that also depends on the inventory of units of different ages. We propose a model that balances the trade-off between the average age of blood transfused and the shortage rate. Our numerical results suggest we can significantly reduce the age of transfused blood with a relatively small increase in the shortage rate.
Master's Student Supervision
Theses completed in 2010 or later are listed below. Please note that there is a 6-12 month delay to add the latest theses.
Red blood cells (RBCs) are the most common type of blood cells and the primary means of delivering oxygen throughout the body. They are perishable with a permitted storage time of forty-two days in Canada and in the United States. RBCs undergo a series of pathological changes while in storage. These pathological changes are known as storage lesions, and they have a negative impact on the amount of oxygen delivered to the tissue during transfusion. As a result, many studies have been conducted on the age of blood used in transfusion to patient outcomes over the past two decades. Although conflicting results have been found, most studies find that the age of blood used in transfusion plays a role in disease recurrence and mortality. Therefore, we are interested in studying hospital blood issuing policies, and in finding ones that can minimize hospital blood shortages and wastages while reducing the age of blood used in transfusion. In this thesis, we first formulate our problem as a Markov Decision Process (MDP) model, and find optimal policies that minimize blood shortages, wastages, and age of blood used in transfusion, individually. We then use simulation to compare eleven policies, including a Myopic policy derived from the MDP model. We find policies that minimize the average expected total cost of blood shortages, wastages, and age of blood used in transfusion for various shortage and wastage costs. We also perform sensitivity analyses of total costs with respect to varying threshold and cost parameters.