Estimation of bankruptcy rules with a priori unions for establishing new systems of quotas

Alejandro Saavedra-Nieves
Department of Statistics, Mathematical Analysis and Optimization. Universidade de Santiago de Compostela
ORCid: 0000-0003-1251-6525alejandro.saavedra.nieves@usc.es

Paula Saavedra-Nieves
CITMAga, Galician Centre for Mathematical Research and Technology.
Department of Statistics, Mathematical Analysis and Optimization Universidade de Santiago

ORCid: 0000-0002-3031-388Xpaula.saavedra@usc.es


Abstract

This paper addresses a sampling procedure for estimating extensions of the random arrival rule to those bankruptcy situations where there exist a priori unions. It is based on simple random sampling with replacement and it adapts an estimation method of the Owen value for transferable utility games with a priori unions, especially useful when the set of involved agents is sufficiently large. We analyse the theoretical statistical properties of the resulting estimator as well as we provide some bounds for the incurred error. Its performance is evaluated on two well-studied examples in literature where this allocation rule can be exactly obtained. Finally, we apply this sampling method to provide a new quota system for the milk market in Galicia (Spain) for checking the role of different territorial structures when they are taken as a priori unions. The resulting quotas estimator is also compared with two classical rules in bankruptcy literature.

Keywords: Multi-agent systems, bankruptcy, a priori unions, sampling techniques, milk quotas.

MSC Subject classifications: 93A16, 91-04, 91A68.

Introduction

Galicia is a Spanish autonomous community located in the Northwest of the Iberian Peninsula and in the Southwest of Europe with a remarkable dairy sector. In fact, it is the eighth dairy region in Europe and the leading dairy power in Spain employing around \(25000\) people. However, Spanish National Institute of Statistics (INE, Spanish National Institute of Statistics website, https://www.ine.es) indicates that the gross added value of the dairy activity in Galicia is barely 10% of that of the Spanish, when the community has 40% of the national milk and 60% of the producers. Nowadays, just over 7500 farms produce milk in Galicia, a tenth of those that were still active in the early 1990s, when milk quota regime in the European Union (EU) began to be rigorously implemented in order to overcome the surpluses when the production of milk far outstripped the demand.

Geographical location of Galicia in Europe using a map that represents the population concentration. Source: European Space Agency, https://www.esa.int/.

Those changes in the Common Agriculture Policy of the EU were devoted to help those dairy farmers from specially vulnerable areas providing EU producers more facilities in order to respond to an increasing demand of milk, by balancing price and production of milk. The end of the milk quotas regime in April 2015 caused an increase in production which derives into new problems in the dairy sector. The major consequence was that the milk price per liter of milk reduced. Mainly, because the EU was unable to predict the brutal production increase of countries such as Ireland and The Netherlands. Since several proposed initiatives were not able to solve the problem of milk prices, new measures after the abolition of these quotas such as a new Community policy or the establishment of a new upper-bound of the milk production could be addressed.

(Saavedra-Nieves A. and Saavedra-Nieves 2020) consider the problem of providing a new Galician system of milk quotas for the 190 councils that are milk producers. The main idea is that the milk prices will increase if we assume that the aggregate of the Galician milk production has to decrease with respect to April 2015 (last official regulation of the EU milk quotas that is summarized in Appendix A). Although this solution can not be popular among milk producers in a first step, their profits will be perceived in the long-term. Mathematically, the previous situation is treated as a bankruptcy problem. Bankruptcy problems have taken remarkable interest over the years due to their multiple applications. Their name refers to a usual problem in economics as the bankruptcy of a company. The existence of several creditors that claim a portion of a total estate is assumed. The main objective is to establish how we must divide the resource among all those agents who have claims on it. Of course, this is also the case for Galician milk problem. (O’Neill 1982) and (Aumann and Maschler 1985) introduced first bankruptcy problems. A complete review on this topic can be seen in (Moulin 2002) or (Thomson 2015). Furthermore, bankruptcy problems have been also considered from a game theoretic perspective in (Curiel, Maschler, and Tijs 1987). Remark that any multi-agent allocation problem under cooperation can be studied as a bankruptcy case. It is only necessary the existence of an estate to be allocated where each agent claims a portion of the total. Therefore, the definition of rules for distributing the available resources is not a minor question in bankruptcy situations. Several alternatives of allocation procedures in bankruptcy were characterized in (Thomson 2015). Three of the most common choices are the proportional rule, that assigns proportionally to the claims, the Talmud rule introduced by (Aumann and Maschler 1985), and the random arrival rule (O’Neill 1982) whose exact computation is a hard task. In fact, (Saavedra-Nieves A. and Saavedra-Nieves 2020) propose a method based on simple random sampling with replacement to approximate it.

Another interesting approach on bankruptcy problems was introduced in (Borm et al. 2005). The existence of a system of a priori unions on the set of agents involved incorporates additional information on the possibilities of their cooperation. Therefore, (Borm et al. 2005) describe a two-stage procedure that extends bankruptcy rules when there exist a priori unions structures. Notice that (Borm et al. 2005) prove that the extension of the random arrival rule coincides with the Owen value for the associated bankruptcy game with a priori unions (Owen 1975). The main goal of this work is to propose a general procedure also based on simple random sampling with replacement for estimating the extension of the random arrival rule to this setting. Remark that its computation is again specially difficult when the number of involved agents increases. This estimation method will be analysed in terms of the incurred error by providing a theoretical bound and studying the statistical properties of the estimator.

Bubble plots of the percentages of aggregated milk quotas in the period 2014-2015 by provinces (left) and counties (center and right). Bubble plots of the percentages of aggregated milk quotas in the period 2014-2015 by provinces (left) and counties (center and right). Bubble plots of the percentages of aggregated milk quotas in the period 2014-2015 by provinces (left) and counties (center and right).

As an autonomous community, Galicia is a territorial entity which, within the Spanish constitutional legal system, is endowed with autonomy, with its own institutions and representatives and certain legislative, executive and administrative powers. Moreover, it is also considered a historical nationality because of its collective, linguistic and cultural identity which is different from the rest of Spain. Its territory, characterized by a very remarkable rural dispersion, is organized in four provinces (A Coruña, Lugo, Ourense and Pontevedra) which are made up of a total of 315 councils (in 2015). Map of European Space Agency (European Space Agency website: https://www.esa.int/) in Figure 1 shows the big dispersion of Galician population representing with black points all nonempty areas. The Decree 65/1997 of the Galician Government (Galician Government website: https://www.xunta.gal/portada) grouped these 315 councils into 53 counties that are represented in Figure 5. The main objective of counties creation was to encourage different kinds of plans to undertake a structuring and revitalization of its territory overcoming the localisms that have always been the main obstacle to the articulation of Galicia and, therefore, to achieve a real economic development. In this way, the rural areas would be strengthened combating the existing big problem of depopulation in Galicia where most of population is elderly people. Although some economists raise the need to prioritize the use of land over property rights and to organize services using the existing division in counties as the main measures to revitalize the rural areas, most of legislative initiatives and the strategies of territorial management and cooperation implanted during the last twenty years had not the desired effect. As an application of the methodology proposed in this work, we will consider the territorial divisions of Galicia in provinces and also in counties as a priori unions to check if these administrative organizations play a significant role in the milk conflict in Galicia. Figure 4 shows the bubble plots of the percentages for aggregated milk quotas in the period 2014-2015 by provinces (left) and by counties that overcome 5% (center) and 3% (left) of the milk production, respectively. Tables 10 and 7 in Appendix A contains the exact values of these percentages. Concretely, Table 10 contains the aggregated milk quotas in the period 2014-2015 by provinces as well as the corresponding percentages. Therefore, from the three bankruptcy rules cited above, several systems of Galician milk quotas will be provided considering these a priori unions. Results will be compared to the obtained ones in (Saavedra-Nieves A. and Saavedra-Nieves 2020) where territorial divisions were not taken into account.

Geographical location of Galicia in the Northwest of the Iberian Peninsula. Administrative division in provinces of Spain (left) and in counties of Galicia (right).

This paper is organized as follows. Section 2 reviews the bankruptcy problem formally including the extension of classical bankruptcy rules when there exist a priori unions. In the specific case of the extension of the random arrival rule to this setting, the proposed sampling procedure for its estimation when the number of involved agents increases is described in Section 3. Additionally, its statistical properties are studied and several theoretical results on bounding the error are provided. Then, the performance of this proposal is also evaluated on two well-known real examples in literature where the allocation rule can be exactly determined. Section 4 contains the allocations of the extensions of the classical bankruptcy rules for each council in Galicia when the milk quota conflict is modeled as a bankruptcy problem. Section 5 presents the conclusions of this work. Finally, two appendices are included. Appendix A shows the milk quotas for \(190\) councils in Galicia in the period 2014-2015 and their distribution in provinces and counties. Finally, Appendix B contains the new milk quota systems given by the estimations of the extensions of the random arrival rule and the classical Talmud and proportional rules when provinces and counties respectively determine systems of a priori unions.

Some background in bankruptcy

A bankruptcy problem is a multi-agent situation in which agents claim a portion of a good larger than the one available. Formally, these situations were initially analysed in (O’Neill 1982). A bankruptcy problem with a set of claimants \(N=\{1,\dots,n\}\) is given by \((N,c,E)\), where:

  • \(E\in \mathbb{R}_{+}\) denotes the total amount to be divided, that is said to be the estate; and
  • \(c\in \mathbb{R}^n\) is the vector of claims, where \(c_i\) is the \(i\)’s claim, with \(i\in N\), and such that \(0\leq E\leq \underset{j\in N}{\sum}c_j\).

The set of bankruptcy problems with set of claimants \(N\) is denoted by \(B^N\). (O’Neill 1982) also analyse these problems from a game-theoretical perspective. A TU-game (González-Díaz, García-Jurado, and Fiestras-Janeiro 2010) is formally given by a pair \((N,v)\), where \(N\) denotes the finite set of agents and \(v : 2^N \longrightarrow \mathbb{R}\) is a map satisfying \(v(\emptyset) = 0\). Thus, a bankruptcy game is a TU-game \((N,v)\) associated with each \((N,c,E)\in B^N\) and given, for each \(S\subseteq N\), by \[\label{bank_game}v(S)=\max\bigg\{0,E-\sum_{i\notin S}c_i\bigg\}.\qquad(1)\] For each \(S\subseteq N\), \(v(S)\) is the portion of \(E\) that remains when agents in \(N\setminus S\) received their claims.

The definition of procedures for dividing the estate among the claimants is fundamental. A division rule \(f\) for a bankruptcy problem \((N,c,E)\in B^N\) is a function that assigns a vector \(f (N,c,E)\in \mathbb{R}^n\) such that \(\sum_{i\in N}f_i(N,c,E)=E\), and \(0\leq f_i(N,c,E)\leq c_i\), for each \(i\in N\). In this sense, several division rules have been introduced in bankruptcy literature.

Take \((N,c,E)\in B^N\) a bankruptcy problem. Among others, the Talmud rule \(T=(T_i)_{i\in N}\) assigns to each claimant \(i\in N\), \[T_i(N,c,E)= \left\{ \begin{array}{lcc}
\min\left\{\frac{c_i}{2},\lambda\right\}, & if & E\leq \underset{l\in N}{\sum}\frac{c_l}{2}, \\
c_i-\min\left\{\frac{c_i}{2},\lambda\right\}, & if & E\geq \underset{l\in N}{\sum}\frac{c_l}{2},
\end{array}
\right.\qquad(2)\]
being \(\lambda\) such that \(\underset{l\in N}{\sum}T_l(N,c,E)=E\). (Aumann and Maschler 1985) prove that the Talmud rule coincides with the nucleolus (Schmeidler 1969) of the corresponding bankruptcy game.

The proportional rule assigns to each \(i\in N\), the part of \(E\) corresponding to the weight given by its claim. Formally, it is given by \(P=(P_i)_{i\in N}\), where \[P_i(N,c,E)=\frac{c_i}{\underset{l\in N}{\sum}c_l}E, \mbox{ for each claimant }i\in N.\qquad(3)\]

Let \(\Pi(N)\) be the set of all permutations of \(N\). For each \(\pi\in \Pi(N)\), \(P^\pi_i\) is the set of predecessors of \(i\) under \(\pi\). The random arrival rule (O’Neill 1982) assigns to each agent \(i\) in \(N\), \[\label{def_ra_rule}RA_i(N,c,E)=\frac{1}{n!}\underset{\sigma\in \Pi(N)}{\sum} \min\bigg\{c_i,\max\big\{0,E-\underset{j\in P_i^\sigma}{\sum}c_j\big\}\bigg\}.\qquad(4)\]

This rule is obtained as the expected value of the marginal contributions for each \(i\in N\). Among others, (Saavedra-Nieves A. and Saavedra-Nieves 2020) focus on the computational problem in determining the random arrival rule for those bankruptcy situations with large set of players. To this aim, the sampling methodologies for estimating the Shapley value for a general TU-game ((Castro, Gómez, and Tejada 2009), (Fernández-García and Puerto-Albandoz 2006)) since that the allocation given by the random arrival rule coincides with the Shapley value of the associated bankruptcy game. The Shapley value ((Shapley 1953)) of a TU-game \((N,v)\) is given by \[\Phi_i(N,v)=\sum_{S\subseteq N\setminus \{i\}}{\frac {|S|!\;(|N|-|S|-1)!}{|N|!}}(v(S\cup \{i\})-v(S)),\mbox{ for all }i\in N.\qquad(5)\]

The existence of a system of a priori unions on the set of agents involved incorporate additional information about the possibilities of cooperation. Thus, bankruptcy problems can be also extended in this direction. A bankruptcy problem with a priori unions will be denoted by \((N, E, c,P)\), being \((N, c,E)\) a bankruptcy problem and \(P = \{P_1,\dots,P_m\}\) is a partition of the set of players, being \(M=\{1,\dots,m\}\). The class of all bankruptcy problems with a priori unions will be denoted by \(BU^N\). Thus, if \((N, c,E,P)\in BU^N\) is a bankruptcy problem with unions, we can define the corresponding bankruptcy problem among the unions \((M, c^P,E)\), the so-called quotient problem, where \(c^P \in \mathbb{R}^m\) denotes the vector of total claims of the unions, so \(c^P_k=\sum_{i\in P_k}c_i\), for each \(k\in \{1,\dots,m\}\).

These problems can be also described by using cooperative game theory or, more precisely, TU-games with a priori unions. Recall that they are given by a triple \((N, v,P)\), where \((N, v)\) denotes TU-game and \(P\) a partition of the set of players. For \((N, v,P)\), we define the associated TU-game for the unions, the quotient game, whose characteristic function \(v^U\) is given by \(v^U(L) = v(\cup_{k\in L}P_k)\), for all \(L\subseteq M\).

Analogously, the definition of bankruptcy rules under the existence of a structure of a priori unions has received attention in literature (see, for instance, (Borm et al. 2005)). Formally, a division rule \(f^U\) for a bankruptcy problem with a priori unions \((N,c,E,P)\in BU^N\) denotes a function that assigns the vector \(f^U(N,c,E,P)\in \mathbb{R}^n\) such that \(\sum_{i\in N}f^U_i(N,c,E,P)=E\), and \(0\leq f^U_i(N,c,E,P)\leq c_i\), for each \(i\in N\). In this sense, several division rules have been introduced in bankruptcy literature.

For dividing the estate, (Borm et al. 2005) initially describe a two-stage procedure that extends bankruptcy rules to rules for bankruptcy situations with a priori unions. The idea that bases that procedure refers to firstly divide the estate among the unions and secondly, the allocation of each union is divided among the claimants belonging to the union. Formally, take \(f:B^N\longrightarrow\mathbb{R}^N\) a bankruptcy rule and let \((N,c,E,P)\in BU^N\) be a bankruptcy problem with a priori unions. The steps of the procedure in (Borm et al. 2005) to obtain \(\overline{f}:BU^N\longrightarrow\mathbb{R}^N\) as an extension of \(f\) to those situations with a priori unions are the following ones:

  • First, define \(E_k^f=f_k(M,c^P,E)\), for all \(k\in M\) and, secondly,
  • Do \(\overline{f}_i(N,c,E,P)=f_i(P_k,(c_j)_{j\in P_k},E_k^f)\) for each \(i\in P_k\) and for all \(k\in M\).

Secondly, (Borm et al. 2005) also use another two-step procedure for extending bankruptcy rules to those bankruptcy situations with a priori unions, based on the random arrival rule. Take \(f\) a bankruptcy rule and \((N,c,E,P)\in BU^N\). Then, the \(f\)-random arrival rule for \((N,c,E,P)\) is given by \[RA_i^f(N,c,E,P)=\frac{1}{m!}\sum_{\sigma\in \Pi(M)}f_i(P_k,(c_j)_{j\in P_k},E_{\sigma}),\qquad(6)\] for all \(i\in P_k\), where \(E_{\sigma} = \max\{0,E-\sum_{l\in M,\sigma^{-1}(l)<\sigma^{-1}(k)}c_l^P\}\). Even more, (Borm et al. 2005) prove that \(RA^{RA}(N,c,E,P)=O(N,v,P)\), that is, it is the Owen value of the bankruptcy game. Notice that the Owen value ((Owen 1977)) that extends the Shapley value for TU-games with a priori unions, is defined by\[\label{theOV}
O_i(N,v,P)=\sum_ {R\subseteq P\setminus P_{(i)}}\sum_{S\subseteq P_{(i)}\setminus \{i\}}\frac{s!(p_i-s-1)!r!(m-r-1)!}{p_i!m!}\big(v(\underset{P_l \in R}{\cup}P_l\cup S\cup\{i\})-v(\underset{P_l \in R}{\cup}P_l\cup S)\big),\qquad(7)\]
for every \(i\in N\) and every \((N,v,P)\in U^N\), being \(P_{(i)}\) that element of partition \(P\) to which player \(i\) belongs.

The Owen value can be alternatively formulated in terms of permutations. A permutation \({\sigma}\in \Pi(N)\) is said to be compatible with a coalition structure \(P\) if it holds that \(P_{(i)}=P_{(j)}\mbox{ and } {\sigma}(i) < {\sigma}(k) < {\sigma}(j) \mbox{ implies that } P_{(k)}=P_{(i)}=P_{(j)}\). Therefore, the Owen value of a bankruptcy game with a priori unions \((N,v,P)\) can be rewritten, for every \(i\in N\), as \[\label{the_owen_value}
O_{i}(N,v,P)=\frac{1}{|\Pi_P(N)|}\sum _{\sigma \in \Pi_P(N)}\min\bigg\{c_i,\max\big\{0,E-\underset{j\in P_i^\sigma}{\sum}c_j\big\}\bigg\},\qquad(8)\]
where \(\Pi_P(N)\) denotes the set of permutations of \(N\) compatible with \(P\).

Estimating the RA-random arrival rule

The computation of the \(RA\)-random arrival rule for bankruptcy situations with a priori unions becomes a difficult task when the number of involved agents increases since the number of compatible permutations to be evaluated exponentially increases. In this section, we propose a general procedure for estimating this rule based on simple random sampling with replacement. It is an application of the proposal in (A. Saavedra-Nieves, García-Jurado, and Fiestras-Janeiro 2018) for approximating the Owen value for general TU-games to bankruptcy problems with a priori unions. This methodology avoids the usage of the corresponding bankruptcy game.

Although the aim of this section is focused on the estimation of the \(RA-\)random arrival rule, it is important to mention that problems of its exact computation can arise in general for the \(f-\)random arrival rule family, being \(f\) any of the classic bankruptcy rules. In the case of applying the Talmud rule or the proportional rule in one of the steps, difficulties would arise only in the step of using the random arrival rule. In order to address these difficulties, the sampling proposal for estimating the random arrival rule in (Saavedra-Nieves A. and Saavedra-Nieves 2020) can be used.

The sampling algorithm

Below, we formally describe the procedure for approximating the \(RA\)-random arrival rule for bankruptcy situations with a priori unions based on sampling techniques.

Let \((N,c,E,P)\in BU^N\) be a bankruptcy problem with a priori unions. The steps of the sampling proposal are described below.

  1. The population of the sampling procedure is the set of those permutations of \(N\) compatible with \(P\), i.e. \(\Pi_P(N)\).
  2. The vector of parameters to be estimated is \(RA^P = (RA_i^P)_{i\in N}\), where \(RA^{P}_i\) denotes
    \(RA^{RA}_i(N,c,E,P)\) for all \(i\in N\).
  3. The characteristic to be studied in each sampling unit \(\sigma \in \Pi_P(N)\) is the vector \((x(\sigma)_i)_{i\in N}\), where \[\label{mc:bankruptcy}x(\sigma)_i= \min\bigg\{c_i,\max\big\{0,E-\underset{j\in P_i^\sigma}{\sum}c_j\big\}\bigg\},\mbox{ for all }i\in N.\qquad(9)\]
  4. The sampling procedure takes each permutation \(\sigma \in \Pi_P(N)\) with the same probability. By construction, we obtain a sample with replacement \(\mathcal{S}=\{\sigma_1,\dots,\sigma_{\ell}\}\) of \(\ell\) orders of \(N\) compatible with \(P\).
  5. The estimation of the \(i^{th}\)-component of \(RA^{P}\), \(RA^{P}_i\), is the mean of the marginal contributions vectors over the sample of permutations \(\mathcal{S}\). Formally, we obtain a vector \(\overline{RA}^P=(\overline{RA}^P_i)_{i\in N}\) where, for each \(i\in N\), \(\overline{RA}^P_i=\frac{1}{\ell}\sum_{\sigma\in \mathcal{S}}x(\sigma)_i\) approximates \(RA_i\) being \(\ell\) the sampling size.

Algorithm 6 presents the pseudo code of this sampling procedure.

Algorithm 1. Pseudo code

By construction, the problem of estimating the \(RA\)-random arrival rule for \(i\in N\) corresponds to the approximation of the expected value of the marginal contributions \(x(\sigma)_i\). Thus, we are dealing with a very common task in Statistics for which sampling, and more specifically, simple random sampling becomes a useful. Below, we do a statistical analysis of the properties that our sampling procedure satisfies. Given an agent \(i\in N\), the estimator \(\overline{RA}^P_i\) is unbiased: \[\mathbb{E}(\overline{RA}^P_i) =\mathbb{E}\bigg(\frac{1}{\ell}\sum_{\sigma \in \mathcal{S}}x(\sigma)_i\bigg)=\mathbb{E}(x(\sigma)_i)=RA^{P}_i.\qquad(10)\] Besides, \[\mbox{Var}(\overline{RA}^P_i) = \mbox{Var}\bigg(\frac{1}{\ell}\sum_{\sigma \in \mathcal{S}} x(\sigma)_i\bigg)=\frac{\theta^2}{\ell}\qquad(11)\] where \(\theta^2\) denotes the variance of \(x(\sigma)_i\) with respect to \(RA^{P}_i\). Hence, taking into account that \[MSE(\overline{RA}^P_i)=\mathbb{E}(\overline{RA}^P_i-RA^P_i)^2=(\mathbb{E}(\overline{RA}^P_i)-RA^P_i)^2 +\mbox{Var}(\overline{RA}^P_i),\qquad(12)\] and the unbiased character of \(\overline{RA}^P_i\), \(MSE(\overline{RA}^P_i)=\mbox{Var}(\overline{RA}^P_i)\), that goes to zero when \(\ell\) increases.

Analysis of the error

A fundamental issue in a problem as the one dealt with focuses on bounding the absolute error in the estimation. Since this error is often not possible to be measured, a probabilistic bound on its value is theoretically provided instead. This means that the error is guaranteed to be not within a bound \(\varepsilon\) with a certain probability \(\alpha\) as maximum. Formally, this is equivalent to \[\mathbb{P}(|\overline{RA}^P_i-{RA}^{P}_i|\geq \varepsilon)\leq\alpha.\qquad(13)\] It is easy to check that the estimated value usually is a good approximation of the random arrival rule for bankruptcy for sufficiently large sampling sizes. In what follows, we state a collection of statistical results that can be useful for determining the required sample size.

As in (Saavedra-Nieves A. and Saavedra-Nieves 2020), Tchebyshev’s inequality helps with bounding the incurred estimation error in the approximation of the \(RA\)-random arrival rule, by using the variance of the marginal contributions. In most cases, this amount is not explicitly determined and, for this reason, Popoviciu’s inequality on variances ((Popoviciu 1935)) solves this drawback. In this case, the range of the marginal contributions in bankruptcy is mandatory for analysing the error. Its value for a fixed \(i\in N\), denoted by \(w_i\), is given by \[w_i=\underset{\sigma,\sigma’\in \Pi_P(N)}{\max}\big\{x(\sigma)_i-x(\sigma’)_i\big\}.\qquad(14)\] Notice that \(0\leq x(\sigma)_i\leq c_i\) for a fixed agent \(i\) since that, by Expression ([mc:bankruptcy]), \[x(\sigma)_i= \left\{ \begin{array}{lcl}
c_i & if & E \geq \sum_{j\in P_i^{\sigma}}c_j+c_i; \\
E – \sum_{j\in P_i^{\sigma}}c_j & if & 0\leq E – \sum_{j\in P_i^{\sigma}}c_j\leq c_i; \\
0 & if & E \leq \sum_{j\in P_i^{\sigma}}c_j.
\end{array}
\right.\qquad(15)\]
Thus, it is bearable that \(w_i=c_i\). Consequently, we write two usual results to bound the incurred error in the estimation of the random arrival rule directly in terms of the value of \(c_i\). They can be considered as specific theoretical results for bankruptcy. By combining this inequality with the bound given by Hoeffding’s inequality ((Hoeffding 1963)) the following lemma can be extracted. For more statistical details, see (A. Saavedra-Nieves, García-Jurado, and Fiestras-Janeiro 2018). It establishes a very general bound of the absolute error in terms of the claims of agents for bankruptcy problems with a priori unions.

[saavedra_cor2] ((Saavedra-Nieves A. and Saavedra-Nieves 2020)) Let \((N,c,E,P)\in BU^N\) be a bankruptcy problem with a priori unions and take \(\varepsilon>0\) and \(\alpha\in (0,1)\). Then, \[\ell\geq \min\bigg\{\frac{1}{4\alpha\varepsilon^2},\frac{\ln(2/\alpha)}{2\varepsilon^2}\bigg\}c_i^2\mbox{ implies that } \mathbb{P}(|\overline{RA}^P_i-RA^P_i|\geq \varepsilon)\leq \alpha.\qquad(16)\]

Below, we remind some helpful ideas in the estimation of the \(RA\)-random arrival rule for bankruptcy problems with a priori unions. For the usual values of \(\alpha\) (\(\alpha=0.1\), \(\alpha=0.05\) or \(\alpha=0.01\)), (Maleki 2015) proves that Hoeffding’s inequality requires a smaller sampling size than Chebyshev’s inequality. In our setting, \[\min\bigg\{\frac{1}{4\alpha\varepsilon^2},\frac{\ln(2/\alpha)}{2\varepsilon^2}\bigg\}c_i^2=\frac{\ln(2/\alpha)}{2\varepsilon^2}c_i^2.\qquad(17)\]

Algorithm performance on two numerical examples

In this section, we analyse how our sampling proposal performs in two examples extracted from the literature for which the exact \(RA\)-random arrival rule is obtained in a reasonable time. Following (Borm et al. 2005), it coincides with the Owen value of the corresponding bankruptcy game in ([theOV]). We consider the examples used in (Saavedra-Nieves A. and Saavedra-Nieves 2020), again because of the absence of other examples in the literature in which this rule is calculated for large sets of players. The main purpose of our methodology is to address these types of seemingly difficult problems from a computational point of view.

The results included in next sections have been performed computing our sampling proposal into the statistical software R, (R Core Team 2023), on a personal computer with Intel(R) Core(TM) i5-7400 and 8 GB of memory and with a single 3.00GHz CPU processor.

The Pacific Gas and Electric Company

This example of bankruptcy is extracted from (Borm et al. 2005). It describes the situation that arises when the American company Pacific Gas and Electric Company declares bankruptcy. The creditors can be organized according to the nature of their claims: bank bonds, power purchases and gas purchases. So, the system of a priori unions is given by \(P=\{P_1,P_2,P_3\}\), where

  • \(P_1 = \{1, 3, 5, 6\}\),
  • \(P_2 =\{2, 4, 7, 8, 9, 10, 11, 12, 13, 18, 19, 20\}\), and
  • \(P_3 = \{14, 15, 16, 17\}\).

First, Table 1 depicts the nature of claims, the claims and the \(RA\)-random arrival rule as the Owen value of the bankruptcy game in ([bank_game]).

Nature of claims, claims and the \(RA\)-random arrival rule for the bankruptcy problem with a priori unions \((N,c,E,P)\).
\(i\) Nature of claims \(c_i\) \(RA^{RA}_i\) \(i\) Nature of claims \(c_i\) \(RA^{RA}_i\)
1 Bank bonds 2207.2500 161.4321 11 Power purchases 40.1472 6.6912
2 Power purchases 1966.0000 224.5992 12 Power purchases 40.1221 6.6870
3 Bank bonds 1302.1000 161.4321 13 Power purchases 32.8679 5.4780
4 Power purchases 1228.8000 224.5992 14 Gas purchases 29.5235 9.8412
5 Bank bonds 938.4610 147.0812 15 Gas purchases 28.2106 9.4035
6 Bank bonds 310.0000 42.3377 16 Gas purchases 24.7183 8.2395
7 Power purchases 57.9284 9.6547 17 Gas purchases 23.8495 7.9498
8 Power purchases 49.4526 8.2421 18 Power purchases 22.5765 3.7628
9 Power purchases 48.4006 8.0668 19 Power purchases 21.5061 3.5844
10 Power purchases 45.7064 7.6177 20 Power purchases 19.8002 3.3000

Table 1 displays the claims (in millions of dollars) for the set of the different agents \(N=\{1,\dots,20\}\) that are involved. The estate to be allocated among the creditors is equal to \(E=1060\) millions of dollars. Table 1 also displays the vector \(RA^{RA}=(RA^{RA}_1,\dots,RA^{RA}_{20})\) provided by the \(RA\)-random arrival rule for this bankruptcy situation with a priori unions (of dimension \(20\)).

Sampling sizes for estimating the \(RA\)-random arrival rule with \(w_i=c_i\) for all \(i\in N\).
\(i\) 1 2 3 4 5
\(\alpha=0.1\) 2919013106 2315794515 1015831491 904680854 527673705
\(\alpha=0.05\) 3594409142 2851618912 1250872766 1114004294 649765903
\(\alpha=0.01\) 5162630175 4095764632 1796621706 1600038269 933255210
\(i\) 6 7 8 9 10
\(\alpha=0.1\) 57577975 2010555 1465250 1403570 1251661
\(\alpha=0.05\) 70900264 2475753 1804276 1728326 1541268
\(\alpha=0.01\) 101833660 3555911 2591472 2482384 2213715
\(i\) 11 12 13 14 15
\(\alpha=0.1\) 965706 964495 647257 522240 476822
\(\alpha=0.05\) 1189149 1187658 797018 643075 587149
\(\alpha=0.01\) 1707967 1705826 1144752 923644 843318
\(i\) 16 17 18 19 20
\(\alpha=0.1\) 366077 340793 305385 277113 234896
\(\alpha=0.05\) 450779 419645 376044 341231 289245
\(\alpha=0.01\) 647451 602733 540110 490107 415441

Below, the \(RA\)-random arrival rule is estimated by using our sampling proposal. We take \(\varepsilon=0.1,0.05\mbox{ or }0.01\), or equivalently, \(100\) thousands, \(50\) thousands or \(10\) thousands of dollars. They are values that can be naturally assumed. In this sense, we show in Table 2 the minimum sampling sizes required to ensure that absolute errors smaller than or equal to \(\varepsilon=0.05\) with probability at least \(1-\alpha\).

First, we approximate the \(RA\)-random arrival rule with several sampling sizes and then, we do a comparison with the exact allocation. This analysis is done in terms of the incurred absolute error and the estimated variance. Both measures are reduced when \(\ell\) increases.

Estimation of the \(RA\)-random arrival rule for \((N,c,E,P)\) for several values of \(\ell\).
\(i\) \(\ell=10^3\) \(\ell=10^5\) \(\ell=10^7\)
Abs. error Err. th., \(\alpha=0.01\) Estimated variance Abs. error Err. th., \(\alpha=0.01\) Estimated variance Abs. error Err. th., \(\alpha=0.01\) Estimated variance
1 12.9658 113.6071 135.1849 0.0208 11.3607 1.2743 0.1322 1.1361 \(1.2719\cdot 10^{-2}\)
2 1.5985 101.1900 152.9544 2.5888 10.1190 1.5315 0.0838 1.0119 \(1.5457\cdot 10^{-2}\)
3 7.2830 67.0191 132.3190 0.0247 6.7019 1.2724 0.1248 0.6702 \(1.2719\cdot 10^{-2}\)
4 16.0863 63.2463 145.4868 0.7074 6.3246 1.5493 0.2322 0.6325 \(1.5473\cdot 10^{-2}\)
5 7.0849 48.3026 104.6027 1.6193 4.8303 1.1077 0.1043 0.4830 \(1.0990\cdot 10^{-2}\)
6 3.5450 15.9557 11.3958 0.2678 1.5956 0.1068 0.0091 0.1596 \(1.0630\cdot 10^{-3}\)
7 0.1931 2.9816 0.4735 0.0311 0.2982 0.0046 0.0057 0.0298 \(4.6629\cdot 10^{-5}\)
8 0.5769 2.5453 0.3203 0.0226 0.2545 0.0034 0.0024 0.0255 \(3.3974\cdot 10^{-5}\)
9 0.4517 2.4912 0.3397 0.0148 0.2491 0.0032 0.0074 0.0249 \(3.2560\cdot 10^{-5}\)
10 0.1066 2.3525 0.2934 0.0812 0.2353 0.0029 0.0064 0.0235 \(2.8996\cdot 10^{-5}\)
11 0.0268 2.0664 0.2231 0.0043 0.2066 0.0022 0.0067 0.0207 \(2.2404\cdot 10^{-5}\)
12 0.1471 2.0651 0.2196 0.0007 0.2065 0.0022 0.0024 0.0207 \(2.2365\cdot 10^{-5}\)
13 0.3177 1.6917 0.1430 0.0090 0.1692 0.0015 0.0036 0.0169 \(1.5012\cdot 10^{-5}\)
14 0.4330 1.5196 0.1978 0.0253 0.1520 0.0019 0.0028 0.0152 \(1.9367\cdot 10^{-5}\)
15 0.4138 1.4520 0.1806 0.0242 0.1452 0.0018 0.0027 0.0145 \(1.7683\cdot 10^{-5}\)
16 0.3625 1.2723 0.1386 0.0212 0.1272 0.0014 0.0024 0.0127 \(1.3576\cdot 10^{-5}\)
17 0.3498 1.2275 0.1291 0.0204 0.1228 0.0013 0.0023 0.0123 \(1.2638\cdot 10^{-5}\)
18 0.1731 1.1620 0.0682 0.0468 0.1162 0.0007 0.0020 0.0116 \(7.0821\cdot 10^{-6}\)
19 0.1577 1.1069 0.0665 0.0009 0.1107 0.0006 0.0002 0.0111 \(6.4241\cdot 10^{-6}\)
20 0.2508 1.0191 0.0511 0.0050 0.1019 0.0005 0.0003 0.0102 \(5.4447\cdot 10^{-6}\)

Those columns of Table 3 containing the absolute errors show that our sampling proposal correctly estimates the \(RA\)-random arrival rule in this example. These amounts are always smaller than the ones provided by Corollary [saavedra_cor2] for this particular estimation. To check this conjecture in general, we do a small simulation study by using \(\ell=10^4\). Table 4 reflects the minimum, maximum and mean observed absolute errors in \(1000\) estimations as well as the theoretical errors for \(\alpha=0.01\). We conclude that the absolute errors are smaller than the theoretical ones.

Summary of the absolute errors in the \(1000\) simulations.
\(i\) 1 2 3 4 5
Theoretical, \(\alpha=0.01\) 35.9257 31.9991 21.1933 20.0002 15.2746
Maximum 9.7670 11.1829 10.1735 11.8164 8.1748
Average 2.7228 2.9959 2.8935 3.1117 2.5920
Minimum 0.0663 0.0605 0.0198 0.0166 0.0413
\(i\) 6 7 8 9 10
Theoretical, \(\alpha=0.01\) 5.0456 0.9429 0.8049 0.7878 0.7439
Maximum 2.8388 0.5812 0.4714 0.6357 0.4632
Average 0.9316 0.1734 0.1568 0.1567 0.1447
Minimum 0.0037 0.0019 0.0033 0.0032 0.0076
\(i\) 11 12 13 14 15
Theoretical, \(\alpha=0.01\) 0.6534 0.6530 0.5350 0.4805 0.4592
Maximum 0.4644 0.3477 0.3440 0.2933 0.2802
Average 0.1319 0.1173 0.1071 0.1138 0.1088
Minimum 0.0054 0.0027 0.0011 0.0010 0.0009
\(i\) 16 17 18 19 20
Theoretical, \(\alpha=0.01\) 0.4023 0.3882 0.3675 0.3500 0.3223
Maximum 0.2455 0.2369 0.2092 0.2437 0.2244
Average 0.0953 0.0919 0.0638 0.0691 0.0645
Minimum 0.0008 0.0008 0.0008 0.0007 0.0013

A conflictive situation in university management

Along this section, the bankruptcy example in (Pulido, Sánchez-Soriano, and Llorca 2002) is used to illustrate the usage of the sampling proposal. This situation, from a bankruptcy approach, is proposed for allocating resources in a Spanish university through the distribution of the available money among the entities to finance the purchase of equipment. Table 5 describes the elements that characterize the problem: the system of unions \(P\) to which each player belongs, the claims for the set of the agents \(N=\{1,\dots,27\}\) and the corresponding allocation given by the \(RA\)-random arrival rule. Notice that although this example is considered without assuming the existence of a system of a priori unions, we take \(P=\{P_1,P_2,P_3,P_4,P_5,P_6\}\), such that

  • \(P_1 = \{1, 2,3,4\}\),
  • \(P_2 =\{5,6,7\}\),
  • \(P_3 = \{8,9,10,11,12\}\),
  • \(P_4=\{13,14,15\}\),
  • \(P_5=\{16,17,18,19,20,21,22\}\), and
  • \(P_6=\{23,24,25,26,27\}\).
Unions, claims and the \(RA\)-random arrival rule for the bankruptcy problem with a priori unions \((N,c,E,P)\).
\(i\) Union \(c_i\) \(RA^{RA}_i\) \(i\) Union \(c_i\) \(RA^{RA}_i\) \(i\) Union \(c_i\) \(RA^{RA}_i\)
1 1 15720.66 3930.1650 10 3 126857.13 24329.537 19 5 248008.45 31707.54
2 1 25532.20 6383.0500 11 3 248338.50 48604.527 20 5 169534.83 21920.58
3 1 32960.44 8240.1100 12 3 227091.64 44263.446 21 5 240404.84 30784.55
4 1 13664.61 3416.1525 13 4 63069.72 15767.430 22 5 250845.44 32051.92
5 2 8173.76 2043.4400 14 4 15915.98 3978.995 23 6 70752.96 16249.86
6 2 3904.17 976.0425 15 4 10059.72 2514.930 24 6 140679.05 32955.27
7 2 14869.04 3717.2600 16 5 530070.44 61413.004 25 6 227684.44 53920.80
8 3 289753.13 57070.6592 17 5 121229.15 15630.714 26 6 234125.14 55710.57
9 3 250962.13 49147.4723 18 5 233163.45 29907.336 27 6 264726.58 64579.14

Again, we firstly evaluate the performance of our sampling proposal in the \(RA\)-random arrival rule estimation. As in the previous example, the task of determining the adequate sampling size is open and a bound of the absolute error is required to face this problem. Thus, we assume as bearable \(\varepsilon=10\) euros. Table 6 provides the required sampling sizes that ensure an absolute error smaller or equal than 10 with probability at least \(1-\alpha\). Notice that these values coincide with those ones used in the random arrival rule estimation in (Saavedra-Nieves A. and Saavedra-Nieves 2020).

Sampling sizes for estimating the \(RA\)-random arrival rule with \(w_i=c_i\) for all \(i\in N\).
\(i\) 1 2 3 4 5 6 7 8 9
\(\alpha=0.1\) 3701814 9764489 16272677 2796840 1000730 228313 3311608 1257561621 943385911
\(\alpha=0.05\) 4558333 12023778 20037820 3443967 1232277 281140 4077842 1548533981 1161664858
\(\alpha=0.01\) 6547109 17269687 28780212 4946551 1769913 403800 5856982 2224150880 1668492876
\(i\) 10 11 12 13 14 15 16 17 18
\(\alpha=0.1\) 241047575 923764163 772458749 59581964 3794371 1515811 4208624456 220133999 814317838
\(\alpha=0.05\) 296820732 1137503064 951188873 73367932 4672306 1866536 5182408462 271068211 1002733244
\(\alpha=0.01\) 426321993 1633789424 1366187372 105377959 6710807 2680895 7443464905 389333787 1440220269
\(i\) 19 20 21 22 23 24 25 26 27
\(\alpha=0.1\) 921310369 430517563 865684052 942508822 74982900 296436623 776496865 821049050 1049707018
\(\alpha=0.05\) 1134481516 530129947 1065984481 1160584829 92332309 365025599 956161322 1011021912 1292586352
\(\alpha=0.01\) 1629449590 761422741 1531067674 1666941636 132616390 524284269 1373329272 1452125238 1856534702

Table 7 shows the comparative study of estimating the \(RA\)-random arrival rule with sampling sizes equal to \(\ell=10^3\), \(\ell=10^5\) and \(\ell=10^7\). We obtain the absolute error and the estimated variances. Both measures reduce when sampling size enlarges.

Estimation of the \(RA\)-random arrival rule for \((N,c,E,P)\) for several values of \(\ell\).
\(i\) \(\ell=10^3\) \(\ell=10^5\) \(\ell=10^7\)
Abs. error Err. th., \(\alpha=0.01\) Estimated variance Abs. error Err. th., \(\alpha=0.01\) Estimated variance Abs. error Err. th., \(\alpha=0.01\) Estimated variance
1 125.7650 809.1420 45334.220 30.8120 80.9142 460.9545 2.3460 8.0914 4.6357
2 204.2580 1314.1418 119580.700 50.0430 131.4142 1215.8860 3.8090 13.1414 12.2279
3 263.6840 1696.4731 199283.100 64.6020 169.6473 2026.2940 4.9180 16.9647 20.3779
4 109.3165 703.3172 34251.460 26.7825 70.3317 348.2659 2.0385 7.0332 3.5024
5 98.0850 420.7033 12116.460 1.9620 42.0703 125.1892 0.1980 4.2070 1.2528
6 46.8500 200.9475 2764.327 0.9370 20.0948 28.5615 0.0945 2.0095 0.2858
7 178.4280 765.3092 40095.700 3.5690 76.5309 414.2752 0.3600 7.6531 4.1457
8 2389.0008 14913.5874 12219697.000 142.2692 1491.3587 119778.8000 51.6008 149.1359 1198.2610
9 41.3277 12917.0154 9181235.000 481.0923 1291.7015 90231.8900 26.4477 129.1702 909.3835
10 601.4630 6529.3337 2499025.000 195.9270 652.9334 24345.2700 3.7930 65.2933 244.9093
11 3954.4333 12781.9772 9374676.000 236.1267 1278.1977 88777.9600 75.8433 127.8198 891.6024
12 882.3836 11688.4018 7586319.000 613.1464 1168.8402 73889.4900 19.8764 116.8840 747.5239
13 441.4900 3246.1971 731718.400 6.9400 324.6197 7456.1670 5.6100 32.4620 74.5658
14 111.4120 819.1951 46598.180 1.7510 81.9195 474.8327 1.4170 8.1920 4.7486
15 70.4180 517.7736 18615.470 1.1070 51.7774 189.6905 0.8950 5.1777 1.8970
16 7793.6461 27282.7141 25836109.000 937.2361 2728.2714 235204.1000 29.0139 272.8271 2317.5760
17 27.5657 6239.6617 1613480.000 18.1543 623.9662 16016.9000 3.2543 62.3966 160.2384
18 4407.6956 12000.9178 4981154.000 349.8544 1200.0918 57667.6800 33.7644 120.0092 571.7484
19 3508.1921 12764.9896 5804428.000 166.3121 1276.4990 63854.2000 20.0379 127.6499 641.8360
20 2743.8708 8725.9540 2782531.000 73.6392 872.5954 31100.1700 20.5992 87.2595 310.6117
21 2543.1383 12373.6319 5517885.000 11.6317 1237.3632 60537.6300 8.8717 123.7363 605.0563
22 1249.4167 12911.0094 6371426.000 271.0833 1291.1009 65942.4400 5.2133 129.1101 655.3291
23 270.7066 3641.6533 866177.300 132.7734 364.1653 8816.2240 15.1366 36.4165 87.5347
24 526.4682 7240.7477 3420345.000 14.4982 724.0748 34494.1300 37.9682 72.4075 344.9935
25 1666.5565 11718.9132 8941583.000 73.9065 1171.8913 87685.0700 23.7835 117.1891 876.5092
26 356.3484 12050.4159 9361653.000 170.7716 1205.0416 92290.5300 55.8316 120.5042 924.1232
27 813.5110 13625.4714 11504327.000 376.6790 1362.5471 117932.0000 67.1510 136.2547 1174.0490

The results on Table 7 justifie the usage of this methodology for estimating the \(RA\)-random arrival rule because of its correct performance also in this example. However, the theoretical values of the error provided by Corollary [saavedra_cor2] are again larger than the observed values. We conclude with a small simulation to check it. Table 8 displays the minimum, maximum and averaged absolute errors for \(1000\) estimations of the random arrival rule by using \(\ell=10^4\) in this example.

Summary of the absolute errors in the \(1000\) simulations.
\(i\) 1 2 3 4 5 6 7 8 9
Theoretical, \(\alpha=0.1\) 255.8732 415.5681 536.4719 222.4084 133.0380 63.5452 242.0120 4716.0904 4084.7189
Maximum 132.0535 214.4705 276.8677 114.7827 93.1809 44.5075 169.5071 2719.3987 3152.5928
Average 50.1646 81.4733 105.1768 43.6038 27.4720 13.1219 49.9748 885.1569 737.8555
Minimum 3.1441 5.1064 6.5921 2.7329 0.8174 0.3904 1.4869 8.9433 0.4221
\(i\) 10 11 12 13 14 15 16 17 18
Theoretical, \(\alpha=0.1\) 2064.7566 4042.0161 3696.1972 1026.538 259.0523 163.7344 8627.5517 1973.1543 3795.0234
Maximum 1529.7863 2117.6095 2602.0905 1034.343 261.0221 164.9794 3881.3046 1010.1539 1935.7362
Average 421.6090 707.1321 682.5632 207.184 52.2840 33.0462 1183.1003 308.9907 591.7395
Minimum 2.7277 9.6001 9.3514 0.000 0.0000 0.0000 19.7829 12.1751 13.4823
\(i\) 19 20 21 22 23 24 25 26 27
Theoretical, \(\alpha=0.1\) 4036.6441 2759.3890 3912.8860 4082.8197 1151.5919 2289.7255 3705.8457 3810.6761 4308.7524
Maximum 1680.3395 1308.7188 2253.2597 1796.4386 1002.4567 1706.3678 2966.9821 2649.1133 3167.3045
Average 614.0042 425.7196 583.4490 527.3767 270.0250 482.3436 744.9507 724.6656 860.9238
Minimum 8.8083 7.5728 9.0623 4.6156 2.6795 8.5164 9.7456 2.9140 25.9181

An application: new milk quotas for Galicia based on its territorial organization

The sampling procedure described along this work will be applied on the real bankruptcy situation which arises from the end of the milk quotas regime imposed by the European Union (EU) to regulate the milk market. Notice that the analysis of this class of situations can be modeled as a bankruptcy problem when the maximum of tons of milk in 2014-2015 imposed for Galicia reduces by \(\rho\%\) of the total, with \(\rho\in (0,100]\). Figure 9 in Appendix A shows represents graphically the milk quota of each council in this period taken as reference. From Table 8 in Appendix A, the set of involved agents is given by the 190 councils of Galicia indicated there, that is, \(N=\{1,\dots,190\}\). Thus, the elements of the bankruptcy problem are formally defined as follows. The resources to be allocated among the different councils (the estate) corresponds to the \((100 -\rho)\%\) of the aggregate milk quota for the region in 2015 that is, of \(2229811.281\) tons of milk. We take as claims of the councils the maximum bound of milk (in tons) given by the individual quotas in the period 2014-2015. These amounts describe the maximum milk production capacities of each municipality. The random arrival rule for bankruptcy problems considering the provinces and also the counties as a structure of a priori unions will provide a new milk quota for each council under the fairness criteria that bases the Owen value for TU-games. The main difficulty for its obtaining is that the large set of players that are involved, implicitly increases the computational complexity for the exact computation. For this reason, we approximate the \(RA-\)random arrival rule of each council in Galicia by using simple random sampling with replacement described in Section 3.1 with \(\ell=10^7\). In this illustration, we focus on the case when \(\rho= 40\) for simplicity but, of course, similar discussions could be considered for other values of \(\rho\). As consequence, the portion of the regional milk quota for 2015 we manage as estate is \(60\%\) of the total. Table 10 in Appendix B contains the estimations of the \(RA-\)random arrival rule when \(\rho= 40\), \(\rho= 10\) and \(\rho= 5\). Estimations when counties are selected as systems of a priori unions are shown in Table 11 also in Appendix B. Therefore, they contain a total of six new system of quotas for the \(190\) councils in Galicia when the four provinces or counties are considered as a priori unions.

Results obtained for \(\rho=40\) were compared to the obtained ones in (Saavedra-Nieves A. and Saavedra-Nieves 2020) where a priori unions were not be taken into account in order to estimate the allocation rule. The consideration of the provinces as a priori unions has different effects on councils depending on the province that they belong. Specifically, all councils in A Coruña reduce their milk quotas between a 5% and a 7% and all councils in Lugo increase their production between a 2% and a 3%. However, the biggest effects are detected for councils of Pontevedra and Ourense. Concretely, councils colored in blue in Table 10 increase a 11% their milk quotas when provinces are established as a priori unions structure. Moreover, it can be easily checked that the production of Lalín and Silleda that are two of the three councils where the number of farms is largest increase considerably. Table 10 in Appendix A shows the percentages by provinces of the aggregated of the milk quotas in 2014-2015. Remark that provinces of Pontevedra and Ourense only represent around a \(12.5\%\) of the total Galician production (see also Figure 4). Therefore, the estimated \(RA-\)random arrival rule increases the allocated quotas of the councils that are located in the provinces with smaller aggregated quotas.

As for the effect of counties, all councils suffer variations on their milk quotas if a priori unions are considered. Specifically, the \(RA-\)random arrival rule causes decreasings smaller than a 1% of the production in most of counties. Only councils represented in blue color in Table 11 have an increasing (slightly over 1%) of their milk quotas. Therefore, all councils in the counties of Ordes, Lugo, Terra Chá, O Deza would increase they milk quotas. According to Table 7, they correspond to the biggest milk producers in the period 2014-2015. In this case, the \(RA-\)random arrival rule promotes the development of those counties with largest productions decreasing the milk quotas of the rest of counties in a similar proportion even when levels of production are specially low.

Computation of milk quota systems using alternative bankruptcy rules with a priori unions

The previous section is mainly devoted to the estimation of the \(RA-\)random arrival rule for the bankruptcy problem that arises in the milk conflict of Galicia. This rule that underlies this work is not the only one applicable in these settings. As we have previously mentioned, there are multiple extensions of classical rules in the bankruptcy literature for a priori unions context and that are based on different criteria. Here, we consider the extension of the Talmud rule, \(\overline{T}(N,c,E,P)\), and the extension of the proportional rule, \(\overline{P}(N,c,E,P)\), as in Section 2 for the associated bankruptcy situation with a priori unions \((N,c,E,P)\in BU^N\), following (Borm et al. 2005). Notice that, we include the allocations given by proportional rule to this problem in spite of its immunity to manipulation, in the sense that agents cannot manipulate the allocation by either merging or splitting their claims (see (Frutos 1999) for more details).

Tables 12 and 13 show the results obtained for the extended Talmud and the extended proportional rules when provinces and counties are considered as a priori unions. They were also treated in (Saavedra-Nieves A. and Saavedra-Nieves 2020) when \(\rho=40\) but there, a priori unions were not taken into account. As before, the role of provinces and counties will be discussed on the milk quotas that this extension of the Talmud rule provides in both cases. The approach of the proportional rule does not cause any change on the results in (Saavedra-Nieves A. and Saavedra-Nieves 2020) when provinces or counties are incorporated as a priori unions. Therefore, discussion is only focused on the case of the Talmud rule.

The effect of provinces cause some variations in the resulting milk quotas for extension of the Talmud rule to those settings of a priori unions. However, most of councils do not suffer any variation with respect to the results in (Saavedra-Nieves A. and Saavedra-Nieves 2020). Note that the only differences detected are not usually bigger than a 7%. Specifically, the above-mentioned extension of the Talmud rule causes that Negreira, Ordes and Pastoriza increase their milk quotas between a 2% and a 3%; Curtis and Castro de Rei, a 4%; Mazaricos, Santa Comba, Paradela, Sarria and Cospeito, between a 5% and a 6% and Arzúa and Frades, a 7%. Note that many of them are the biggest producers of milk in their counties or, of course, they have remarkable levels of production. Additionally, results for some particular councils must be discussed. Only the councils of Lalín, Rodeiro and Silleda, all of them in the province of Pontevedra, decrease their allocations when provinces are considered as a priori unions. Concretely, the corresponding milk quotas decrease a respectively. But councils of Mesía, Tordoia, Trazo, Taboada, Castro Verde, Guntín, Lugo, Pol and Guitiriz increase their milk quotas from 8% to 12% when provinces are involved in the computation of the rule. Hence, it seems that those councils with the highest production in a province with a low milk quota such as Pontevedra (see Figure 4) are penalyzed in favour of those councils with the largest levels of production belonging to those provinces with the highest milk quotas.

Percentages by counties of the aggregated milk quotas computed using the extended Talmud rule with counties as a priori unions.
County Milk quota \(\%\) County Milk quota \(\%\) County Milk quota \(\%\)
A Barcala 22902.45 1.712 Terra de Melide 25701.37 1.921 Baixa Limia 33.84 0.003
A Coruña 6287.29 0.470 Terra de Soneira 20107.70 1.503 A Limia 2466.17 0.184
Arzúa 51642.84 3.860 Xallas 63755.62 4.765 Allariz-Maceda 3182.62 0.238
Bergantiños 30796.28 2.302 A Fonsagrada 5852.98 0.437 O Carballiño 1057.37 0.079
Betanzos 42513.86 3.178 A Mariña Central 8320.56 0.622 Ourense 221.07 0.017
Eume 16831.24 1.258 A Mariña Occidental 11.32 0.001 Terra de Caldelas 162.46 0.012
Ferrol 7459.15 0.558 A Mariña Oriental 33833.70 2.529 Terra de Celanova 501.92 0.038
Fisterra 16757.41 1.253 A Ulloa 24834.73 1.856 Terra de Trives 203.72 0.015
Muros 19.30 0.001 Chantada 59458.77 4.444 Verín 559.91 0.042
Noia 3405.23 0.255 Lugo 142791.67 10.673 Viana 1279.78 0.096
O Barbanza 133.10 0.010 Meira 32100.85 2.399 Caldas 657.54 0.049
Ordes 147956.25 11.059 Os Ancares 3601.96 0.269 O Deza 159395.01 11.914
Ortegal 2299.32 0.172 Sarria 69924.08 5.226 O Salnés 98.23 0.007
Santiago 34508.55 2.579 Terra Chá 248631.03 18.584 Pontevedra 298.72 0.022
Sar 7366.87 0.551 Terra de Lemos 21959.60 1.641 Tabeirós-T.de Montes 16003.36 1.196

As regards the role of counties, milk quotas vary considerably when they are included as a priori unions. For instance, milk quotas of Arzúa, Mazaricos Santa Comba, Chantada, Taboada, Pol and Sarria decrease around a 29%, 34%, 35%, 31%, 20%, 22% and 23%, respectively. However, other councils will increase the tons of milk to produce notably. In particular, Frades (13%), Mesía (16%), Ordes (18%), Tordoia (20%), Trazo (21%), Castro Verde (26%), Friol (27%), Guntín (20%), Lugo (18%), Portomarín (20%), Castro de Rei (11%), Cospeito (15%), Guitiriz (28%) and Vilalba (24%). In this case, the effect of the counties seems to penalize the milk quotas of councils that are big producers in favour of more intermediate producers. Table 9 shows the percentages of production for these new milk quotas by counties. The comparison of these results with the contained in Table 7 in Appendix A allows to extract a similar conclusion. Remark that this new milk quotas tends to balance the percentages between counties again penalize the biggest producers. According results obtained, the extended version of Talmud rule is the allocation method where counties produce the most extreme changes in the resulting system of quotas.

Concluding remarks

In this work, we have described a computational procedure to estimate the \(RA-\)random arrival rule incorporating a priori unions for bankruptcy problems. This proposal is based on simple random sampling with replacement following the scheme in (Saavedra-Nieves A. and Saavedra-Nieves 2020). The determination of this rule is specially complicated when bankruptcy situations involve a large set of agents. Moreover, this new approach can be computed in parallel reducing the required time and the complexity with respect to the exact computation of the \(RA-\)random arrival rule for bankruptcy problems.

Some theoretical results to ensure that our proposal correctly approximates the real value were also provided following (A. Saavedra-Nieves, García-Jurado, and Fiestras-Janeiro 2018). In particular, this allows to determine the adequate sampling size for estimations. The performance of our sampling method has been also checked on two well-known examples in the literature.

Finally, it is worth mentioning the application of this proposal of sampling on a practical case. Concretely, the milk problem arisen in Galicia after the suppression of the European milk quotas in April 2015 and that led to a social conflict in the region is also treated here. In this case, the role of the administrative territorial divisions of Galicia in provinces and counties to solve this problem is checked. Concretely, the \(RA-\)random arrival rule in bankruptcy taking the provinces and counties as a priori unions is introduced as a mechanism of determining a new system of milk quotas based on a fairness criteria as solution. Besides, we compare these two resulting system of quotas with the ones obtained under the corresponding extensions of classical rules in bankruptcy literature, as the Talmud and proportional rules as well as the milk quotas established in (Saavedra-Nieves A. and Saavedra-Nieves 2020) where a priori unions were not considered. The role of provinces and counties as a priori unions is not insignificant at all in order to establish new milk quotas depending on the objectives.

For instance, the effect of considering the organization in provinces as a priori unions system in the estimation of the \(RA-\)random arrival rule increases the allocated quotas of those councils that are located in the provinces with smaller aggregated quotas. However, when counties are taken as a priori unions, milk quotas of those ones that present largest levels of production increase slightly their milk quotas. Moreover, the rest of counties decrease their levels of production in a similar proportion even when they are not very representative.

As for Talmud rule under the existence of a priori unions structure, the role of counties penalyze the milk quotas of councils that are big producers in favour of intermediate ones. If provinces are established as a priori unions, councils that have largest production in a province with low milk quota suffer production reductions in favour of councils that present the largest production in provinces with the highest milk quotas.

Therefore, territorial organization of Galicia in provinces and counties could play a decisive role in order to establish new system of quotas attending to the specific needs of public administrations and producers. For instance, those rules that tend to balance the milk quotas between councils could clearly contribute to structure and revitalize Galician territory and those others ones that enhance the areas that are already big milk producers would specialize the dairy sector.

About the authors

Alejandro Saavedra-Nieves is an Associate Professor at the Department of Statistics, Mathematical Analysis and Optimization (Universidade de Santiago de Compostela, USC). He obtained his PhD in Statistics and Operations Research in March 2019, with a thesis entitled Contributions in Cooperative Game Theory and Applications, at Universidade de Vigo. His research is mainly focused on Operations Research and Cooperative Game Theory. He has also developed several R packages.
Paula Saavedra-Nieves is an Associate Professor at the Department of Statistics, Mathematical Analysis and Optimization (Universidade de Santiago de Compostela, USC). She obtained her PhD in Statistics and Operations Research in March 2015, with a thesis entitled Nonparametric data-driven methods for set estimation. Her research is mainly focused on nonparametric set estimation techniques and directional data. She has also developed several R packages.

Referencias

Aumann, R. J., and M. Maschler. 1985. “Game Theoretic Analysis of a Bankruptcy Problem from the Talmud.” Journal of Economic Theory 36 (2): 195–213.
Borm, P., L. Carpente, B. Casas-Méndez, and R. Hendrickx. 2005. “The Constrained Equal Awards Rule for Bankruptcy Problems with a Priori Unions.” Annals of Operations Research 137 (1): 211–27.
Castro, J., D. Gómez, and J. Tejada. 2009. “Polynomial Calculation of the Shapley Value Based on Sampling.” Computers & Operations Research 36 (5): 1726–30.
Curiel, I. J., M. Maschler, and S. H. Tijs. 1987. “Bankruptcy Games.” Zeitschrift für Operations Research 31 (5): A143–59.
Fernández-García, F. R., and J. Puerto-Albandoz. 2006. “Teoria de Juegos Multiobjetivo.” Imagraf Impresores SA, Sevilla.
Frutos, M. A. de. 1999. “Coalitional Manipulations in a Bankruptcy Problem.” Review of Economic Design 4 (3): 255–72.
González-Díaz, J., I. García-Jurado, and M. G. Fiestras-Janeiro. 2010. An Introductory Course on Mathematical Game Theory. Graduate Studies in Mathematics. Vol. 115. Providence: American Mathematical Society.
Hoeffding, W. 1963. “Probability Inequalities for Sums of Bounded Random Variables.” Journal of the American Statistical Association 58 (301): 13–30.
Maleki, S. 2015. “Addressing the Computational Issues of the Shapley Value with Applications in the Smart Grid.” PhD thesis, University of Southampton.
Moulin, H. 2002. “Axiomatic Cost and Surplus Sharing.” Handbook of Social Choice and Welfare 1: 289–357.
O’Neill, B. 1982. “A Problem of Rights Arbitration from the Talmud.” Mathematical Social Sciences 2 (4): 345–71.
Owen, G. 1975. “Multilinear Extensions and the Banzhaf Value.” Naval Research Logistics (NRL) 22 (4): 741–50.
———. 1977. “Values of Games with a Priori Unions.” In Mathematical Economics and Game Theory, 76–88. Springer.
Popoviciu, T. 1935. “Sur Les équations Algébriques Ayant Toutes Leurs Racines réelles.” Mathematica 9: 129–45.
Pulido, M., J. Sánchez-Soriano, and N. Llorca. 2002. “Game Theory Techniques for University Management: An Extended Bankruptcy Model.” Annals of Operations Research 109 (1-4): 129–42.
R Core Team. 2023. R: A Language and Environment for Statistical Computing. Vienna, Austria: R Foundation for Statistical Computing. https://www.R-project.org/.
Saavedra-Nieves, A., I. García-Jurado, and M. G. Fiestras-Janeiro. 2018. “Estimation of the Owen Value Based on Sampling.” In The Mathematics of the Uncertain. Studies in Systems, Decision and Control, 347–56. Springer.
Saavedra-Nieves, A., and P. Saavedra-Nieves. 2020. “On Systems of Quotas from Bankruptcy Perspective: The Sampling Estimation of the Random Arrival Rule.” European Journal of Operational Research 285 (2): 655–69.
Schmeidler, D. 1969. “The Nucleolus of a Characteristic Function Game.” SIAM Journal on Applied Mathematics 17 (6): 1163–70.
Shapley, L. S. 1953. “A Value for n-Person Games.” Contributions to the Theory of Games 2 (28): 307–17.
Thomson, W. 2015. “Axiomatic and Game-Theoretic Analysis of Bankruptcy and Taxation Problems: An Update.” Mathematical Social Sciences 74: 41–59.

  1. Galician Government website: https://mediorural.xunta.gal/↩︎

Appendix A. Milk quotas for \(190\) councils in Galicia in the period 2014-2015

Table 8 shows the milk quotas for \(190\) councils in Galicia in the period 2014-2015. Figure 9 shows the councils that are milk producers in gray color and through the size of a corresponding bullet indicates the proportion of its milk quota. These data can be obtained from the website of Consellería de Medio Rural of Xunta de Galicia1. Moreover, we also show the number of farms in each council the councils distribution by provinces and counties, respectively.

A brief summary of information in Table 8 is shown in Tables 10 and 7. Concretely, Table 10 contains the aggregated milk quotas in the period 2014-2015 by provinces as well as the corresponding percentages. Table 7 also shows the the aggregated milk quotas in the period 2014-2015 but, in this case, by counties. Moreover, the seven counties with a production percentage bigger than the 5% are represented in blue color. Remark that they represent practically the 60% of the milk quotas in Galicia. Counties that are between the 3% and the 5% were represented in gray color. They are Arzúa, Betanzos, Santiago and A Mariña Oriental.

Aggregated milk quotas in the period 2014-2015 by provinces and percentages of the total.
Province Milk quotas \(\%\)
A Coruña 917478.555 41.146
Lugo 1034937.150 46.414
Ourense 19337.713 0.867
Pontevedra 258057.863 11.573
Aggregated milk quotas in the period 2014-2015 by counties and percentages of the total.
Milk quotas for 190 councils in Galicia in the period 2014-2015 organized by provinces and counties.
Map of Galicia and the involved councils (in gray). In dark gray, the size of the bullet of each council indicates the proportion of its milk quota in 2014-2015.

Appendix B. New systems of milk quotas for \(190\) councils in Galicia in the period 2014-2015.

Table 10 contains the new systems of milk quotas for the set of 190 councils in Galicia in the period 2014-2015 obtained from the estimations of the \(RA-\)rule when provinces are considered as a priori unions with \(\ell=10^7\). Table 11 shows the corresponding results when the counties are taken as a priori unions. Three values of the parameter \(\rho\) were considered. Concretely, \(\rho= 40\), \(\rho= 10\) and \(\rho= 5\). Therefore, the corresponding estates are \(E=1337887\), \(E= 2006830\) and \(E= 2118321\), respectively.

Table 12 shows two new systems of milk quotas from Talmud and proportional rules for the set of 190 councils in Galicia in the period 2014-2015 when we impose a reduction of production equal to \(40\%\) (\(\rho=40\)). The cases \(\rho=10\) and \(\rho=5\) can be supplied on request.

Estimated RA-random arrival rule for 190 councils in Galicia with provinces.
Estimated RA-random arrival rule for 190 councils in Galicia with counties.
New systems of milk quotas for 190 councils in Galicia for the case \rho=40\% with the provinces.
New systems of milk quotas for 190 councils in Galicia for the case \rho=40\% with the counties.

Más BEIO

Uso de app’s para recogida de datos en la estadística oficial

Los institutos oficiales de estadística europeos han realizado un gran esfuerzo durante los últimos años para adaptarse al avance de las nuevas tecnologías estableciendo un nuevo canal de recogida de datos basados en cuestionarios web de auto-cumplimentación. Eustat, el Instituto Vasco de Estadística, lleva trabajando desde el año 2017 en el desarrollo de app’s para teléfonos móviles.

New advances in set estimation

Some recent advances in Set Estimation, from 2009 to the present, are discussed. These include some new findings, improved convergence rates, and new type of sets under study. Typically, the theoretical results are derived under some shape constrains, such as r-convexity or positive reach, which are briefly reviewed, together with some other new proposals in this line. Known constraints on the shape, such as r-convexity and positive reach, as well as recently introduced ones are discussed. The estimation of the home-range of a species, which is closely related to set estimation, is also explored, and statistical problems on manifolds are covered. Commentary and references are provided for readers interested in delving deeper into the subject.

Problemas de Elección Social en el Contexto de los Problemas de Asignación

En este trabajo proponemos un método de elección social basado en el problema de asignación de la investigación de operaciones, en particular consideramos un proceso de votación donde los votantes enumeran según sus preferencias a cada uno de los n candidatos disponibles, luego entonces nosotros construimos una matriz de asignación donde las “tareas” por realizar son los puestos 1,2,…n; siendo el puesto número 1 el principal y el n-ésimo el de menor jerarquía. El valor de la posición ij de la matriz se obtiene considerando el número de veces que el candidato i fue seleccionado para “ocupar” el puesto j. Así obtenemos una matriz de rendimiento y se busca la mejor asignación. Usamos bases de datos obtenidos de algunos procesos de elección en los Estados Unidos de América y comparamos los resultados que se obtendrían con nuestra propuesta, adicionalmente se construyen ejemplos para demostrar que nuestro método no es equivalente a los métodos de Borda, Condorcet y mayoría simple.

Técnicas de diferenciabilidad con aplicaciones estadísticas

En esta tesis doctoral se han explorado diferentes aplicaciones del conocido Método delta (Capítulo 2). En concreto, se han calculado las derivadas de Hadamard direccional de diferentes funcionales de tipo supremo en diferentes contextos. A continuación, se han investigado aplicaciones a inferencia no-paramétrica (Capítulo 3), a los problemas de dos muestras u homogeneidad (Capítulo 4) y a la metodología de k-medias (Capítulo 5).

Relevance and identification of biases in statistical graphs by prospective Primary school teachers

El enorme poder de visualización de la información basada en datos representada mediante gráficos estadísticos, hace especialmente interesante el estudio del entendimiento de dicha información por parte de los ciudadanos que se enfrentan a ella día a día. Al mismo tiempo, en el ámbito de didáctica de la estadística se investiga para conocer cómo se produce la transferencia de conocimiento estadístico en la escuela. Así, aunando ambos fines, el propósito del presente estudio exploratorio es observar el grado de alfabetización estadística que poseen los futuros maestros en base a la evaluación de los gráficos estadísticos, frecuentemente utilizados en los medios de comunicación, y la identificación de los sesgos que debido a su visualización selectiva de los datos a veces estos presentan. Los resultados muestran, de forma implícita, una aceptable identificación de convenios para cada gráfico estudiado mientras que evidencia una muy pobre identificación de sesgos o errores en dichas imágenes. Con ello se deduce una necesidad de refuerzo educativo en cuanto a la enseñanza y aprendizaje de la estadística, concretamente, en los estudiantes del Grado de Educación Primaria para, mediante ello, conseguir ciudadanos con una alfabetización estadística funcional desde la escuela.

Learning to build statistical indicators from open data sources

The paper presents the building of several statistical indicators from different Open Data sources, all of them using a common methodological approach to estimate changes across time. The purpose is to show the problems that must be addressed when using these data and to learn about the different ways to cope with them, according to the type of information, the data available and the aim of the specific indicator. The raw data come from diverse secondary sources that make it publicly accessible: traffic sensors, multichannel citizen attention services, Twitter messages and scraped data from a digital newspapers’ library website. The built indicators may be used as proxies or lead indicators for economic activities or social sentiments.