Weighted nucleoli and dually essential coalitions

We consider linearly weighted versions of the least core and the (pre)nuceolus and investigate the reduction possibilities in their computation. We slightly extend some well-known related results and establish their counterparts by using the dual game. Our main results imply, for example, that if the core of the game is not empty, all dually inessential coalitions (which can be weakly minorized by a partition in the dual game) can be ignored when we compute the per-capita least core and the per-capita (pre)nucleolus from the dual game. This could lead to the design of polynomial time algorithms for the per-capita (and other monotone nondecreasingly weighted versions of the) least core and the (pre)nucleolus in specific classes of balanced games with polynomial many dually essential coalitions.


Introduction
The nucleolus (Schmeidler 1969) is one of the major single-valued solution concepts for transferable utility cooperative games. It seemingly depends on all coalitional values, but a closer look reveals the inherent high redundancy in its definition. Indeed, as Brune (1983), and later Reijnierse and Potters (1998)

have proved: in any n-player
The author is grateful to two anonymous reviewers and an associate editor for their comments and questions that led to the discussions in the last section. Special thanks to the associate editor for checking all details B Tamás Solymosi tamas.solymosi@uni-corvinus.hu game there are at most 2n − 2 coalitions which actually determine the nucleolus. Unfortunately, the identification of these nucleolus-defining coalitions is no less laborious as computing the nucleolus itself. On the other hand, if special properties of the game enable us to specify a priori a polynomial size characterization family of coalitions for the nucleolus, then we can compute it in polynomial time (in the number of players).
There are several classes of balanced games for which polynomial time nucleolus algorithms are available in the literature. The key to the efficiency of some of these algorithms (e.g. in case of assignment games) is Huberman's (1980) theorem stating that in a balanced game all nucleolus-defining coalitions are essential (cannot be weakly majorized by a partition) in the game, hence the inessential ones can be ignored. Although typically not explicitly mentioned, but several other known polytime algorithms (e.g. in case of fixed-tree games) rely on the dual counterpart of Huberman's result: in computing the nucleolus of a balanced game, all dually inessential coalitions (which can be weakly minorized by a partition in the dual game) can be ignored.
Our aim is to investigate what kinds of weighted versions of the nucleolus can also be computed by taking into account only coalitions in these families. Since the above mentioned reducibility results require nonemptiness of the core, our domain will also be the class of balanced games. We are mostly concerned about the per-capita nucleolus (Grotte 1970(Grotte , 1972, so we restrict our study to linear weight systems. On the other hand, we allow weights that depend not only on the size, but also on the value of the coalitions. In particular, we allow the weight of a coalition to be equal to its value (provided it is positive), thus some of our results also apply to the proportional nucleolus of a balanced game (with only positive coalitional values).
The nucleolus is based on the coalitional surplusses (the difference between the payoff to and the value of the coalition). This measure, however, does not take into account neither the size, nor the value (or any other characteristic that maybe important for an application) of the coalitions. Various weighted nucleoli (based on weighted surplus measures) were considered by several authors, but mostly from an axiomatization point of view, see e.g. (Derks and Peters 1998;Derks and Haller 1999;Kleppe 2010;Kleppe et al. 2016;Calleja et al. 2018). We address issues in connection with their computation.
In general, a linearly weighted nucleolus can be determined by the very same methods as the (standard) nucleolus, only straightforward adjustments are needed that only negligibly effect the performance. This is particularly true for the most frequently applied sequential linear programming approach pioneered by Kopelowitz (1967) (for a recent implementation finely tuned even for large games, see (Nguyen and Thomas 2016)). On the other hand, and in contrast to the rich literature on the computation of the (standard) nucleolus in specific classes of games, we can only mention the algorithm by Huijink et al. (2015) that computes the per-capita nucleolus in bankruptcy games. One of our results might shed light on a possible reason for this phenomenon. We demonstrate (in Example 3) that the family of essential coalitions is not sufficient to determine the per-capita nucleolus, not even in a balanced game, so Huberman's (1980) reducibility result cannot be used in the computation of the per-capita nucleolus.
We find, however, that if we compute the nucleolus of a balanced game from the dual coalitional values, Huberman's idea works, not just for the (standard) nucleolus (that is implicitly the basis for many known efficient algorithms), but also for the per-capita and other monotone nondecreasingly weighted nucleoli. We prove (in Theorem 4) that if the core of the game is not empty, all dually inessential coalitions (those which can be weakly minorized by a partition in the dual game) can be ignored when we compute the per-capita (or other monotone nondecreasingly weighted versions of the) nucleolus from the dual game. We believe that this observation could become the theoretical basis for various polynomial time algorithms (yet to be) designed for the per-capita nucleolus in specific classes of balanced games known to have polynomial many dually essential coalitions (e.g. assignment games, fixed-tree games). Other candidates for this endeavour might be the well-known classes of games whose duality relations are discussed by Oishi and Nakayama (2009). The usefulness of looking at the dual games also in the axiomatizations of solutions is underlined by Oishi et al. (2016).
The organization of the paper is as follows. We collect the necessary general preliminaries and introduce the linear weight systems in the next section. In Sect. 3, we discuss weighted least cores, since computing them is the first step in finding the weighted (pre)nucleoli. We present properties of the weight function under which the family of essential coalitions is sufficient to determine the weighted least core, and also when the family of dually essential coalitions is sufficient to determine the weighted least core in the dual game of a balanced game. In Sect. 4, we present the weighted primal and dual versions of the lexicographic center procedure (Maschler et al. 1979) that sequentially reduces the set of allowable payoffs until it shrinks to the (pre)nucleolus allocation, and discuss which properties of the weight system make the inessential coalitions, or in the dual version the dually inessential coalitions redundant in these sequential optimization processes when applied to balanced games. In Sect. 5 we discuss how and when we can refine our results by combining the primal and dual restricted descriptions of the standard/per-capita least core/(pre)nucleolus. In that last section we also illustrate the simplification potential of applying dual (in)essentiality on the 5-player (balanced) cost game discussed by Suzuki and Nakayama (1976).

Preliminaries
A transferable utility cooperative game on the nonempty finite set N of players is defined by a coalitional function v : 2 N −→ R that satisfies v(∅) = 0. The function v specifies the worth of every coalition S ⊆ N . We shall denote by the collection of nontrivial coalitions. The player set N will be fixed throughout the paper, so we drop it from the notation and refer to v as the game. The game v is called where, by the standard notation, x(S) = i∈S x i if S = ∅, and x(∅) = 0. We denote by Ef(v) the set of efficient payoff vectors called the preimputation set, and by Co(v) the set of efficient and coalitionally rational payoff vectors called the core of the game v. Games with a nonempty core are called balanced.
The excess e (S, x, v) = v(S) − x(S) is the usual measure of gain (or loss if negative) to coalition S ⊆ N in game v if its members depart from allocation x ∈ R N in order to form their own coalition. Note that in any game v, e (∅, x, v) = 0 for all x ∈ R N , and the core is the set of efficient allocations which yield nonpositive excess for all nontrivial coalitions. It will be more convenient to use the negative excess the core of a game coincides with the anticore (where the inequalities are reversed) of its dual game, that is, We call (2) the dual description of the core. We will investigate which families of nontrivial coalitions are sufficient to determine a solution in a game and which coalitions are redundant. Two types of coalitions will be considered.
Coalition S ⊆ N is called inessential in game (N , v), if its value can be weakly majorized by a proper partition, i.e. if v(S) ≤ v(S 1 ) + · · · + v(S k ) for some partition S = S 1 ∪ · · · ∪ S k with k ≥ 2. A coalition is essential in a game if it is not inessential. Observe that an inessential coalition has a weakly majorizing partition consisting only of essential coalitions. Notice that all 1-player coalitions are essential in any game. We denote by E (v) ⊆ N the family of essential coalitions in game v. It is straightforward that all inessential coalitions are redundant for the core, i.e.
Observe that the core Co(v) = Co(N , v) is described by 1 + |N | = 2 |N | − 1 linear constraints but in the restricted description Co(E (v), v) the number of linear constraints is 1 + |E (v)| that could be significantly smaller than 2 |N | − 1. The dual description (2) of the core also has a reduced form. Coalition S ⊆ N is called dually inessential in game (N , v), if it is anti-inessential in the dual game, i.e. it has a proper partition S = S 1 ∪ · · · ∪ S k with k ≥ 2 such that v * (S 1 ) + · · · + v * (S k ) ≤ v * (S). A coalition is dually essential in a game if it is not dually inessential. Observe that a dually inessential coalition has a minorizing partition in the dual game that consists only of dually essential coalitions. Notice that all 1-player coalitions are always dually essential. We denote by E * (v * ) ⊆ N the family of dually essential coalitions. It is straightforward that all dually inessential coalitions are redundant for the core, i.e.
The above remark on the significant reduction possibility in the size of the (dual) core description applies here too.
The standard surplus (excess) does not take into account neither the size, nor the value (or any other characteristic that maybe important for an application) of the coalitions. More general excess functions were considered by several authors, but we restrict ourselves to the weighted versions that preserve the linearity of the measure with respect to the payoff variables.
In the sequel we assign a (maybe coalition specific) positive weight q(S) > 0 to each nontrivial coalition S ∈ N , and define the q-weighted surplus (q-surplus for short) of nontrivial coalition S ∈ N at allocation x ∈ R N in game v to be Note that no matter which system {q(S) > 0 : S ∈ N } of weights is used, i.e., the core is the set of efficient allocations which yield nonnegative q-surplus for all nontrivial coalitions. We say that a weight function is subadditive, if S ∩ T = ∅ implies q(S) + q(T ) ≥ q(S ∪ T ) for all S, T ∈ N ; superadditive, if the inequality is reversed; additive, if both subadditive and superadditive; monotone nondecreasing, if S ⊂ T implies q(S) ≤ q(T ) for all S, T ∈ N ; and monotone nonincreasing, if the inequality is reversed.
We consider two surplus-based solutions: the least core and the (pre)nucleolus. The weighted versions of both solutions (formally defined later) are obtained if we replace the standard surplus measure f with the weighted surplus f q in their respective definitions. As special cases we get -the (standard) least core and nucleolus, if we take the monotone and subadditive (but not superadditive) weight function q(S) = 1 for all S ∈ N ; -the per-capita least core and nucleolus, if we take the monotone and additive weight function q(S) = |S| for all S ∈ N ; -for positive-valued game v (i.e. v(S) > 0 for all S = ∅), the proportional least core and nucleolus, if we take the weight function q(S) = v(S) for all S ∈ N .

Weighted least cores
The least core LC(v) of a game v was first formally treated by Maschler et al. (1979) as the set of all efficient allocations that maximize the minimum surplus of nontrivial coalitions, i.e., Recall that in any game the least core is a nonempty polytope. Given a positive weight function q, the q-weighted least core LC q (v) (q-least core for short) is defined analogously as the set of all efficient allocations that maximize the minimum q-surplus of nontrivial coalitions, i.e., or equivalently, in a more operational form, Observe that for any game v and weight function q, the uniformly guaranteed q-surplus level α 1 q (v) is well defined, the q-least core is a nonempty polytope, and We will also consider certain restricted versions when only coalitions coming from a nonempty family M ⊆ N are taken into account. The family M will always be "rich enough" so that the restricted q-least core LC q (M , v) will always be a nonempty polytope like the unrestricted one LC q (v) = LC q (N , v). For the same reason, also in the restricted case α 1 q (M , v) will always be well defined. The linearity of the q-surplus in the payoff variables allows us to compute α 1 q (v) with the following LP with all variables x ∈ R N and α ∈ R unrestricted in sign: Clearly, this LP has optimal solution(s), its optimum value equals to α 1 q (v), and its optimal solutions are of the form (x, α 1 q (v)) with some q-weighted least core payoff vector x ∈ LC q (v).
Since v(N ) = v * (N ) and N also contains N \S for each S ∈ N , if we subtract from the efficiency equation the inequalities related to the subcoalitions and reverse the direction of optimization by substituting α = −β, we get an equivalent LP in terms of the dual game: Notice that unless q(T ) = q(N \T ) for all T ∈ N , the inequalities in (8) can not be expressed in terms of the q-surplus in the dual game, since in the inequality related to T variable β is multiplied by the weight q(N \T ) of the complement coalition. Thus, unlike for the core, the q-least core of a game typically can not be obtained by simply reversing the inequalities in the definition of the q-weighted least core of the dual game. Since the general weighted version of relation (1) is we introduce a transformed version of the weighted surplus in the dual game: Then the dual description of the q-weighted least core is or equivalently, in a more operational form, Observe that for the standard least core LC(v) (when q(S) = 1 for all S ∈ N ) the dual description simplifies to that is a straightforward counterpart of its definition. It should be emphasized, however, that in general the transformed weighted surplus g q (S, x, v * ) must be used in the dual description.
The following characterizations of weighted least-core allocations in terms of balanced collections can be easily obtained by standard LP duality arguments applied to the LP descriptions (7) or (8).

Proposition 1 An efficient payoff allocation x belongs to the q-weighted least core of game v if and only if the family of nontrivial coalitions that satisfy either type of the following two properties contains a (minimal) balanced collection
For the standard least core, the first type of characterization (in terms of v) is wellknown (cf. e.g. Peleg and Sudhölter 2003, p.183).
There is a close relationship between the two types of (minimal) balanced collection(s) mentioned in Proposition 1. If, at a q-weighted least core allocation x, we replace all coalitions of a (minimal) balanced collection contained in the family S 1 (x) of coalitions with minimum q-surplus f q (S, x, v) with their complements, we get a (minimal) balanced collection contained in the family T 1 (x) of coalitions with maximum transformed dual q-surplus g q (N \S, x, v * ), and vice versa.
We now identify families of redundant coalitions for weighted least cores.
Theorem 1 1. In a balanced game v, all inessential coalitions are redundant for LC q (v) with a subadditive weight function q. In particular, for the standard least core with a superadditive weight function q. In particular, for the per-capita least core In any game v, all inessential coalitions are redundant for LC q (v) with an additive weight function q. In particular, for the per-capita least core . For simplicity of notation, we assume (without loss of generality) that the weakly majorizing partition consists only of k = 2 subcoalitions. Then at any where the third one is the sum of the first two. By the above assumption, v(S) ≤ v(S 1 ) + v(S 2 ), so the third inequality implies the last one, hence that is redundant for the system in (7), if [q(S 1 ) + q(S 2 )]α ≥ q(S)α. This condition clearly holds, if 1. α ≥ 0 (i.e. v is balanced) and q is a subadditive weight function. 2. α < 0 (i.e. v is not balanced) and q is a superadditive weight function. 3. q is an additive weight function.
Since S 1 , S 2 ∈ E (v), the above argument can be independently done for any inessential S ∈ N \E (v). The claims for the special least cores follow from the properties of their respective weight functions.
As the following example demonstrates, the second and third statements in Theorem 1 are not true for the standard least core LC.
Example 1 Consider the following game on player set N = {1, 2, 3, 4} given by It is easily checked that v is superadditive, but not balanced, e.g. 1 2 v (12) The uniqueness of this least core allocation comes from the "full rank nature" of S 1 (x).
In contrast, and as an illustration of the second statement in Theorem 1, the uniformly guaranteed per-capita surplus is α 1 12,14,24,123,134, 234} that is the union of the balanced collections {3, 12, 14, 24} and the above S 1 (x), so by Proposition 1, z ∈ LC pc (v). Since {3, 12, 14, 24} ⊂ E (v) and it is itself a "full rank" (minimal) balanced collection, the restriction to the family of essential coalitions gives the same α 1 Let us see redundant coalitions in the dual descriptions of weighted least cores.
Theorem 2 In a balanced game v, all dually inessential coalitions are redundant for LC q (v) = LC * q (v * ) with a monotone nondecreasing weight function q. In particular, for the standard least core LC(v) = LC * (E * (v * ), v * ), and for the per-capita least For simplicity of notation, we assume (without loss of generality) that the weakly minorizing partition consists only of k = 2 subcoalitions. Then at any x ∈ R N , we have the inequalities where the third one is the sum of the first two. By the above assumption, v * ( , so the third inequality implies the last one, hence that is redundant for the system in (8) This condition clearly holds if β = −α ≤ 0 (i.e. v is balanced) and the weight function q is monotone nondecreasing, because then Since T 1 , T 2 ∈ E * (v * ), the above argument can be independently done for any dually inessential T ∈ N \E * (v * ). The claims for the special least cores follow from the fact that their respective weight functions are monotone nondecreasing.
As the following example demonstrates, balancedness of the game in Theorem 2 is needed for both the standard least core LC and the per-capita least core LC pc .
In the dual description (10) for the per-capita least core, the minimum uniformly guaranteed transformed dual surplus is β 1 pc (v * ) = 3 4 , and the set of optimal solutions is the singleton LC * pc (v * ) = {z = ( 9 4 , 9 4 , − 3 4 , 57 4 )}, that is, of course, the same as LC pc (v) in Example 1. We can also confirm this by the second characterization in Proposition 1. Indeed, at allocation z, the family of coalitions with largest transformed dual per-capita surplus (= 3 4 ) is T 1 pc (z) = {1, 2, 4, 13, 23, 34, 124} that is the union of the partitions {1, 2, 34}, {1, 4, 23}, {2, 4, 13}, and the (minimal) balanced collection {13, 23, 34, 124}, so t ∈ LC * pc (v * ) indeed. The uniqueness comes again from the "full rank nature" of T 1 pc (z). Notice also here that T 1 pc (z) consists of the complements of the coalitions in S 1 pc (z) in Example 1 and β 1 pc (v * ) = −α 1 pc (v). On the other hand, since only the single-player coalitions are dually essential and g pc (k, ., v -restricted optimization in the per-capita case gives the same set of optimal solutions as in the standard case. Thus, , 2, 3, 4} that is itself a partition of "full rank", so from Proposition 1 we get that s ∈ LC * pc (E * (v * ), v * ), and s is the unique such allocation.

Weighted nucleoli
The (pre)nucleolus (Schmeidler 1969) is a nonempty set of (pre)imputations that consists of a single element, called the (pre)nucleolus allocation. The following alternative definition (Maschler et al. 1979) will serve us better here.
For game (N , v) and weight function q, the q-weighted prenucleolus Nu q (v) (qprenucleolus for short) is defined as the outcome of the following procedure: The final set X ρ is the q-prenucleolus Nu q (v) of game v. We refer to the unique vector η q in X ρ as the q-prenucleolus-allocation.
By straightforward adjustments of the arguments given by Maschler et al. (1979) one can easily see that ρ is well defined and finite; where α 1 q (v) and LC q (v) are defined in (6). Notice the difference between α 1 q (v), a characteristic of the game, and α 1 q , a number determined by the algorithm (13). We will also consider certain restricted versions, but only to a nonempty family of coalitions M ⊆ N that is "rich enough" so that all above statements will hold true also in the restricted cases.
We now identify families of redundant coalitions for weighted prenucleoli. The following theorem is a slight generalization of Huberman's (1980) theorem on the standard (pre)nucleolus that is fundamental for the efficient computability of the (pre)nucleolus in various types of balanced games with polynomially many essential coalitions, as it is the case e.g. in assignment games (Solymosi and Raghavan 1994). Huberman (1980) proves that in a balanced game, all inessential coalitions are redundant for the nucleolus.
Recall that for balanced games the prenucleolus is the same as the nucleolus.

Theorem 3 In a balanced game v, all inessential coalitions are redundant for Nu q (v) with a monotone nonincreasing weight function q. In particular, for the standard prenucleolus Nu(v) = Nu(E (v), v).
Proof Let S ∈ N \E (v) be inessential in game v, because of the partition S = S 1 ∪ S 2 with S 1 , S 2 ∈ E (v) and v(S) ≤ v(S 1 ) + v(S 2 ). For simplicity of notation, we assume (without loss of generality) that the weakly majorizing partition consists only of k = 2 subcoalitions. We prove that in all iterations r = 1, . . . , ρ of algorithm (13) the (inequality or equality) constraint related to S is redundant, because it is implied by the constraints related to S 1 and S 2 .
Since iteration r = 1 determines α 1 q (v) and the q-weighted least core, the redundancy of inequalities related to inessential coalitions in a balanced game was shown in claim 1 of Theorem 1 using (11) even under the weaker assumption of subadditivity on the weight function. Observe that the same argument proves our claim in any other iteration r > 1 in which all subcoalitions in the weakly majorizing essential partition are still unsettled (i.e. S i ∈ Σ r −1 for all i = 1, . . . , k), hence all related constraints are inequalities like in (11).
Suppose now that at the beginning of iteration r > 1 coalition S is still not settled (i.e. S ∈ Σ r −1 ), but there are both settled and unsettled subcoalitions in the weakly majorizing essential partition. For simplicity, let S 1 ∈ Δ r −1 be settled, and S 2 ∈ Σ r −1 be still unsettled. If S 1 got settled at the end of iteration j ≤ r − 1, i.e. S 1 ∈ Δ j , then the related constraints in the optimization problem of iteration r are By the above assumption, v(S) ≤ v(S 1 )+v(S 2 ), so the sum of the first two constraints implies the third one, because (i) in iteration r variable α to be maximized satisfies α ≥ α r −1 q ≥ α j q ; (ii) for a balanced game we have α j q ≥ α 1 q ≥ 0; and (iii) in case of a monotone nonincreasing weight function, q(S) ≤ min{q(S 1 ), q(S 2 )} ≤ q(S 1 ) + q(S 2 ).
Finally, suppose that at the end of some iteration r ≥ 1 coalition S becomes settled (i.e. S ∈ Δ r ). This is equivalent to saying that all subcoalitions in the weakly majorizing essential partition have become settled by the end of that iteration. For simplicity, let S 2 ∈ Δ r be the last one to become settled. Then all related constraints become equalities in (14), the redundancy of the last constraint, however, follows in the same way, for all subsequent iterations.
In all three cases the constraints related to S 1 and S 2 imply the constraint related to S, hence algorithm (13) yields the same outcomes even if we discard S from all considerations. Since S 1 , S 2 ∈ E (v), the above arguments can be independently repeated for any inessential S ∈ N \E (v), and the theorem follows.
The constant q(S) = 1 for all S ∈ N weight function is monotone nonincreasing, so we get Huberman's (1980) theorem on the redundancy of inessential coalitions for the standard (pre)nucleolus in balanced games as a corollary.
For completeness, we present (without proof) a characterization of weighted prenucleoli in terms of balanced collections. It is a slight generalization of the charac-terization given by Wallmeier (1984) for q-prenucleoli with monotone nondecreasing and symmetric (i.e. q(S) = q(|S|) for all S ∈ N ) weight function, that, in turn is a straightforward generalization of Kohhlberg's (1971) criterion for the standard prenucleolus. Streamlined versions of Kohlberg's (1971) characterization are given in (Groote Schaarsberg et al. 2013) and (Nguyen 2016) for the standard (pre)nucleolus, and in (Huijink et al. 2015) for the per-capita (pre)nucleolus. Similar characterizations in more general and abstract settings that accommodate the weighted versions discussed here can be found in (Maschler et al. 1992) and (Potters and Tijs 1992).

Proposition 2 An efficient payoff allocation x belongs to the q-weighted prenucleolus of game v if and only if the family of nontrivial coalitions whose q-surplus at x is at most t is a balanced (or an empty) collection for any t ∈ R.
The following example demonstrates that Huberman's (1980) redundancy result cannot be applied for the per-capita (pre)nucleolus, we can not only use essential coalitions, not even in a balanced game (in which case the per-capita prenucleolus coincides with the per-capita nucleolus). This could partly explain why there are much fewer special-purpose algorithms proposed in the literature for the per-capita (pre)nucleolus than for the standard (pre)nucleolus. A recent exception is the algorithm by Huijink et al. (2015) for the per-capita nucleolus of bankruptcy games. The first iteration of algorithm (13) gives α 1 q = 0, so X 1 = LC q (v) = Co(v), and Δ 1 = {12, 34}. The second iteration gives α 2 q = 1 and Δ 2 = {14, 123, 124, 134, 234}. The third iteration gives α 3 q = 3 and Δ 3 = {1, 2, 3, 4, 13, 23, 24}, and the algorithm stops. Thus, ρ = 3. The only allocation in X 3 (in fact, already in X 2 ) is (3, 3, 3, 3), it is the per-capita prenucleolus. It is easily checked also by Proposition 2. Indeed, Let us now consider only the essential coalitions E (v) = {1, 2, 3, 4, 12, 14, 34} and initiate algorithm (13) with Σ 0 := E (v) instead of N . Then the first iteration gives again α 1 . On the other hand, the second iteration gives α 2 q = 2 and Δ 2 = {2, 3, 14}. The third iteration gives α 3 q = 4 and Δ 3 = {1, 4}, and the algorithm stops. Thus, ρ = 3. The only allocation in X 3 (in fact, already in X 2 ) is (4, 2, 2, 4), it is the per-capita prenucleolus of the E (v)-restricted game. It is easily checked also by the restricted version of Proposition 2. Indeed, S 1 = Δ 1 , S 2 = Δ 1 ∪ Δ 2 , S 3 = Δ 1 ∪ Δ 2 ∪ Δ 3 are all balanced families, consisting only of essential coalitions.
Analogously to how we obtained the dual description (10) of the q-weighted least core from its definition (6), given a game (N , v) and weight function q, we can alternatively get the q-weighted prenucleolus Nu q (v) from the dual game (N , v * ) as the outcome of the following procedure, that we call the dual description of the q-prenucleolus: Let Nu * q (v * ) denote the last payoff set Y ρ determined by algorithm (15) performed on the dual game (N , v * ) and η q the single element of Nu * q (v * ). It is easily seen that ρ is well defined and finite; where β 1 q (v * ) and LC * q (v * ) are defined in (10). The inherent relations between algorithm (13) performed on v and algorithm (15) performed on v * are detailed as follows: -ρ = ρ; -for all r = 1, . . . , ρ = ρ we have β r q = −α r q ; -for all r = 1, . . . , ρ = ρ we have Y r = X r ; in particular, LC * q (v * ) = Y 1 = X 1 = LC q (v) and Y ρ = X ρ consists of the unique q-prenucleolus-allocation η q = η q ; -for each r = 1, . . . , ρ = ρ, the family Δ r consists of the complements of the coalitions in Δ r .
We now identify a family of coalitions which are redundant in the dual description of weighted prenucleoli of a balanced game.
Theorem 4 In a balanced game v, all dually inessential coalitions are redundant for Nu q (v) with a monotone nondecreasing weight function q. In particular, for the standard prenucleolus Nu(v) = Nu * (E * (v * ), v * ) and for the per-capita prenucleolus For simplicity of notation, we assume (without loss of generality) that the weakly minorizing partition consists only of k = 2 subcoalitions. We prove that in all iterations r = 1, . . . , ρ of algorithm (15) the (inequality or equality) constraint related to T is redundant, because it is implied by the constraints related to T 1 and T 2 .
Since iteration r = 1 determines β 1 q (v * ) and the q-weighted least core, the redundancy of inequalities related to dually inessential coalitions in a balanced game was shown in Theorem 2. Observe that the same argument proves our claim in any other iteration r > 1 in which all subcoalitions in the weakly minorizing dually essential partition are still unsettled (i.e. T i ∈ Σ r −1 for all i = 1, . . . , k), hence all related constraints are inequalities like in (12).
Suppose now that at the beginning of iteration r > 1 coalition T is still not settled (i.e. T ∈ Σ r −1 ), but there are both settled and unsettled subcoalitions in the weakly minorizing dually essential partition. For simplicity, let T 1 ∈ Δ r −1 be settled, and T 2 ∈ Σ r −1 be still unsettled. If T 1 became settled at the end of iteration j ≤ r − 1, i.e. T 1 ∈ Δ j , then the related constraints in the optimization problem of iteration r are the following: By the above assumption, v * (T 1 ) + v * (T 2 ) ≤ v * (T ), so the sum of the first two constraints implies the third one, because (i) in iteration r variable β to be minimized satisfies β ≤ β r −1 q ≤ β j q ; (ii) for a balanced game we have β j q ≤ β 1 q ≤ 0; and (iii) in case of a monotone nondecreasing weight function, Finally, suppose that at the end of some iteration r ≥ 1 coalition T becomes settled (i.e. T ∈ Δ r ). This is equivalent to saying that all subcoalitions in the weakly minorizing dually essential partition have become settled by the end of that iteration. For simplicity, let T 2 ∈ Δ r be the last one to become settled. Then all related constraints become equalities in (16), the redundancy of the last constraint, however, follows in the same way, for all subsequent iterations.
In all three cases the constraints related to T 1 and T 2 imply the constraint related to T , hence algorithm (15) yields the same outcomes even if we discard T from all considerations. Since T 1 , T 2 ∈ E * (v * ), the above arguments can be independently repeated for any dually inessential T ∈ N \E * (v * ), and the theorem follows.
The claims for the particular (pre)nucleoli follow immediately from the monotone nondecreasing nature of the respective weight functions.
Note that since the constant q(S) = 1 for all S ∈ N weight function is monotone nondecreasing, we get the dual counterpart of Huberman's (1980) theorem that states the redundancy of dually inessential coalitions for the standard (pre)nucleolus in balanced games. This is the implicit basis of various known efficient nucleolus algorithms, e.g. (Megiddo 1978;Granot et al. 1996;Brânzei et al. 2005;van den Brink et al. 2011).
We emphasize that in Theorem 4, balancedness of the game is a necessary condition. To make the point, let us consider the nonbalanced dual game in Example 2: in that game the (standard/per-capita) least core consists of a unique allocation that is precisely the (standard/per-capita) prenucleolus.
For completeness, we present a Kohlberg-type characterization of weighted prenucleoli in terms of the dual game. It is the dual counterpart of the characterization in Proposition 2, and the analogue of the second characterization of weighted least core allocations in Proposition 1.

Proposition 3 An efficient payoff allocation x belongs to the q-weighted prenucleolus of game v if and only if the family of nontrivial coalitions whose transformed dual qsurplus g q (., x, v * ) at x is at least t is a balanced (or an empty) collection for any t ∈ R.
We omit the proof, since the standard LP duality arguments that prove Proposition 2 can be straightforwardly adjusted to the dual description (15).
We use the balanced game in Example 3 to illustrate how Theorem 4 can help in calculating, for example, the per-capita (pre)nucleolus. Recall that in that game we could not use only the essential coalitions, discarding all inessential coalitions lead to a different allocation. Now we demonstrate that we, however, can omit all coalitions that are inessential in the dual game.
Example 4 Consider the dual game of the 4-player balanced superadditive game in , v * (23) = 8, and v * (R) = 6 for all other coalitions R ∈ N . Let the weight function be q(S) = |S| for all S ∈ N .

Final remarks
We considered linearly weighted versions of the least core and the (pre)nuceolus and identified characterization sets for these solutions, i.e. families of coalitions that are sufficient to determine the given solution. We demonstrated that almost all of our results require the game to be balanced. We extended some known related results and established their counterparts by using the dual game.
As corollaries for the best-known special cases, we found that in a balanced game (N , v), the family of essential coalitions E (v) (whose value cannot be weakly majorized by a partition of N in the game v) is a characterization set for the standard least core, for the per-capita least core, and for the standard (pre)nucleolus (Theorems 1 and 3), but not for the per-capita (pre)nucleolus (Example 3). By analogous arguments, we showed that if the dual game (N , v * ) is anti-balanced, the family of dually essential coalitions E * (v * ) (whose value cannot be weakly minorized by a partition of N in the dual game v * ) is a characterization set for the standard least core, for the per-capita least core, for the standard (pre)nucleolus, and also for the per-capita (pre)nucleolus (Theorems 2 and 4).

Refinements
Based on the above summary of our results the following questions arise naturally: when, if at all, does the intersection of the families of essential and dually essential coalitions forms a characterization set for the standard least core, for the per-capita least core, and for the standard (pre)nucleolus?
First of all, let us specify what it means to combine the primal and dual reduced descriptions, since the first one is in terms of v but the second one is in terms of the dual game v * .
Suppose coalition S ⊆ N is dually inessential because of the partition S = S 1 ∪ · · · ∪ S k with k ≥ 2 weakly minorizes its value in the dual game, i.e.
Rewritten in terms of v, inequality (17) means Notice that coalitions N \S 1 , . . . , N \S k are all supersets of N \S, but each player in S belongs to exactly k − 1 of them. We call such a family of coalitions an antipartition of N \S, since it consists of the complements of the coalition in a partition of S. We say that the antipartition is weakly majorizing if inequality (18) holds. Summarizing, if coalition S is dually inessential then its complement N \S has a weakly majorizing antipartition. For the antipartition of N \S in (18) we clearly have Subtracting (18) from (19) gives Recall that if S is inessential because it has a weakly majorizing partition for the surpluses we also have and Huberman (1980) proved that in a balanced game all such coalitions can be ignored when we compute the standard (pre)nucleolus, and since computing the least core is the first step in the nucleolus procedure, also when we compute the standard least core. The structural identity of (20) and (22) explains why the complements of all dually inessential coalitions can be ignored when we compute the standard (pre)nucleolus and the standard least core from values of the balanced game v. Now we can turn to our highlighted question on the possibility of combining the two reduction possibilities. We say that the core of balanced game (N , v) is fulldimensional if dim Co(v) = |N | − 1, or equivalently, if N is the only tight coalition over the entire core. Solymosi and Sziklai (2016) proved (in terminology of this paper) that if the core of balanced game (N , v) is full-dimensional then all inessential coalitions and the complements of all dually inessential coalitions can be ignored when we compute the standard (pre)nucleolus and the standard least core from the values of v. For a better understanding of the key issues, we supplement that paper by the following example. We demonstrate that without full-dimensionality of the core we might need to keep some of the aforementioned (individually redundant) coalitions. Example 5 Consider the 4-player balanced superadditive game: Notice that the core is not full-dimensional. In fact, dim(Co(v)) = 1 since v(12) + v(34) = v(N ) as well as v(14) + v(23) = v(N ), thus x(12) = x(34) = x(14) = x(23) = 4 over the entire core.
The intersection E (v) ∩ F (v) = {12, 13, 14, 23, 34} of these two characterization sets, however, is not sufficient to determine the correct solutions. Indeed, if we run the standard algorithm (13) with Σ 0 = E (v) ∩ F (v) we get α 1 = 0, but the set of optimal solutions X 1 = {(y, 4 − y, y, 4 − y) : 1 ≤ y < ∞} is a halfline. Since we dropped all 3-player coalitions and coalition 24 as inessentials and also dropped all 1-player coalitions as complements of dually inessential coalitions, no constraint is left to guarantee nonnegativity for x 2 and x 4 . Thus, the intersection E (v)∩F (v) is not a characterization set for the standard least core and for the standard (pre)nucleolus.
Let us illustrate why this happens and why this can happen only when the core is not full-dimensional, see (Solymosi and Sziklai 2016) for a general proof. We dropped, for example, coalition 124 because it is weakly majorized by its partition v(12) + v(4) ≥ v(124). But we also dropped coalition 4 because it is weakly majorized by its antipartition v(124)+v(34)−v(N ) ≥ v(4). Since no other partition weakly majorizes coalition 124 and no other antipartition weakly majorizes coalition 4, we cannot leave them both out at the same time. Each one is redundant in the system because the other one is present. Notice that by combining the two weak majorizations we get v(4) (N ). Thus, the grand coalition is also weakly majorized, so N is not the only tight coalition over the entire core. Now let us see our combined reducibility question for the per-capita least core. Example 5 gives a negative answer here too, at least in case the core of the balanced game is not full-dimensional. Indeed, recall from Sect. 3 that for any weight function q, LC q (v) = Co(v) if and only if α 1 q (v) = 0, and observe that this holds whenever the core is not empty and not full-dimensional. On the other hand, one can show that if the core of balanced game v is full-dimensional then the intersection of the family E (v) of essential coalitions and the family F (v) of the complements of the dually essential coalitions is a characterization set for the per-capita least core, or more generally, for any weighted least core with an subadditive and monotone nondecreasing weight function.
We omit the details, but underline that the key for being able to combine the proofs of Theorem 1 and 2 (rewritten in terms of v) is also what Solymosi and Sziklai (2016) proved: if the core of the balanced game v is full-dimensional then for every inessential coalition there is a weakly majorizing partition in E (v) ∩ F (v) and for the complement of every dually inessential coalition there is a weakly majorizing antipartition in We conclude this section by highlighting from a different perspective what is the crucial difference between the standard and the per-capita solutions, why the analogous arguments work for the per-capita least core but fail to carry further for the per-capita (pre)nucleolus.
Take the weakly majorizing antipartition of coalition N \S in (18). If the weight function q is monotone nondecreasing, from (20) we get because all members of the antipartition are supersets of N \S and all q-surpluses are nonnegative in the core. This implies that all the terms on the left side are less than or equal to the q-surplus of N \S throughout algorithm (13), therefore N \S is redundant even for the q-(pre)nucleolus.
In comparison, take the weakly majorizing partition of S in (21). If the weight function q is subadditive, from (22) we can only derive that if, at x ∈ Co(v), coalition T 1 has the smallest q-surplus among the members of the partition. This inequality, however, might not hold for all q-surpluses in the partition. Consequently, although the inessential coalition S can be ignored in the first iteration of algorithm (13), but it could become important in later iterations. This explains, in particular, why inessential coalitions might be left out in the computation of the per-capita least core, but might not be dropped in the computation of the per-capita (pre)nucleolus.

Cost games
Naturally all our results carry over for cost games and their dual games, only the straightforward adjustments required by "the smaller, the better" nature of the outcomes must be made. To avoid duplications in terminology, we consider cost game c = v * as the dual game of its dual game v = c * that is a usual profit game we worked with so far. Hence we are interested in the anti-solutions of cost games. For illustration, we use the 5-player cost game set up by Suzuki and Nakayama (1976) to analyze the cost allocation problem related to a cooperative water development project in Japan. Interested in the (anti-)nucleolus allocation, the authors found that only one iteration in the ususal sequential LP optimization procedure was needed (already the least anti-core turned out to be a singleton), and concluded that the (anti-)nucleolus was fully determined by the family of the (n − 1 = 4)-player coalitions. This real life example also allows us to demonstrate that working with the dual game explicitly and applying the simplification possibilities in the dual descriptions might have some bite. Specifically, we will see that we can arrive at that same result "almost by inspection", moreover, from the gained "structural insight" we can readily conclude that in this particular cost game the per-capita (anti-)nucleolus coincides with the standard (anti-)nucleolus.
The 5-player cost game c analyzed by Suzuki and Nakayama (1976) and its dual game c * are as follows (for ease of presentation we multiplied each value by 10): Observe that above we just solved (based on Theorem 2 from a restricted set of constraints) the following optimization problem (the counterpart of (8)) for our antibalanced cost game c: with the standard weight function q(T ) = 1 for all T ∈ N , and found that the single-player coalitions determine the positive optimum value and the (unique) optimal solution. Since for any monotone decreasing weight function S ⊂ T implies q(N \S) ≥ q(N \T ), the importance of the inequalities related to the smaller coalitions could only increase among the constraints. Thus, in such cases the payoff vector in the optimal solution to (25) must be the same as in the standard case. In particular, we get that in the 5-player cost game of Suzuki and Nakayama (1976) the per-capita (anti-)nucleolus allocation is the same as the standard (anti-)nucleolus allocation.