Author
Listed:
- David Lowing
(CentraleSupélec, LGI - Laboratoire Génie Industriel - CentraleSupélec - Université Paris-Saclay)
- Léa Munich
(BETA - Bureau d'Économie Théorique et Appliquée - AgroParisTech - UNISTRA - Université de Strasbourg - Université de Haute-Alsace (UHA) - Université de Haute-Alsace (UHA) Mulhouse - Colmar - UL - Université de Lorraine - CNRS - Centre National de la Recherche Scientifique - INRAE - Institut National de Recherche pour l’Agriculture, l’Alimentation et l’Environnement, CRESE - Centre de REcherches sur les Stratégies Economiques (UR 3190) - UFC - Université de Franche-Comté - UBFC - Université Bourgogne Franche-Comté [COMUE])
- Kevin Techer
(GATE Lyon Saint-Étienne - Groupe d'Analyse et de Théorie Economique Lyon - Saint-Etienne - ENS de Lyon - École normale supérieure de Lyon - UL2 - Université Lumière - Lyon 2 - UCBL - Université Claude Bernard Lyon 1 - Université de Lyon - UJM - Université Jean Monnet - Saint-Étienne - CNRS - Centre National de la Recherche Scientifique, UJM - Université Jean Monnet - Saint-Étienne)
Abstract
Accurate cost allocation is a challenge for both public service operators and regulatory bodies, given the dual objectives of ensuring essential public service provision and maintaining fair competition. Operators have the obligation to provide essential public services for all individuals, which may incur additional costs. To ompensate this, the operators receive state aids, which are determined by an assessment of the net cost associated with these obligations. However, these aids introduce the risk of distorting competition, as operators may employ them to subsidize competitive activities. To avoid this risk, a precise cost allocation method that adequately assess the net cost of these obligations becomes necessary. Such a method must satisfy specific properties that effectively prevent cross-subsidization. In this paper, we propose a method grounded in cooperative game theory that offers a solution for allocating common costs between activities and obligations in public service provision. We adopt a normative approach by introducing a set of desirable axioms that prevent cross-subsidization. We provide two characterizations of our proposed solution on the basis of these axioms. Furthermore, we present an illustration of our method to the allocation of common costs for a public service operator.
Suggested Citation
David Lowing & Léa Munich & Kevin Techer, 2024.
"Allocating the common costs of a public service operator: an axiomatic approach,"
Working Papers
hal-04428081, HAL.
Handle:
RePEc:hal:wpaper:hal-04428081
Note: View the original document on HAL open archive server: https://univ-fcomte.hal.science/hal-04428081v1
Download full text from publisher
Corrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:hal:wpaper:hal-04428081. See general information about how to correct material in RePEc.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
We have no bibliographic references for this item. You can help adding them by using this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: CCSD (email available below). General contact details of provider: https://hal.archives-ouvertes.fr/ .
Please note that corrections may take a couple of weeks to filter through
the various RePEc services.