Bundling Strategies When Products Are Vertically Differentiated and Capacities Are Limited

We consider a seller who owns two capacity-constrained resources and markets two products (components) corresponding to these resources as well as a bundle comprising the two components. In an environment where all customers agree that one of the two components is of higher quality than the other and that the bundle is of the highest quality, we derive the seller's optimal bundling strategy. We demonstrate that the optimal solution depends on the absolute and relative availabilities of the two resources as well as upon the extent of subadditivity of the quality of the products. The possible strategies that can arise as equilibrium behavior include a pure components strategy, a partial- or full-spectrum mixed bundling strategy, and a pure bundling strategy, where the latter strategy is optimal when capacities are unconstrained. These conclusions are contrary to findings in the prior literature on bundling that demonstrated the unambiguous dominance of the full-spectrum mixed bundling strategy. Thus, our work expands the frontier of bundling to an environment with vertically differentiated components and limited resources. We also explore how the bundling strategies change as we introduce an element of horizontal differentiation wherein different types of customers value the available components differently.

Hierarchical Approach for Survivable Network Design

A central design challenge facing network planners is how to select a cost-effective network configuration that can provide uninterrupted service despite edge failures. In this paper, we study the Survivable Network Design (SND) problem, a core model underlying the design of such resilient networks that incorporates complex cost and connectivity trade-offs. Given an undirected graph with specified edge costs and (integer) connectivity requirements between pairs of nodes, the SND problem seeks the minimum cost set of edges that interconnects each node pair with at least as many edge-disjoint paths as the connectivity requirement of the nodes. We develop a hierarchical approach for solving the problem that integrates ideas from decomposition, tabu search, randomization, and optimization. The approach decomposes the SND problem into two subproblems, Backbone design and Access design, and uses an iterative multi-stage method for solving the SND problem in a hierarchical fashion. Since both subproblems are NP-hard, we develop effective optimization-based tabu search strategies that balance intensification and diversification to identify near-optimal solutions. To initiate this method, we develop two heuristic procedures that can yield good starting points. We test the combined approach on large-scale SND instances, and empirically assess the quality of the solutions vis-à-vis optimal values or lower bounds. On average, our hierarchical solution approach generates solutions within 2.7% of optimality even for very large problems (that cannot be solved using exact methods), and our results demonstrate that the performance of the method is robust for a variety of problems with different size and connectivity characteristics.

New Results Concerning Probability Distributions with Increasing Generalized Failure Rates

The generalized failure rate of a continuous random variable has demonstrable importance in operations management. If the valuation distribution of a product has an increasing generalized failure rate (that is, the distribution is IGFR), then the associated revenue function is unimodal, and when the generalized failure rate is strictly increasing, the global maximum is uniquely specified. The assumption that the distribution is IGFR is thus useful and frequently held in recent pricing, revenue, and supply chain management literature. This note contributes to the IGFR literature in several ways. First, it investigates the prevalence of the IGFR property for the left and right truncations of valuation distributions. Second, we extend the IGFR notion to discrete distributions and contrast it with the continuous distribution case. The note also addresses two errors in the previous IGFR literature. Finally, for future reference, we analyze all common (continuous and discrete) distributions for the prevalence of the IGFR property, and derive and tabulate their generalized failure rates.