Article ID: | iaor20123238 |
Volume: | 220 |
Issue: | 2 |
Start Page Number: | 510 |
End Page Number: | 521 |
Publication Date: | Jul 2012 |
Journal: | European Journal of Operational Research |
Authors: | Kimms Alf, etiner Demet |
Keywords: | economics, combinatorial optimization, scheduling, game theory |
Alliances allow the airlines to extend their networks and increase the number of destinations they can access. Different from the traditional single airline approach, in an alliance, partner airlines may sell tickets for the same itinerary. In addition, one itinerary may consist of several flight legs, each of which may be operated by a different airline. A major issue that needs to be addressed is how to share the revenue generated from selling a ticket for a product among the individual airlines in a fair way. The fair allocation of the revenue has a critical importance for the long‐term stability of the alliance. We model the problem as a cooperative game and show that the core of the game is non‐empty. We propose to use a revenue proration scheme based on the concept of the nucleolus. The numerical studies reveal that the revenue shares can effectively be computed even for large alliance networks.