Expected marginal seat revenue explained

EMSR stands for Expected Marginal Seat Revenue and is a very popular heuristic in Revenue Management. There are two versions: EMSRa^[1] and EMSRb,^[2] both of which were introduced by Peter Belobaba. Both methods are for n-class, static, single-resource problems. Because the models are static some assumptions apply: classes are indexed in such a way that the fare for the highest class,

r _{1} , is higher than the fare for the next highest class, r _{2} , so r _{1} > r _{2} > ... > r _{n} ; demand arrives in a strict low to high order in stages that are indexed with j as well; demand for class j is distributed with cdf F _{j(x)} . For simplicity it is also assumed that demand, capacity and the distributions are continuous, although it is not very difficult to drop this assumption.

EMSRa

EMSRa is the first version that Belobaba came up with. The idea behind the heuristic is to add the protection limits that are calculated by applying Littlewood's rule to successive classes. Suppose that we are in stage j+1 and we want to calculate how much capacity we need to protect for stages j, j-1,..., 1. Then we are actually calculating protection limit

y _j. To do so we consider every class in j, j-1,..., 1 and compare that class, indexed with k, with j+1 in isolation. For every combination of k and j+1 we compute the protection level for that class with Littlewood's rule:P ( D _{k} > y ^{j +1} _{k} ) = (r _{j+1})/(r _{k})

The idea of EMSRa then is to add all these protection limits to get the protection limit for

y _{j} .y _{j} = \sum ^{j} _{k =1} y ^{j +1} _{k}

However, there is a problem with this method because it does not take the statistical averaging effect into account. Suppose, for example, that classes 1 to j have the same fare r, then EMSRa will calculate the protection limit for

y _{j+1} withP( D _{k} > y ^{j +1} _{k} ) = (r _{j+1})/(r)

However, because the fare for all these classes is the same they should be aggregated. EMSRa will calculate protection limits that are too conservative. In other words, it will reserve too many seats for the higher fares, thereby rejecting too many low fare bookings. Although having equal fares is not realistic this will also happen if the difference between fares is small. Therefore EMSRb was invented.

EMSRb

One of the most widely used RM heuristics is EMSRb. It is simple and produces under certain conditions close to optimal results. Belobaba reports studies in which both EMSRa and EMSRb were compared. He shows that EMSRb is consistently within 0.5 percent of the optimal solution, while EMSRa under certain conditions can deviate more than 1.5 percent from the optimal solution. However, with mixed order of arrival and frequent re-optimization both methods perform well.^[3] There is also study by Polt that shows mixed results.^[4]

EMSRb is also based on an approximation that compares two classes, but it does take the statistical averaging effect into account. Instead of aggregating protection levels, as EMSRa does, it aggregates demand. Suppose we are again in stage

j +1 and we want to calculate the protection limit y _j. Then first all future demand for classes j, j-1,…, 1 is aggregated:S _{j} = \sum ^{j} _{k =1} D _{k}

and the weighted revenues are calculated:

\overline{r} _{j} = (\sum ^{j} _{k =1} r _{k} ⋅ \bar{D _{k})/() }

Then, again with Littlewood’s rule, the protection limit for classes j and higher is calculated such that:

P( S _{j} > y _{j} ) = (r _{j+1})/(\overline{r) _{j}}

Rearranging gives:

y ^{\star} _{j} is the optimal protection limit, F _{j} (x) is a continuous distribution used to model the demand. Usually demand is considered to be independent and distributed normally with a mean and a variance . Using that the protection limits can be calculated as:y _{j} = \mu _{j} + z _{\alpha} ⋅ \sigma _{j}

with the mean and variance of the demand to come as

\mu _{j} = \sum ^{j} _{k =1} \mu _{k} and \sigma ^{2} _{j} = \sum ^{j} _{k =1} \sigma ^{2} _{k} respectively. z _{\alpha} is calculated with the inverse of the normal distribution z _{\alpha} = \phi ^{-1} ( 1- (r _{j+1})/(\overline{r) _{j})} . This is done for each j, giving the protection limit for every class.

See also

• Yield management
• Littlewood's rule

Notes and References

1. Belobaba, P. P., Air Travel Demand and Airline Seat Inventory Management. Flight Transportation Laboratory. Cambridge, MIT. PhD, 1987
2. Belobaba, P. P., Optimal vs. heuristic methods for nested seat allocation. Presentation at ORSA/TIMS Joint National Meeting, 1992
3. Belobaba, P. P., Optimal vs. heuristic methods for nested seat allocation. Presentation at ORSA/TIMS Joint National Meeting, 1992
4. Polt, S., Back to the roots: New results on leg optimization. In 1999 AGIFORS Reservations and Yield Management Study Group Symposium, London, UK, 1999