Abstract We study the pricing of three-part tariffs (3PTs), where service providers charge a fixed fee with an allowance of free units, and a per-unit fee for additional units above the allowance. This is a pricing strategy that has been widely used in a variety of industries, including telecommunications and internet services. Many papers study the properties of the optimal solution of 3PTs. However, the existing solution approaches proposed in prior papers can only be used to solve 3PT problems under certain restricted conditions. Solving 3PT problems with multiple consumer types has been considered as “intractable” in the literature. In this paper, we provide an optimal solution for 3PT problem with multiple consumer types. We first provide a solution approach to solve 3PT problem with discrete units and multiple discrete consumer types whose willingness-to-pays for different units follow Spence-Mirrlees single-crossing property. The cost of our solution approach is low-rank polynomial to the problem size. We then extend the discrete solution to solve 3PT problems when the consumer types and unit amounts are not required to be discrete. The solution values for the continuous problems are within arbitrary prespecified error tolerances.
展开▼
