NANarendra Agrawal

Narendra Agrawal

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

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Narendra Agrawal has a total of 53 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Top Cited Papers

    OM Forum—Supply Chain Management in the AI Era: A Vision Statement from the Operations Management Community

    by Maxime C. Cohen, Tinglong Dai, Georgia Perakis, Narendra Agrawal, Gad Allon, Robert N. Boute, Gérard P. Cachon, Zhe Chen, Morris Cohen, Rares Cristian, et al.

    Problem definition: Artificial intelligence (AI) is rapidly transforming the research and practice of supply chain management. Yet its impact depends on how effectively it is integrated with the theories, methods, and fundamental principles of operations management (OM), which must also evolve to account for the informational, incentive, and institutional changes brought by AI. The OM community has an important role and responsibility to lead in shaping not only how AI transforms supply chains but also how the supply chains that enable AI are designed to be sustainable, resilient, and equitable. Methodology/results: This vision statement organizes the discussion around five layers of the interaction between AI and supply chain management: intelligence, execution, strategy, human, and infrastructure. It synthesizes recent research and industry practice to show how AI enhances forecasting, planning, decision making, risk management, and human–machine collaboration and also examines the supply chains that support AI. Finally, it highlights persistent challenges in data quality, model integration, governance, and workforce adaptation. Managerial implications: Realizing AI’s promise in supply chain management requires reliable data and infrastructure, integration of learning and optimization, transparent and explainable decision systems, and a long-term commitment to human–AI collaboration. Together, these elements form the foundation for resilient, adaptive, and trustworthy supply chains in the AI era.


  • Open Access

    AI for Supply Chain: Today and Future

    by Ranak Roy Chowdhury, Yan Liu, Huiming Qu, Qingsong Wen, Chen-Yu Lee, Narendra Agrawal, Alexis Roos

  • Dynamic Pricing and Bidding for Display Advertising Campaigns

    by Narendra Agrawal, Sami Najafi-Asadolahi, Stephen A. Smith

    Problem definition: Managers in digital ad agencies face the complex problem of setting prices for new ad campaigns, bidding for viewers on ad exchanges, and allocating them appropriately to campaigns. We have developed an analytical methodology for optimizing the agency’s profits, with uncertainties in the arrival of potential viewers and new ad campaigns and in winning bids and obtaining viewer actions on ad exchanges. Methodology/results: The ad agency manages a series of contracts with advertisers who wish to display their ads to randomly arriving targeted viewers. Advertisers differ in their delay costs and willingness to pay for obtaining various actions by these viewers. We formulate the ad agency’s sequential decision problem as a Markov decision process and develop exact solutions for both finite-horizon and steady-state cases. In our numerical analysis, we find that the finite-horizon dynamic programming (DP) solutions converge quickly to time-invariant policies, which are shown to be equivalent to the steady-state solutions. We also develop and test two heuristics that allow our solution methods to be scaled for large problems. Managerial implications: Several managerial implications follow from our paper, which is the first to address this multifaceted ad agency decision problem: (i) managers can exercise three key operational levers to maximize profits: campaign pricing, bidding strategy, and the queue capacity for campaign outcomes; (ii) the effectiveness of these levers varies in different situations, as illustrated by our numerical sensitivity analysis; (iii) optimal dynamic policies that depend on the queue length deliver significantly better profits than optimal static policies; (iv) appropriately designed heuristics can provide accurate solution methods that can be scaled to accommodate the large numbers of campaign outcomes frequently requested in practice; and (v) combining ad campaigns or merging ad agencies leads to higher total profits for the ad agency, lower prices for ad campaigns, and decreased delays in obtaining campaign outcomes. Supplemental Material: The online appendix is available at https://doi.org/10.1287/msom.2023.0600 .


  • Case Article—Analysis of Call Center Data at Patelco Credit Union

    by Narendra Agrawal

    This case focuses on operational challenges faced by customer service centers, or call centers. The specific context for these cases is Patelco, which is a California based credit union. Patelco is facing a rising number of complaints about customer service, specifically, about the long delay customers had to face when they called one of Patelco‘s four call centers. The purpose of this case is to expose students to the statistical analysis of some of the raw data, obtained from such an environment, to support the investigation of call center performance. Important managerial insights can be drawn by summarizing the data graphically as well as quantitatively. In particular, the data can be used to show students how to perform a number of useful hypothesis tests, which are often needed to answer important questions that arise when assessing the performance of any system. The outcomes from these analyses can provide important managerial insights. In the operations management literature, and in practice, a number of modeling assumptions are made about the distribution of data to facilitate quantitative analysis. However, these assumptions are often not statistically validated. This case study gives students an opportunity to test such assumptions. This case can be used in graduate and undergraduate classes in Operations Management, Supply Chain Management and Service Operations to review statistical concepts related to the topic of queuing analysis, or in a Statistics class to illustrate data analysis and statistical tests in a real-world context.

  • A Markov Decision Model for Managing Display-Advertising Campaigns

    by Narendra Agrawal, Sami Najafi-Asadolahi, Stephen A. Smith

    Problem definition: Managers in ad agencies are responsible for delivering digital ads to viewers on behalf of advertisers, subject to the terms specified in the ad campaigns. They need to develop bidding policies to obtain viewers on an ad exchange and allocate them to the campaigns to maximize the agency’s profits, subject to the goals of the ad campaigns. Academic/practical relevance: Determining a rigorous solution methodology is complicated by uncertainties in the arrival rates of viewers and campaigns, as well as uncertainty in the outcomes of bids on the ad exchange. In practice, ad hoc strategies are often deployed. Our methodology jointly determines optimal bidding and viewer-allocation strategies and obtains insights about the characteristics of the optimal policies. Methodology: New ad campaigns and viewers are treated as Poisson arrivals, and the resulting model is a Markov decision process, where the state of the system is the number of undelivered impressions in queue for each campaign type in each period. We develop solution methods for bid optimization and viewer allocation and perform a sensitivity analysis with respect to the key problem parameters. Results: We solve for the optimal dynamic, state-dependent bidding and allocation policies as a function of the number of ad impressions in queue, for both the finite horizon and steady-state cases. We show that the resulting optimization problems are strictly concave in the decision variables and develop and evaluate a heuristic method that can be applied to large problems. Managerial implications: Numerical analysis of our heuristic solution shows that its errors are generally small and that the optimal dynamic, state-dependent bidding policies obtained by our model are significantly better than optimal static policies. Our proposed approach is managerially attractive because it is easy to implement in practice. We identify the capacity of the impression queue as an important managerial control lever and show that it can be more effective than using higher bids to reduce delay penalties. We quantify potential operational benefits from the consolidation of ad campaigns, as well as merging ad exchanges. Supplemental Material: The online appendix is available at https://doi.org/10.1287/msom.2022.1142 .