In this paper, we consider cost-sharing problems defined on rooted trees. We refer to these problems as cost-tree problems and to the induced transferable utility cooperative games as irrigation games. We introduce a formal notion of irrigation games and provide a characterization of this class of games. The well-known class of airport games (Littlechild and Thompson 1977 ) is shown to be a subclass of irrigation games. The Shapley value (Shapley 1953 ) is arguably the most widely used solution concept for transferable utility cooperative games. Dubey ( 1982 ) and Moulin and Shenker ( 1992 ) show, respectively, that the axiomatizations of the Shapley value due to Shapley ( 1953 ) and Young ( 1985 ) remain valid for the class of airport games. In this paper, we extend the results of Dubey ( 1982 ) and Moulin and Shenker ( 1992 ) to the broader class of irrigation games. Specifically, we provide two characterizations of the Shapley value for cost-sharing problems defined on rooted trees. In these characterization results, we relate the terminology of transferable utility games to that of cost-sharing problems, thereby establishing a bridge between the two fields.
Márkus, Judit, Pintér, Miklós, Radványi, Anna. The Shapley value for airport and irrigation games. // Central European Journal of Operations Research. – 2026. – DOI: 10.1007/s10100-026-01039-5. – URL: http://link.springer.com/openurl/fulltext?id=doi:10.1007/s10100-026-01039-5
Márkus, Judit, Pintér, Miklós, Radványi, & Anna (2026). The Shapley value for airport and irrigation games. Central European Journal of Operations Research. https://doi.org/10.1007/s10100-026-01039-5
Márkus, et al. “The Shapley value for airport and irrigation games.” Central European Journal of Operations Research, 2026. doi:10.1007/s10100-026-01039-5.
@article{Mrkus2026,
title = {The Shapley value for airport and irrigation games},
author = {Márkus and Judit and Pintér and Miklós and Radványi and Anna},
journal = {Central European Journal of Operations Research},
year = {2026},
doi = {10.1007/s10100-026-01039-5},
url = {http://link.springer.com/openurl/fulltext?id=doi:10.1007/s10100-026-01039-5}
}
In this paper, we focus on nonlinear programming problems with cardinality constraints that restrict the number of nonzero components of the decision vector. We start with a straightforward mixed-integer programming reformulation....
Portfolio selection is a critical issue in financial management under uncertainty. In this paper, we propose a complex approach for portfolio selection with quantile return approximation. In particular, we propose a practical workflow...
The transcendental logarithmic (translog) production function is recognised as a flexible functional form for modelling production processes. It accommodates varying elasticities of input substitution and diverse types of...
This study investigates mothership-drone route determination using two optimization approaches: a Mixed Integer Linear Programming (MILP) model based on a discrete hexagonal grid, and a Mixed Integer Nonlinear Programming (MINLP) model...
Over the past few years, the expansion of e-commerce has led to a substantial rise in last-mile delivery operations. Within this scenario, retailers have primarily concentrated on enhancing service performance, frequently neglecting the...