Fernando Bernstein
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Fernando Bernstein has a total of 13 co-authors. Here are the top co-authors by number of shared publications:
- Nuri Bora Keskin
Fuqua School of Business, Duke University, Durham, North Carolina 27708
3 shared publications - Adam J. Mersereau
Kenan-Flagler School of Business, The University of North Carolina at Chapel Hill, Chapel Hill, North Carolina 27599
2 shared publications - Morgan Wood
School of Business and Professional Studies, North Carolina Wesleyan University, Rocky Mount, North Carolina 27804
2 shared publications - Serhan Ziya
Department of Statistics and Operations Research, University of North Carolina at Chapel Hill, Chapel Hill, North Carolina 27599
2 shared publications Denis Sauré
Industrial Engineering Department, University of Chile, Republica 701, Santiago, Chile
1 shared publication- Denis Sauré
University of Chile, Industrial Engineering, Santiago, Chile
1 shared publication
Latest Publications
- 16 November 2026
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Operations Research
Exploration Optimization for Dynamic Assortment Personalization under Linear Preferences
We study dynamic assortment personalization, where an online retailer adaptively selects assortments based on customer attributes to learn preferences and maximize revenue. We assume that product utilities depend linearly on customer attributes through an unknown coefficient matrix, leading to an exploration–exploitation trade-off. We identify price-driven and linearity-driven exploration efficiencies, showing that not all products need to be offered to all customer profiles to recover optimal assortments. We establish an instance-dependent regret lower bound characterized by a linear program, which we call the Regret Lower Bound (RLB) problem. Because the RLB has a complex structure and depends non-trivially on unknown parameters, we introduce an alternative formulation, called the Exploration-Optimization problem, that yields an interpretable exploration structure and can be formulated as a tractable mixed-integer linear program. We develop learning policies that select efficient exploration sets by solving either problem and establish a regret upper bound for the Exploration-Optimization policy. Using data from a large Chilean retailer, we demonstrate that our policies substantially outperform Thompson sampling in terms of both regret and computational efficiency, while remaining scalable in practice.
- 16 November 2026
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Operations Research
Exploration Optimization for Dynamic Assortment Personalization under Linear Preferences
We study dynamic assortment personalization, where an online retailer adaptively selects assortments based on customer attributes to learn preferences and maximize revenue. We assume that product utilities depend linearly on customer attributes through an unknown coefficient matrix, leading to an exploration–exploitation trade-off. We identify price-driven and linearity-driven exploration efficiencies, showing that not all products need to be offered to all customer profiles to recover optimal assortments. We establish an instance-dependent regret lower bound characterized by a linear program, which we call the Regret Lower Bound (RLB) problem. Because the RLB has a complex structure and depends non-trivially on unknown parameters, we introduce an alternative formulation, called the Exploration-Optimization problem, that yields an interpretable exploration structure and can be formulated as a tractable mixed-integer linear program. We develop learning policies that select efficient exploration sets by solving either problem and establish a regret upper bound for the Exploration-Optimization policy. Using data from a large Chilean retailer, we demonstrate that our policies substantially outperform Thompson sampling in terms of both regret and computational efficiency, while remaining scalable in practice.
- 29 September 2026
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Management Science
Data-Driven Population Tracking in Service Systems
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 .
- 29 September 2026
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Management Science
Data-Driven Population Tracking in Service Systems
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 .
- 18 February 2026
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Manufacturing & Service Operations Management
Frontiers in Operations: Show-Up Profiles for Scheduled Services: Estimation and Applications
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 .
- 18 February 2026
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Manufacturing & Service Operations Management
Frontiers in Operations: Show-Up Profiles for Scheduled Services: Estimation and Applications
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 .
- 1 September 2023
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Manufacturing & Service Operations Management
- Vol. 25 (5) , 1623-1642
Managing Customer Search: Assortment Planning for a Subscription Box Service
Problem definition: This paper focuses on subscription box services in which a provider selects the assortment of products to include in the box by taking into account the customer’s preferences. Customers interested in purchasing a product choose between engaging in active search (i.e., visit physical stores) or subscribing to a box delivery service. We study the subscription box company’s problem of selecting the optimal contents of the box to maximize expected revenue (by driving demand from customers). Methodology/results: Because a product may be both available at a store and included in the box, the assortment in a box affects the set of stores that a customer would visit under active search and, therefore, the customer’s subscription decision. We model such interaction by applying a cross-nested logit framework that correlates the contents in the box with the products available at the stores. We find that the box should include a collection of popular subsets of the store products for customers that experience a relatively low or relatively high search cost. If a preview of the box is available, we find that, for customers with intermediate values of the search cost, it may be optimal to include a so-called utility loss leader, that is, a product with relatively low valuation, to entice customers to subscribe to the box delivery service and therefore increase the likelihood of a sale. We use rational expectations to model a setting in which a preview of the box is not available. In such cases, it is never optimal to include a utility loss leader in the box. Managerial implications: Our model captures the impact of product overlap across different shopping channels on customer choice and the subscription box company assortment decision. We derive insights on how the subscription service provider should determine the contents of the box in anticipation of the customer’s search behavior. We also examine the decision of offering exclusive products in addition to branded items. Supplemental Material: The online appendix is available at https://doi.org/10.1287/msom.2023.1204 .
- 1 September 2023
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Manufacturing & Service Operations Management
- Vol. 25 (5) , 1623-1642
Managing Customer Search: Assortment Planning for a Subscription Box Service
Problem definition: This paper focuses on subscription box services in which a provider selects the assortment of products to include in the box by taking into account the customer’s preferences. Customers interested in purchasing a product choose between engaging in active search (i.e., visit physical stores) or subscribing to a box delivery service. We study the subscription box company’s problem of selecting the optimal contents of the box to maximize expected revenue (by driving demand from customers). Methodology/results: Because a product may be both available at a store and included in the box, the assortment in a box affects the set of stores that a customer would visit under active search and, therefore, the customer’s subscription decision. We model such interaction by applying a cross-nested logit framework that correlates the contents in the box with the products available at the stores. We find that the box should include a collection of popular subsets of the store products for customers that experience a relatively low or relatively high search cost. If a preview of the box is available, we find that, for customers with intermediate values of the search cost, it may be optimal to include a so-called utility loss leader, that is, a product with relatively low valuation, to entice customers to subscribe to the box delivery service and therefore increase the likelihood of a sale. We use rational expectations to model a setting in which a preview of the box is not available. In such cases, it is never optimal to include a utility loss leader in the box. Managerial implications: Our model captures the impact of product overlap across different shopping channels on customer choice and the subscription box company assortment decision. We derive insights on how the subscription service provider should determine the contents of the box in anticipation of the customer’s search behavior. We also examine the decision of offering exclusive products in addition to branded items. Supplemental Material: The online appendix is available at https://doi.org/10.1287/msom.2023.1204 .
- 1 May 2022
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Manufacturing & Service Operations Management
- Vol. 24 (3) , 1664-1680
Intertemporal Content Variation with Customer Learning
Problem definition: We analyze a firm that sells repeatedly to a customer population over multiple periods. Although this setting has been studied extensively in the context of dynamic pricing—selling the same product in each period at a varying price—we consider intertemporal content variation, wherein the price is the same in every period, but the firm varies the content available over time. Customers learn their utility on purchasing and decide whether to purchase again in subsequent periods. The firm faces a budget for the total amount of content available during a finite planning horizon, and allocates content to maximize revenue. Academic/practical relevance: A number of new business models, including video streaming services and curated subscription boxes, face the situation we model. Our results show how such firms can use content variation to increase their revenues. Methodology: We employ an analytical model in which customers decide to purchase in multiple successive periods and a firm determines a content allocation policy to maximize revenue. Results: Using a lower bound approximation to the problem for a horizon of general length T, we show that, although the optimal allocation policy is not, in general, constant over time, it is monotone: content value increases over time if customer heterogeneity is low and decreases otherwise. We demonstrate that the optimal policy for this lower bound problem is either optimal or very close to optimal for the general T period problem. Furthermore, for the case of T = 2 periods, we show how two critical factors—the fraction of “new” versus “repeat” customers in the population and the size of the content budget—affect the optimal allocation policy and the importance of varying content value over time. Managerial implications: We show how firms that sell at a fixed price over multiple periods can vary content value over time to increase revenues.
- 1 May 2022
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Manufacturing & Service Operations Management
- Vol. 24 (3) , 1664-1680
Intertemporal Content Variation with Customer Learning
Problem definition: We analyze a firm that sells repeatedly to a customer population over multiple periods. Although this setting has been studied extensively in the context of dynamic pricing—selling the same product in each period at a varying price—we consider intertemporal content variation, wherein the price is the same in every period, but the firm varies the content available over time. Customers learn their utility on purchasing and decide whether to purchase again in subsequent periods. The firm faces a budget for the total amount of content available during a finite planning horizon, and allocates content to maximize revenue. Academic/practical relevance: A number of new business models, including video streaming services and curated subscription boxes, face the situation we model. Our results show how such firms can use content variation to increase their revenues. Methodology: We employ an analytical model in which customers decide to purchase in multiple successive periods and a firm determines a content allocation policy to maximize revenue. Results: Using a lower bound approximation to the problem for a horizon of general length T, we show that, although the optimal allocation policy is not, in general, constant over time, it is monotone: content value increases over time if customer heterogeneity is low and decreases otherwise. We demonstrate that the optimal policy for this lower bound problem is either optimal or very close to optimal for the general T period problem. Furthermore, for the case of T = 2 periods, we show how two critical factors—the fraction of “new” versus “repeat” customers in the population and the size of the content budget—affect the optimal allocation policy and the importance of varying content value over time. Managerial implications: We show how firms that sell at a fixed price over multiple periods can vary content value over time to increase revenues.
- Top Cited Papers
- 1 September 2021
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Manufacturing & Service Operations Management
- Vol. 23 (5) , 1043-1061
Competition Between Two-Sided Platforms Under Demand and Supply Congestion Effects
Problem definition : This paper explores the impact of competition between platforms in the sharing economy. Examples include the cases of Uber and Lyft in the context of ride-sharing platforms. In particular, we consider competition between two platforms that offer a common service (e.g., rides) through a set of independent service providers (e.g., drivers) to a market of customers. Each platform sets a price that is charged to customers for obtaining the service provided by a driver. A portion of that price is paid to the driver who delivers the service. Both customers’ and drivers’ utilities are sensitive to the payment terms set by the platform and are also sensitive to congestion in the system (given by the relative number of customers and drivers in the market). We consider two possible settings. The first one, termed “single-homing,” assumes that drivers work through a single platform. In the second setting, termed “multihoming” (or “multiapping,” as it is known in practice), drivers deliver their service through both platforms. Academic/practical relevance : This is one of the first papers to study competition and multihoming in the presence of congestion effects typically observed in the sharing economy. We leverage the model to study some practical questions that have received significant press attention (and stirred some controversies) in the ride-sharing industry. The first involves the issue of surge pricing. The second involves the increasingly common practice of drivers choosing to operate on multiple platforms (multihoming). Methodology : We formulate our problem as a pricing game between two platforms and employ the concept of a Nash equilibrium to analyze equilibrium outcomes in various settings. Results : In both the single-homing and multihoming settings, we study the equilibrium prices that emerge from the competitive interaction between the platforms and explore the supply and demand outcomes that can arise at equilibrium. We build on these equilibrium results to study the impact of surge pricing in response to a surge in demand and to examine the incentives at play when drivers engage in multihoming. Managerial implications : We find that raising prices in response to a surge in demand makes drivers and customers better off than if platforms were constrained to charge the same prices that would arise under normal demand levels. We also compare drivers’ and customers’ performance when all drivers either single-home or multihome. We find that although individual drivers may have an incentive to multihome, all players are worse off when all drivers multihome. We conclude by proposing an incentive mechanism to discourage multihoming.
- 1 September 2021
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Manufacturing & Service Operations Management
- Vol. 23 (5) , 1043-1061
Top Cited PapersCompetition Between Two-Sided Platforms Under Demand and Supply Congestion Effects
Problem definition : This paper explores the impact of competition between platforms in the sharing economy. Examples include the cases of Uber and Lyft in the context of ride-sharing platforms. In particular, we consider competition between two platforms that offer a common service (e.g., rides) through a set of independent service providers (e.g., drivers) to a market of customers. Each platform sets a price that is charged to customers for obtaining the service provided by a driver. A portion of that price is paid to the driver who delivers the service. Both customers’ and drivers’ utilities are sensitive to the payment terms set by the platform and are also sensitive to congestion in the system (given by the relative number of customers and drivers in the market). We consider two possible settings. The first one, termed “single-homing,” assumes that drivers work through a single platform. In the second setting, termed “multihoming” (or “multiapping,” as it is known in practice), drivers deliver their service through both platforms. Academic/practical relevance : This is one of the first papers to study competition and multihoming in the presence of congestion effects typically observed in the sharing economy. We leverage the model to study some practical questions that have received significant press attention (and stirred some controversies) in the ride-sharing industry. The first involves the issue of surge pricing. The second involves the increasingly common practice of drivers choosing to operate on multiple platforms (multihoming). Methodology : We formulate our problem as a pricing game between two platforms and employ the concept of a Nash equilibrium to analyze equilibrium outcomes in various settings. Results : In both the single-homing and multihoming settings, we study the equilibrium prices that emerge from the competitive interaction between the platforms and explore the supply and demand outcomes that can arise at equilibrium. We build on these equilibrium results to study the impact of surge pricing in response to a surge in demand and to examine the incentives at play when drivers engage in multihoming. Managerial implications : We find that raising prices in response to a surge in demand makes drivers and customers better off than if platforms were constrained to charge the same prices that would arise under normal demand levels. We also compare drivers’ and customers’ performance when all drivers either single-home or multihome. We find that although individual drivers may have an incentive to multihome, all players are worse off when all drivers multihome. We conclude by proposing an incentive mechanism to discourage multihoming.
- 5 September 2018
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Management Science
- Vol. 65 (5) , 2095-2115
A Dynamic Clustering Approach to Data-Driven Assortment Personalization
We consider an online retailer facing heterogeneous customers with initially unknown product preferences. Customers are characterized by a diverse set of demographic and transactional attributes. The retailer can personalize the customers’ assortment offerings based on available profile information to maximize cumulative revenue. To that end, the retailer must estimate customer preferences by observing transaction data. This, however, may require a considerable amount of data and time given the broad range of customer profiles and large number of products available. At the same time, the retailer can aggregate (pool) purchasing information among customers with similar product preferences to expedite the learning process. We propose a dynamic clustering policy that estimates customer preferences by adaptively adjusting customer segments (clusters of customers with similar preferences) as more transaction information becomes available. We test the proposed approach with a case study based on a data set from...
- 5 September 2018
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Management Science
- Vol. 65 (5) , 2095-2115
A Dynamic Clustering Approach to Data-Driven Assortment Personalization
We consider an online retailer facing heterogeneous customers with initially unknown product preferences. Customers are characterized by a diverse set of demographic and transactional attributes. The retailer can personalize the customers’ assortment offerings based on available profile information to maximize cumulative revenue. To that end, the retailer must estimate customer preferences by observing transaction data. This, however, may require a considerable amount of data and time given the broad range of customer profiles and large number of products available. At the same time, the retailer can aggregate (pool) purchasing information among customers with similar product preferences to expedite the learning process. We propose a dynamic clustering policy that estimates customer preferences by adaptively adjusting customer segments (clusters of customers with similar preferences) as more transaction information becomes available. We test the proposed approach with a case study based on a data set from...
- 15 May 2012
- Published by Emerald Publishing in Foundations and Trends® in Technology, Information and Operations Management
- Vol. 5 (2) , 87-145
Competition and Cooperative Bargaining Models in Supply Chains
In the last two decades or so, a significant emphasis of the research literature in operations management has been on the strategic interaction of firms in a supply chain. Individual firms in supply chains make decisions on multiple levers such as capacity, inventory and price, to name a few, that have consequences for the entire supply chain. In modeling strategic interactions, the operations literature has followed the large literature in industrial organization and economics. Competition between firms in a supply chain has largely been modeled using noncooperative game theory and the associated concepts of equilibrium that predict the outcomes. There are a few key differences between the industrial organization literature and the research in operations management. First of all, the operations literature looks more at operational variables, such as capacity and inventory, as a response to various sources of process uncertainty that any firm faces. The preferences of individual customers, their valuations and the construction of the specific form of the uncertainty is less of a concern (although more recent literature emphasize this). Second, the findings in the operations literature usually have the objective of improving individual firms’ (and supply chains’) profits and operational efficiencies rather than one of dictating economic policy. Third, although non-cooperative models are the norm, there is also an underlying emphasis in the operations literature on cooperation between firms in a supply chain to improve the overall profit of the supply chain. This is probably because, unlike the levers traditionally studied in economics, many operational variables in a supply chain are often jointly decided between firms. The goal of this review taps on this last sentiment. We provide an overview of some of the basic multi-firm models studied in supply chain management. We look at how the literature uses non-cooperative game theory to analyze these models. We then look at how some of these models can be analyzed using a cooperative bargaining framework. We compare the modeling tools and the insights one obtains by taking this twofold approach. This process also allows us to discuss a few topics of interest such as the relative channel power of a firm, the relative merits of using a non-cooperative game versus cooperative bargaining to model a supply chain setting, etc. Finally, we conclude this review by exploring some issues that remain unresolved and are topics for future research.
- 15 May 2012
- Published by Emerald Publishing in Foundations and Trends® in Technology, Information and Operations Management
- Vol. 5 (2) , 87-145
Competition and Cooperative Bargaining Models in Supply Chains
In the last two decades or so, a significant emphasis of the research literature in operations management has been on the strategic interaction of firms in a supply chain. Individual firms in supply chains make decisions on multiple levers such as capacity, inventory and price, to name a few, that have consequences for the entire supply chain. In modeling strategic interactions, the operations literature has followed the large literature in industrial organization and economics. Competition between firms in a supply chain has largely been modeled using noncooperative game theory and the associated concepts of equilibrium that predict the outcomes. There are a few key differences between the industrial organization literature and the research in operations management. First of all, the operations literature looks more at operational variables, such as capacity and inventory, as a response to various sources of process uncertainty that any firm faces. The preferences of individual customers, their valuations and the construction of the specific form of the uncertainty is less of a concern (although more recent literature emphasize this). Second, the findings in the operations literature usually have the objective of improving individual firms’ (and supply chains’) profits and operational efficiencies rather than one of dictating economic policy. Third, although non-cooperative models are the norm, there is also an underlying emphasis in the operations literature on cooperation between firms in a supply chain to improve the overall profit of the supply chain. This is probably because, unlike the levers traditionally studied in economics, many operational variables in a supply chain are often jointly decided between firms. The goal of this review taps on this last sentiment. We provide an overview of some of the basic multi-firm models studied in supply chain management. We look at how the literature uses non-cooperative game theory to analyze these models. We then look at how some of these models can be analyzed using a cooperative bargaining framework. We compare the modeling tools and the insights one obtains by taking this twofold approach. This process also allows us to discuss a few topics of interest such as the relative channel power of a firm, the relative merits of using a non-cooperative game versus cooperative bargaining to model a supply chain setting, etc. Finally, we conclude this review by exploring some issues that remain unresolved and are topics for future research.