NKNuri Bora Keskin

Nuri Bora Keskin

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Nuri Bora Keskin has a total of 25 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Data-Driven Population Tracking in Service Systems

    by Fernando Bernstein, N. Bora Keskin, Adam Mersereau, Morgan Wood, Serhan Ziya

    Motivated by an application at the Raleigh-Durham International Airport, we consider a service system in which a manager aims to track the number of people in the system based only on noisy observations of arrivals and departures over a time horizon. We study two tracking problems in this context. In the busyness tracking problem, the manager seeks to determine whether the system is busy or not, whereas in the population tracking problem, the manager tracks the number of people in the system and accumulates losses as squared errors. We characterize the cumulative losses of various policies in an asymptotic regime in which the time horizon grows large. We prove general lower bounds on the cumulative loss of any policy and propose relatively simple policies that achieve these lower bounds, up to logarithmic terms. These policies outperform naive tracking policies in many instances. Finally, we characterize the impact of having the ability to periodically inspect the system at a cost. We find that effective population tracking policies take opportunities to reset the population count to accurate estimates to stop the accumulation of error. Without inspections, this is achieved by resetting the population count to zero when a near-empty system is detected based on observing the departure stream. Inspections, although coming at a cost, allow for greater flexibility in the timing of corrections and, hence, improved performance. We demonstrate the performance of our policies using real-world data we collected by installing people-counting sensors at the airport. This paper was accepted by Vivek Farias, data science. Funding: Financial support from the Triangle Impact Challenge 2021 is gratefully acknowledged. Supplemental Material: The online appendix and data files are available at https://doi.org/10.1287/mnsc.2024.05152 .

  • The Nonstationary Newsvendor: Data-Driven Nonparametric Learning

    by N. Bora Keskin, Xu Min, Jing-Sheng Song

    We study a newsvendor problem with unknown demand distribution in a nonstationary demand environment over a multiperiod time horizon. The demand in each period consists of a time-varying demand level and an additive random shock. Neither the demand level nor the random shock is separately observable. The amount of change in the demand level over the time horizon is measured by a cumulative variation metric. The problem has widespread applications, such as perishable inventory planning, staffing, and medical resource capacity planning in the wake of COVID-19. We design a family of nonparametric dynamic ordering policies, termed two-stage estimation (2SE) policies, that track the shifts in the unknown demand level while accounting for the unobservable random demand shocks. To compute the order quantity in each period, these policies only need the past demand observations, without any access to the underlying demand distribution. For a finite variation “budget,” we prove that our ordering policies are first-order optimal in the sense that their regret grows at the smallest possible rate. We also extend our analysis to the case of asymptotically large variation budgets. Through case studies based on real-life data, we show that our policies can save more than 20% of overage and underage costs, relative to policies widely used for perishable inventory replenishment and nurse staffing. Moreover, our simulation experiments indicate that our policies consistently maintain superior performance across diverse patterns of nonstationary demand environments. This paper was accepted by David Simchi-Levi, operations management. Funding: N. B. Keskin and J.-S. Song were supported by the Duke University Fuqua School of Business, and X. Min was supported by the National Natural Science Foundation of China [Grant 72401195] and the China Postdoctoral Science Foundation [2025T180216]. Supplemental Material: The online appendix and data files are available at https://doi.org/10.1287/mnsc.2023.01823 .


  • Dynamic Learning for Joint Pricing, Advertising, and Inventory Management

    by Huseyin Gurkan, N. Bora Keskin, Rodney P. Parker

    Problem definition: Startup firms, often small in size, face the challenge of making cross-functional decisions due to the absence of distinct departments like marketing and operations. These interdependent decisions are further complicated by the lack of historical customer data. As a result, these firms must learn about customer preferences while making marketing decisions (such as pricing and advertising) and operational decisions (such as inventory levels). This paper examines a scenario where a firm jointly determines pricing, advertising, and inventory decisions over T periods while learning about demand and advertising response models. Methodology/results: We first characterize a set of sufficient conditions to achieve exponentially fast learning rates with cross-functional decisions. Based on these sufficient conditions, we propose an easy-to-implement policy that is asymptotically optimal, showing that the gap between the profit of this policy and that of a clairvoyant with perfect information on the demand and advertising models is of order [Formula: see text]. Numerical experiments reveal that joint learning about the advertising and demand models is crucial for good profit performance. Managerial implications: Our findings emphasize the need to jointly consider marketing and operational decisions for better business outcomes, providing valuable insights for entrepreneurs and managers. Our learning conditions highlight that the connections between cross-functional decisions play a key role in learning the impact of these decisions on consumers. Moreover, our numerical studies indicate that deviating from our learning conditions to avoid experimentation results in poor profit performance. Overall, our integrated approach can lead to better resource allocation, improved customer understanding, and increased profitability for firms. Funding: N. B. Keskin acknowledges financial support from Duke University Fuqua School of Business, and R. P. Parker acknowledges financial support from the Conrad Prebys Professorship. Supplemental Material: The online appendices are available at https://doi.org/10.1287/msom.2024.1182 .

  • Frontiers in Operations: Show-Up Profiles for Scheduled Services: Estimation and Applications

    by Fernando Bernstein, N. Bora Keskin, Adam Mersereau, Morgan Wood, Serhan Ziya

    Problem definition: Motivated by passenger arrivals at the security checkpoint of the Raleigh-Durham International Airport, we develop methods to study arrivals to a system in which they are tied to scheduled events, such as flights. A key concept for modeling arrivals in such systems is the “show-up profile,” a probability distribution describing how far in advance passengers arrive for their flights. These profiles can be combined based on a known flight schedule to yield an aggregate passenger arrival forecast. Existing industry practice and academic work estimate show-up profiles using surveys or other data that are typically not available to U.S. airports. This motivates our study of an easy to implement and dynamic method for estimating show-up profiles. Methodology/results: We introduce an innovative solution for estimating show-up profiles using infrared-beam people-counting sensors and a structural estimation approach that does not require a mapping of passengers to flights. A direct maximum likelihood approach is intractable, but we propose a tractable approximation and prove that it yields consistent estimates of the underlying show-up profile parameters. Our approach produces forecasting results comparable to pure machine learning methods, yields significantly improved adaptive forecasts when combined with machine learning methods, and reveals empirical insights about passenger behavior variations across different times of day and flight destinations. Managerial implications: Our work presents a novel application of Internet of Things technology to service operations with incomplete data and demonstrates the value of integrating known operational structure with black box forecasting approaches. Show-up profiles are used at airports for decision making, for example, for crowd management, and our methodology has the potential to drive significant improvements in airport operations. The methods we develop can be readily applied at U.S. airports and other transportation hubs, and they can be adapted to other event-driven service environments such as theaters, healthcare facilities, and museums. History: This paper has been accepted in the Manufacturing & Service Operations Management Frontiers in Operations Initiative. Funding: This work was supported by the 2021 Triangle Impact Challenge. Supplemental Material: The online appendices are available at https://doi.org/10.1287/msom.2024.1575 .

  • Markdown Policies for Demand Learning with Forward-Looking Customers

    by John R. Birge, Hongfan (Kevin) Chen, N. Bora Keskin

    Markdown Policies for Demand Learning with Forward-Looking Customers Demand uncertainty and forward-looking customer behavior pose substantial challenges for sellers. In “Markdown policies for demand learning with forward-looking customers,” Birge, Chen, and Keskin analyze a markdown pricing problem involving demand model uncertainty and strategic customers. The authors identify that strategic customer behavior creates a strong intertemporal dependence, where early markdowns influence later demand outcomes. They characterize the impact of this intertemporal dependence on demand learning and develop near-optimal policies that judiciously delay markdowns to manage forward-looking customer behavior while ensuring efficient learning.


  • Data-Driven Clustering and Feature-Based Retail Electricity Pricing with Smart Meters

    by N. Bora Keskin, Yuexing Li, Nur Sunar

    The adoption of smart meters and dynamic pricing programs is rapidly increasing among electric utility companies. In “Data-Driven Clustering and Feature-Based Retail Electricity Pricing with Smart Meters,” Keskin, Li, and Sunar analyze how utility companies should use smart meter data for better pricing decisions. Utility companies typically have access to consumption patterns and high-dimensional features on customer characteristics and exogenous factors. The authors identify that such feature data can exhibit different forms of heterogeneity—over time and over customers. They show that the different forms of feature heterogeneity significantly worsen the best profit performance that can be achieved by a data-driven dynamic pricing policy. The authors also develop a policy based on joint spectral clustering and contextual dynamic pricing and prove that this policy achieves near-optimal profit performance.


  • Top Cited Papers

    The Blockchain Newsvendor: Value of Freshness Transparency and Smart Contracts

    by N. Bora Keskin, Chenghuai Li, Jing-Sheng Song

    Motivated by blockchain applications in the fresh produce industry, we consider a newsvendor problem in which a retailer faces stochastic and freshness-dependent consumer demand. The retailer can adopt blockchain technology to have more transparent information on the freshness of supply. We quantify the value of blockchain-enabled freshness transparency by deriving closed-form expressions for the retailer’s expected profit growth and food waste reduction brought by blockchain adoption. Using publicly available data, we provide a numerical example illustrating that for Walmart’s strawberry business in the United States (which is about only 4% of Walmart’s fresh produce sales), blockchain can increase annual profit by [ ] million while eliminating 23 million pounds of food waste annually through operational improvements. Despite this substantial value for the retailer, blockchain adoption can decrease the expected profit of the retailer’s supplier. We design a family of threshold-type smart contracts contingent on a blockchain-based freshness consensus and examine when such contracts offer a win-win proposition to the retailer and the supplier. Moreover, when the retailer offers freshness-based price discounts, we find that less fresh supply leads to less food waste. In contrast, when the supplier adjusts the wholesale price based on freshness, less fresh supply causes more food waste. We also generalize our findings to the cases of (i) dual sourcing, (ii) noisy measurements in the Internet of Things sensors feeding data into blockchain, and (iii) the retailer’s culling processes. This paper was accepted by David Simchi-Levi, operations management. Supplemental Material: The online appendix and data files are available at https://doi.org/10.1287/mnsc.2021.02949 .


  • To Interfere or Not To Interfere: Information Revelation and Price-Setting Incentives in a Multiagent Learning Environment

    by John R. Birge, Hongfan (Kevin) Chen, N. Bora Keskin, Amy Ward

    Demand uncertainty and seller competition are substantial challenges for online platforms. In “To Interfere or Not To Interfere: Information Revelation and Price-Setting Incentives in a Multiagent Learning Environment,” Birge, Chen, Keskin, and Ward analyze whether and how an online platform should offer demand information or price incentives to the sellers participating on the platform. The authors show that, when facing uncertain demand, the platform could be better off by doing nothing—that is, not providing any information or incentives to the sellers. They also develop a strategic reveal-and-incentivize policy for the platform to choose when to start sharing information and offering rewards to coordinate the sellers’ pricing. They prove that the strategic reveal-and-incentivize policy achieves near-optimal profit performance for the platform.


  • Selling Quality-Differentiated Products in a Markovian Market with Unknown Transition Probabilities

    by N. Bora Keskin, Meng Li

    How to Price a Product Line When Customer Preferences Change over Time Quality-differentiated products can help sellers increase their profits through market segmentation. However, in many business applications, such as online search and consumer lending, customer preferences evolve over time, making it difficult for sellers to use market segmentation. In their study “Selling Quality-Differentiated Products in a Markovian Market with Unknown Transition Probabilities,” Keskin and Li analyze dynamic pricing of a vertically differentiated product line when customer preferences for quality can shift over time. Keskin and Li show that data-driven learning is essential when operating in a changing market with unknown customer heterogeneity. Keskin and Li also develop a bounded learning policy that implements near-optimal data-driven learning in a Markov-modulated demand environment.


  • Top Cited Papers

    Dynamic Pricing with Demand Learning and Reference Effects

    by Arnoud V. Den Boer, N. Bora Keskin

    We consider a seller’s dynamic pricing problem with demand learning and reference effects. We first study the case in which customers are loss-averse: they have a reference price that can vary over time, and the demand reduction when the selling price exceeds the reference price dominates the demand increase when the selling price falls behind the reference price by the same amount. Thus, the expected demand as a function of price has a time-varying “kink” and is not differentiable everywhere. The seller neither knows the underlying demand function nor observes the time-varying reference prices. In this setting, we design and analyze a policy that (i) changes the selling price very slowly to control the evolution of the reference price and (ii) gradually accumulates sales data to balance the trade-off between learning and earning. We prove that, under a variety of reference-price updating mechanisms, our policy is asymptotically optimal; that is, its T-period revenue loss relative to a clairvoyant who knows the demand function and the reference-price updating mechanism grows at the smallest possible rate in T. We also extend our analysis to the case of a fixed reference price and show how reference effects increase the complexity of dynamic pricing with demand learning in this case. Moreover, we study the case in which customers are gain-seeking and design asymptotically optimal policies for this case. Finally, we design and analyze an asymptotically optimal statistical test for detecting whether customers are loss-averse or gain-seeking. This paper was accepted by Omar Besbes, revenue management and market analytics.