Next Article in Journal
Learning from Failure and Success: The Challenges for Circular Economy Implementation in SMEs in an Emerging Economy
Previous Article in Journal
Is a Training Program Sufficient to Improve the Smallholder Farmers’ Productivity in Africa? Empirical Evidence from a Chinese Agricultural Technology Demonstration Center in Tanzania
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Sustainable Usability Distribution Mechanisms under Multi-Attribute Sports Management Schemes

1
Office of Physical Activities, National Pingtung University, Pingtung County 90003, Taiwan
2
Department of Applied Mathematics, National Pingtung University, Pingtung County 900391, Taiwan
*
Author to whom correspondence should be addressed.
Sustainability 2021, 13(3), 1528; https://doi.org/10.3390/su13031528
Submission received: 30 December 2020 / Revised: 26 January 2021 / Accepted: 26 January 2021 / Published: 1 February 2021
(This article belongs to the Section Economic and Business Aspects of Sustainability)

Abstract

:
Recently, game-theoretical methods have been adopted to analyze the reasonability of usability distribution mechanisms. On the other hand, sustainability has become a major conception among many fields by focusing on various influences that arose from environmental change, including usability distribution under multi-attribute sports management schemes. In many real-world situations, however, performers and its energy levels (strategies) should be essential factors simultaneously. Based on maximal-usability among energy level (strategy) vectors, we define an output, its efficacious extension and normalization to analyze usability distribution mechanisms under multi-attribute sports management schemes. We also adopt axiomatic processes to present the reasonability for these outputs. By considering reduced scheme and excess mapping, we adopt alternative formulation to offer dynamic processes for the efficacious extension and the normalization, respectively.

1. Introduction

Due to the constant renovation of the trend of real-world environmental change, distribution mechanisms of a combination of different theoretical fields, including sports usability distribution, have become a major conception in the context of sustainability. In the framework of sports usability distribution, the use of several notions could promote the distribution efficiency no matter for improvement of distribution methods or sports management techniques of usability. On the other hand, the axiomatic outcomes of game-theoretical distribution mechanisms could be always adopted to analyze various interaction relationships and related models among agents and coalitions by applying mathematical outcomes. In addition to theoretical analysis, game-theoretical outcomes also have been applied to offer optimal outcomes or equilibrium situations for many real-word models. Based on the demands for accounting, economics, management sciences and even sports sciences, some more power outputs are introduced as adequate mappings from weights and decision quota to power. The most extensively applied one is the Banzhaf–Coleman output. The Banzhaf–Coleman output, named after Banzhaf [1], is a power output proposed by the probability of changing a result of a vote where voting interests are not necessarily distributed equally among the voters. Plainly speaking, the Banzhaf–Coleman output is a distribution notion that collects each performer’s average marginal contribution from all participated coalitions. Several related outcomes may be found in, e.g., Banzhaf [1], Owen [2], Dubey and Shapley [3], Moulin [4], Lehrer [5], Haller [6] and van den Brink and van der Laan [7].
Under traditional schemes, each performer is either entirely participated or not participated at all in participation with other performers, while under a multi-choice scheme, each performer could be consented to take finite many different energy levels. It is known that outputs on multi-choice schemes could be performed under various issues such as economics, management sciences, sports sciences and so on. Hwang and Liao [8,9] and Liao [10] proposed several extensions of the max-reduced scheme and the complement-reduced scheme to characterize several core concepts in the context of multi-choice schemes. Later, Hwang and Liao [11] also considered an extended self-reduced scheme to analyze a multi-choice generalization of the Shapley value.
In different topics, from biomedical engineering, sciences to environment and the management sciences, performers confront an increasing demand to focus on multiple objectives effectively in its operational procedures. Related conditions include analyzing allocation tradeoffs, selecting optimal strategy or course designs or an arbitrary other situation where you need an effective rule with tradeoffs among several objectives. Under various cases, these real-world effective conditions might be modeled as a mathematical multi-attribute optimization status. The rules of such conditions require appropriate techniques to present optimal outcomes that—unlike traditional notions or viewpoints—apply several properties of the objectives into account.
Under the axiomatic processes for outputs under cooperative schemes, consonance is a crucial property of useful outputs. The notion behind this type of consonance is as follows: for a given scheme, performers might develop prospects of the scheme and may be willing to consent the computation of its remunerations to be based upon these prospects. The output concept is consonant if it gives the same remunerations to performers in the original scheme as it does to performers of the imaginary reduced scheme. Thus, consonance is a requisite of the inner “robustness" of compromises. In addition to axiomatic characterizations, dynamic processes can be represented that lead the performers to that output, commencing from an arbitrary efficacious remuneration vector. The main base of a dynamic notion was raised from Stearns [12].
The above-mentioned existing-outcomes generate one motivation:
  • whether the power (usability) outputs could be defined by simultaneously considering multi-choice behavior and multi-attribute situations.
Different from the contexts of traditional schemes and multi-choice schemes, we focus on the framework of multi-attribute multi-choice schemes throughout this paper.
  • In Section 2.1, the multi-consideration Banzhaf–Coleman output, the multi-consideration efficient Banzhaf–Coleman output and the multi-consideration normalized Banzhaf–Coleman output are further defined by adopting maximal-usability among multi-choice level vectors on multi-attribute multi-choice schemes.
  • In Section 2.1, some motivating and practical examples are provided to present related applications for sports management.
  • By applying an extended reduction, we propose some axiomatic processes to present the reasonability for these outputs in Section 3. In order to analyze the dynamic processes of these outputs, we adopt alternative formulations for these outputs in terms of excess mappings.
  • In Section 4, specific reductions and excess mapping are applied to present that these outputs can be reached by performers who commence from an arbitrary efficacious remuneration vector.

2. Preliminaries

2.1. Definitions and Notations

Let U V be the universe of performers and P U V be a set of performers. Let e = ( e p ) p P with e p N be the vector that shows the amount of energy levels for each performer, at which it can operate. For p U V , we define E p = { 0 , 1 , , e p } to be the level repository of performer p, where 0 means not acting, and E p + = E p \ { 0 } . For P U V , P , let E P = p P E p be the product set of the level repositories for performers in P. For every K P , we define σ K E P as the vector with σ p K = 1 if p K , and σ p K = 0 if p P \ K . Denote 0 P to be the zero vector in R P . For m N , let Γ m = { 1 , , m } .
A multi-choice scheme is denoted by ( P , e , h ) , where P is a finite collection of performers, e = ( e p ) p P E P is the vector that appears the amount of energy levels for each performer and h : E P R is a map which apportions to each ω = ( ω p ) p P E P the usability that the performers can accept when each performer p takes energy level ω p E p with h ( 0 P ) = 0 . A scheme ( P , e , h ) will be denoted by the map h if there is no confusion. Given a multi-choice scheme ( P , e , h ) and ω E P , we denote ( P , ω , h ) to be the multi-choice subscheme defined by restricting h to { χ E P χ p ω p p P } . A multi-attribute multi-choice scheme is a triple ( P , e , H m ) , where m N , H m = ( h t ) t Γ m and ( P , e , h t ) is a multi-choice scheme for every t Γ m . Let Δ be the collection of all multi-attribute multi-choice schemes.
Given ( P , e , h ) Δ and ω R P , we define that S ( ω ) = { p P | ω p 0 } and ω K to be the restriction of ω at K for each K P . Further, we define h ( K ) = max ω E P { h ( ω ) | S ( ω ) = K } to be the maximal-usability (Here we apply bounded multi-choice schemes, defined as ( P , e , h ) such that, there exists E h R such that h ( ω ) E h for every ω E P . We apply it to guarantee that h ( K ) is well-defined.) among all vectors ω with S ( ω ) = K . A remuneration vector of ( P , e , H m ) Δ is a vector x = ( x t ) t Γ m and x t = ( x p t ) p P R P , where x p t denotes the remuneration to performer p in ( P , e , h t ) for every t Γ m and for every p P . A remuneration vector x of ( P , e , H m ) is multi-attribute efficacious if p P x p t = h t P for every t Γ m . The collection of all multi-attribute efficacious vectors of ( P , e , H m ) is denoted by M E ( P , e , H m ) .
An output is a map ρ apportioning to each ( P , e , H m ) Δ , an element
ρ P , e , H m = ρ t P , e , H m t Γ m ,
where ρ t P , e , H m = ρ p t P , e , H m p P R P and ρ p t P , e , H m is the remuneration of the performer p apportioned by ρ in P , e , h t .
Next, we introduce three outputs under the multi-attribute multi-choice situation.
Definition 1.
The multi-consideration Banzhaf–Coleman output (MBCO), Θ, is defined to be for every ( P , e , H m ) Δ , for every t Γ m and for every p P ,
Θ p t ( P , e , H m ) = 1 2 | P | 1 p S S P h t ( S ) h t ( S \ { p } ) .
Under the output Θ, all performers receive an average marginal contribution of maximal-usability in each S P .
An output ρ conforms multi-attribute efficacy (MEIY) if for every ( P , e , H m ) Δ and for every t Γ m , p P ρ p ( P , e , H m ) = h t ( P ) . MEIY presents that all performers completely allocate all the usability. Clearly, the MBCO violates MEIY. In the following, we consider an efficacious extension and an normalization.
Definition 2.
  • The multi-consideration efficacious Banzhaf–Coleman output (MEBCO), Θ ¯ , is defined for every ( P , e , H m ) Δ , for every t Γ m and for every p P ,
    Θ p t ¯ ( P , e , H m ) = Θ p t ( P , e , H m ) + 1 | P | · h t ( P ) k P Θ k t ( P , e , H m ) .
    Under the output Θ ¯ , all performers first receive its MBCO, and further allocate the remaining usability equally.
  • The multi-consideration normalized Banzhaf–Coleman output (MNBCO), Φ ¯ , is defined for every ( P , e , H m ) Δ , for every t Γ m and for every p P ,
    Φ p t ¯ ( P , e , H m ) = h t ( P ) k P Θ k t ( P , e , H m ) · Θ p t ( P , e , H m ) ,
    where Δ = { ( P , e , H m ) Δ | p P Θ p t ( P , e , H m ) 0 f o r   e v e r y   t Γ m } . Under the notion of Φ ¯ , all performers allocate the maximal-usability of the grand coalition proportionally by applying the MBCO of all performers.
Lemma 1.
The MEBCO and the MNBCO conform MEIY on Δ and Δ , respectively.
Proof. 
For every ( P , e , H m ) Δ and for every t Γ m ,
p P Θ p t ¯ ( P , e , H m ) = p P Θ p t ( P , e , H m ) + 1 | P | · h t ( P ) k P Θ k t ( P , e , H m ) = p P Θ p t ( P , e , H m ) + | P | | P | · h t ( P ) k P Θ k t ( P , e , H m ) = p P Θ p t ( P , e , H m ) + h t ( P ) k P Θ k t ( P , e , H m ) = h t ( P ) .
Thus, the MEBCO conforms MEIY on Δ . For every ( P , e , H m ) Δ and for every t Γ m ,
p P Φ p t ¯ ( P , e , H m ) = p P h t ( P ) k P Θ k t ( P , e , H m ) · Θ p t ( P , e , H m ) = h t ( P ) k P Θ k t ( P , e , H m ) · p P Θ p t ( P , e , H m ) = h t ( P ) .
Thus, the MNBCO conforms MEIY on Δ . □

2.2. Motivating and Practical Examples

As we mentioned in the introduction, each performer might be allowed to participate with different levels in real situations respectively. On the other hand, multi-attribute analysis is a notion of multiple criterion analysis that is concerned with situations involving simultaneously more than one objective to be optimized. Multi-attribute analysis has been adopted in many issues, including biomedical engineering, economics, politics, sports management sciences, logistics, where efficacious decisions need to be adopted in the presence of trade-offs among several objectives. For instance, minimizing cost while maximizing comfort while marketing a central air conditioning system, and maximizing efficacy whilst minimizing energy consumption and emission of pollutants are examples of multi-attribute efficacious problems involving respectively two and three objectives. Under various cases, there might be more than three objectives. Hence, we focus on the framework of multi-attribute multi-choice schemes throughout this paper. The advantages of our methods are that these outputs of the multi-attribute multi-choice scheme always exist and result in a kind of global outcome for a specific performer by summarizing the result under all its energy levels.
Here we provide a brief motivating example of multi-choice schemes in the setting of “sports management”. Let P = { 1 , 2 , , p } be a set of all performers of a sports management system ( P , e , h ) . The function h could be treated as a usability function which assigns to each level vector α = ( α p ) p P E P the worth that the performers can obtain when each performer p participates at operation strategy α p E p in ( P , e , h ) . Modeled in this way, the sports management system ( P , e , h ) could be considered as a multi-choice scheme, with h being each characteristic function and E p being the set of all operation strategies of the performer p.
In the following, we also provide a practical application of power distribution in a sports association, such as NBA, MLB and so on. Let P = { 1 , 2 , , p } be a set of all performers of a sports association. In the sports association, all the performers are elected by voting or recommendation by sports parties (or teams). All performers have the power to propose, discuss, establish and veto all bills (or rules). They dedicate different levels of attention and participation to different bills depending on their academic expertise and the public opinion they represent. The level of involvement is also closely associated with the alliance strategy formed for the interests of different sports parties. For the aforementioned reasons, strategies adopted by each performer of the parliament show distinct levels of participation and certain amounts of ambiguity. The function h could be treated as a power function which assigns to each level vector α = ( α p ) p P E P the power that the performers can dedicate when each performer p participates at operation strategy α p E p . Modeled in this way, the sports association operational system ( P , e , h ) could be considered as a multi-choice scheme, with h being each characteristic function and E p being the set of all operation strategies of the performer p. To evaluate the influence of each performer in the sports association, using the power indicators we proposed, we first assess the influence each sports association performer has arisen over previous bill meetings based on various strategies, which are the outputs mentioned in Definitions 1 and 2.
Here we provide an application with real data as follows. Let ( P , e , H m ) Δ with P = { i , j , k } , m = 2 and e = ( 2 , 1 , 1 ) . Thus, ( P , e , H m ) = ( P , e , h 1 ) , ( P , e , h 1 ) . Further, let h 1 ( 2 , 1 , 1 ) = 5 , h 1 ( 1 , 1 , 1 ) = 7 , h 1 ( 2 , 1 , 0 ) = 3 , h 1 ( 2 , 0 , 1 ) = 2 , h 1 ( 2 , 0 , 0 ) = 9 , h 1 ( 1 , 1 , 0 ) = 3 , h 1 ( 1 , 0 , 1 ) = 4 , h 1 ( 0 , 1 , 1 ) = 5 , h 1 ( 1 , 0 , 0 ) = 1 , h 1 ( 0 , 1 , 0 ) = 2 , h 1 ( 0 , 0 , 1 ) = 3 , h 2 ( 2 , 1 , 1 ) = 9 , h 2 ( 1 , 1 , 1 ) = 5 , h 2 ( 2 , 1 , 0 ) = 7 , h 2 ( 2 , 0 , 1 ) = 3 , h 2 ( 2 , 0 , 0 ) = 2 , h 2 ( 1 , 1 , 0 ) = 9 , h 2 ( 1 , 0 , 1 ) = 3 , h 2 ( 0 , 1 , 1 ) = 4 , h 2 ( 1 , 0 , 0 ) = 5 , h 2 ( 0 , 1 , 0 ) = 2 , h 2 ( 0 , 0 , 1 ) = 5 and h 1 ( 0 , 0 , 0 ) = 0 = h 2 ( 0 , 0 , 0 ) . Therefore, we have that h 1 ( { i , j , k } ) = 7 , h 1 ( { i , j } ) = 3 , h 1 ( { i , k } ) = 2 , h 1 ( { j , k } ) = 5 , h 1 ( { i } ) = 9 , h 1 ( { j } ) = 2 , h 1 ( { k } ) = 3 , h 2 ( { i , j , k } ) = 9 , h 2 ( { i , j } ) = 9 , h 2 ( { i , k } ) = 3 , h 2 ( { j , k } ) = 4 , h 2 ( { i } ) = 5 , h 2 ( { j } ) = 2 , h 2 ( { k } ) = 5 and h 1 ( ) = 0 = h 2 ( ) . By Definitions 1 and 2,
Θ i 1 ( P , e , H m ) = 18 4 , Θ j 1 ( P , e , H m ) = 15 4 , Θ k 1 ( P , e , H m ) = 2 4 , Θ i 1 ¯ ( P , e , H m ) = 55 12 , Θ j 1 ¯ ( P , e , H m ) = 46 12 , Θ k 1 ¯ ( P , e , H m ) = 5 12 , Φ i 1 ¯ ( P , e , H m ) = 144 31 , Φ j 1 ¯ ( P , e , H m ) = 120 31 , Φ k 1 ¯ ( P , e , H m ) = 16 31 , Θ i 2 ( P , e , H m ) = 27 4 , Θ j 2 ( P , e , H m ) = 0 , Θ k 2 ( P , e , H m ) = 3 4 , Θ i 2 ¯ ( P , e , H m ) = 31 4 , Θ j 2 ¯ ( P , e , H m ) = 1 , Θ k 2 ¯ ( P , e , H m ) = 1 4 , Φ i 2 ¯ ( P , e , H m ) = 81 8 , Φ j 2 ¯ ( P , e , H m ) = 0 , Φ k 2 ¯ ( P , e , H m ) = 9 8 .
In the following sections, we would like to demonstrate that the MBCO, the MEBCO and the MNBCO could present “optimal distribution mechanisms” among all performers, in the sense that this organization can receive remuneration from each combination of operational levels of all performers under multi-choice behavior and multi-attribute situations.

3. Axiomatic Outcomes

Here, we demonstrate that there exists corresponding reduced schemes that could be applied to axiomatize the MBCO, the MEBCO and the MNBCO.
Let ρ be an output, ( P , e , H m ) Δ and S P . The 1-reduced scheme ( S , e S , H S , ρ 1 , m ) is defined by H S , ρ 1 , m = ( h S , ρ 1 , t ) t Γ m and
h S , ρ 1 , t ( ω ) = 0 , ω = 0 S , 1 2 | P \ S | Q P \ S [ max τ E Q { h ω , τ , 0 P \ { S Q } | S ( τ ) = Q } p Q ρ p ( P , e , h ) ] , otherwise
for every ω E S . An output ρ conforms 1-consonance (1CSE) if ρ p t ( S , e S , H S , ρ 1 , m ) = ρ p t ( P , e , H m ) for every ( P , e , H m ) Δ , for every S P with | S | = 2 , for every t Γ m and for every p S . Further, ρ conforms 1-criterion for schemes (1CS) if ρ ( P , e , H m ) = Θ ( P , e , H m ) for every ( P , e , H m ) Δ with | P | 2 . In the following, we characterize the MBCO by adopting 1CSE and 1CS.
Lemma 2.
1.
The MBCO conforms 1CSE on Δ.
2.
On Δ, the MBCO is the only output conforming 1CS and 1CSE.
Proof. 
To demonstrate result 1, let ( P , e , H m ) Δ and S P . The proof is finished if | P | = 1 . Suppose that | P | 2 and S = { p , q } for some p , q P , for every t Γ m and for every p S ,
Θ p t ( S , e S , H S , Θ 1 , m ) = 1 2 | S | 1 · p T T S ( h S , Θ 1 , t ) ( T ) ( h S , Θ 1 , t ) ( T \ { p } ) = 1 2 | S | 1 · 2 | P \ S | · p T T S Q P \ S h t ( T Q ) h t ( T \ { p } Q ) = 1 2 | P | 1 · p K K P h ( K ) h ( K \ { p } ) = Θ p t ( P , e , H m ) .
Hence, Θ conforms 1CSE.
By result 1, Θ conforms 1CSE on Δ . Clearly, Θ conforms 1CS on Δ . To demonstrate uniqueness of result 2, suppose that ρ conforms 1CS and 1CSE. Let ( P , e , h ) Δ . If | P | 2 , then ρ ( P , e , h ) = Θ ( P , e , h ) by 1CS. The condition | P | > 2 : Let p P and t Γ m , and let S P with | S | = 2 and p S . Therefore,
ρ p t ( P , e , H m ) = ρ p t ( S , e S , H S , ρ 1 , m ) ( by   1 CSE ) = Θ p t ( S , e S , H S , ρ 1 , m ) ( by   1 CS ) = 1 2 | S | 1 · p T T S ( h S , ρ 1 , t ) ( T ) ( h S , ρ 1 , t ) ( T \ { p } ) = 1 2 | S | 1 · 2 | P \ S | p T T S Q P \ S [ h t ( T Q ) h t ( T \ { p } ) Q ] = 1 2 | P | 1 · p K K P h t ( K ) h t ( K \ { p } ) = Θ p t ( P , e , H m ) .
Thus, ρ ( P , e , H m ) = Θ ( P , e , H m ) . □
In the following we take some examples to manifest that each of the properties applied in Lemma 2 are independent of the rest of properties.
Example 1.
Consider an output ρ by for every ( P , e , H m ) Δ , for every t Γ m and for every p P , ρ p t ( P , e , H m ) = 0 . Clearly, ρ conforms 1CSE, but it does not conform 1CS.
Example 2.
Consider an output ρ for every ( P , e , H m ) Δ , for every t Γ m and for every p P ,
ρ p t ( P , e , H m ) = Θ p t ( P , e , H m ) i f | P | 2 , 0 o t h e r w i s e .
On Δ, ρ conforms 1CS, but it does not conform 1CSE.
It is easy to demonstrate that the output Θ ¯ and Φ ¯ violates 1CSE. In the following, we consider the 2-reduced scheme. Let ρ be an output, ( P , e , H m ) Δ and S P . The 2-reduced scheme ( S , e S , H S , ρ 2 , m ) is defined by H S , ρ 2 , m = ( h S , ρ 2 , t ) t Γ m and
h S , ρ 2 , t ( ω ) = 0 , ω = 0 S , max τ E P \ S { h ( ω , τ ) | S ( τ ) = P \ S } p P \ S ρ p ( P , e , h ) , S ( ω ) = S , 1 2 | P \ S | Q P \ S [ max τ E Q { h ω , τ , 0 P \ { S Q } | S ( τ ) = Q } p Q ρ p ( P , e , h ) ] , otherwise
for every ω E S . An output ρ conforms 2-consonance (2CSE) if ρ p t ( S , e S , H S , ρ 2 , m ) = ρ p t ( P , e , H m ) for every ( P , e , H m ) Δ , for every S P with | S | = 2 , for every t Γ m and for every p S . Furthermore, ρ conforms 2-criterion for schemes (2CS) if ρ ( P , e , H m ) = Θ ¯ ( P , e , H m ) for every ( P , e , H m ) Δ with | P | 2 .
Clearly, ( S , e S , H S , ρ m ) does not exist if p S Θ p t ( P , e , H m ) = 0 . Thus, we consider the 3-consonance as follows. An output ρ conforms 3-consonance (3CSE) if ( S , e S , H S , ρ m ) Δ for some ( P , e , H m ) Δ and for some S P with | S | = 2 , it holds that ρ p t ( S , e S , H S , ρ m ) = ρ p t ( P , e , H m ) for every t Γ m and for every p S . Further, ρ conforms 3-criterion for schemes (3CS) if ρ ( P , e , H m ) = Φ ¯ ( P , e , H m ) for every ( P , e , H m ) Δ with | P | 2 .
Subsequently, we characterize the MEBCO and the MNBCO by respectively adopting 2CSE, 3CSE, 2CS and 3CS. In order to establish consonance of the MEBCO and the MNBCO, it will be useful to introduce alternative formulation for the MEBCO and the MNBCO in terms of excess. Let ( P , e , H m ) Δ , S P and x be a remuneration vector in ( P , e , H m ) . Define that x t ( S ) = p S x p t for every t Γ m . The excess of a coalition S P at x is considered to be
E x ( S , H m , x ) = ( E x ( S , h t , x t ) ) t Γ m a n d   E x ( S , h t , x t ) = h t ( S ) x t ( S ) .
The value E x ( S , h t , x t ) can be regarded as the complaint of coalition S when all performers in S receive its remunerations from x t in ( P , e , h t ) .
Lemma 3.
For every ( P , e , H m ) Δ , for every x M E ( P , e , H m ) , for every p , q P and for every t Γ m ,
S P \ { p , q } E x ( S { p } , h t , x t ) = S P \ { p , q } E x ( S { q } , h t , x t ) x = Θ ¯ ( P , e , H m ) .
Proof. 
Let ( P , e , H m ) Δ and x M E ( P , e , H m ) . For every t Γ m and for every p , q P ,
S P \ { p , q } E x ( S { p } , h t , x t ) = S P \ { p , q } E x ( S { q } , h t , x t ) S P \ { p , q } h t ( S { i } ) x t ( S { i } ) = S P \ { p , q } h t ( S { j } ) x t ( S { j } ) S P \ { p , q } h t ( S { i } ) 2 | P | 2 · x p t = S P \ { p , q } h t ( S { j } ) 2 | P | 2 · x q t x p t x q t = 1 2 | P | 2 · S P \ { p , q } h t ( S { i } ) h t ( S { j } ) .
By definition of Θ ¯ ,
Θ p t ¯ ( P , e , H m ) Θ q t ¯ ( P , e , H m ) = 1 2 | P | 2 · S P \ { p , q } h t ( S { p } ) h t ( S { q } ) .
By Equations (2) and (3), for every p , q P ,
x p t x q t = Θ p t ¯ ( P , e , H m ) Θ q t ¯ ( P , e , H m ) .
Hence,
q P x p t x q t = q P Θ p t ¯ ( P , e , H m ) Θ q t ¯ ( P , e , H m ) .
That is, | P | · x p t q P x q t = | P | · Θ p t ¯ ( P , e , H m ) q P Θ q t ¯ ( P , e , H m ) . Since x M E ( P , e , H m ) and Θ ¯ conforms MEIY, | P | · x p t h t ( P ) = | P | · Θ p t ¯ ( P , e , H m ) h t ( P ) . Hence, x p t = Θ p t ¯ ( P , e , H m ) for every t Γ m and for every p P , i.e., x = Θ ¯ ( P , e , H m ) . □
Remark 1.
Clearly,
S P \ { p , q } E x ( S \ { p } , H m , Θ ( P , e , H m ) ) = S P \ { p , q } E x ( S \ { q } , H m , Θ ( P , e , H m ) )
for every ( P , e , H m ) Δ and for every p , q P .
Theorem 1.
1.
The MEBCO conforms 2CSE on Δ.
2.
If ρ conforms 2CS and 2CSE, then it also conforms MEIY.
3.
On Δ, the MEBCO is the only output conforming 2CS and 2CSE.
Proof. 
To demonstrate result 1, let ( P , e , H m ) Δ and S P . The proof is finished if | P | = 1 . Suppose that | P | 2 , x = Θ ¯ ( P , e , H m ) and S = { p , q } for some p , q P . For every t Γ m and for every l S ,
E x { l } , h S , x 2 , t , x S t = h S , x 2 , t ( { l } ) x l t = 1 2 | P \ S | · Q P \ S h t ( { l } Q ) k Q x k t x l t = 1 2 | P \ S | · Q P \ S h t ( { l } Q ) k Q x k t x l t = 1 2 | P \ S | · Q P \ S h t { l } Q k { l } Q x k t = 1 2 | P \ S | · Q P \ { p , q } E x Q { l } , h t , x t .
Since Θ ¯ conforms MEIY, x S t E x ( S , e S , h S , x 2 , t ) by definition of 2-reduced scheme. Further, by Lemma 3 and Equation (4),
E x { p } , h S , x 2 , t , x S t = 1 2 | P \ S | · Q P \ { p , q } E x Q { p } , h t , x t ( by   Equation   ( 4 ) ) = 1 2 | P \ S | · Q P \ { p , q } E x Q { q } , h t , x t ( by   Lema   3 ) = E x { q } , h S , x 2 , t , x S t . ( by   Equation   ( 4 ) )
Therefore, x S = Θ ¯ ( S , e S , h S , Θ ¯ 2 , m ) . That is, Θ ¯ conforms 2CSE.
To demonstrate result 2, suppose ρ conforms 2CS and 2CSE. Let ( P , e , H m ) Δ and t Γ m . By 2CS, ρ conforms MEIY if | P | 2 . The condition | P | > 2 : Suppose, on the contrary, that there exists ( P , e , H m ) Δ such that p P ρ p t ( P , e , H m ) h t ( P ) . This presents that there exists p P and q P such that [ h t ( P ) k P \ { p , q } ρ k t ( P , e , H m ) ] [ ρ p t ( P , e , H m ) + ρ q t ( P , e , H m ) ] . By 2CSE, ρ conforms MEIY for two-person schemes and this contradicts with
ρ p t ( P , e , H m ) + ρ q t ( P , e , H m ) = ρ p t ( { p , q } , e { p , q } , h { p , q } , ρ 2 , t ) + ρ q t ( { p , q } , e { p , q } , h { p , q } , ρ 2 , t ) = h t ( P ) k P \ { p , q } ρ k t ( P , e , H m ) .
Hence, ρ conforms MEIY.
To demonstrate result 3, Θ ¯ conforms 2CSE by result 1. Clearly, Θ ¯ conforms 2CS. To demonstrate uniqueness, suppose ρ conforms 2CS and 2CSE; hence, by result 2, ρ also conforms MEIY. Let ( P , e , H m ) Δ . By 2CS, ρ ( P , e , H m ) = Θ ¯ ( P , e , H m ) if | P | 2 . The condition | P | > 2 : Let p P , t Γ m and S = { p , q } for some q P \ { p } . Then,
ρ p t ( P , e , H m ) Θ p t ¯ ( P , e , H m ) = ρ p t ( S , e S , h S , ρ 2 , m ) Θ p t ¯ ( S , e S , h S , Θ ¯ 2 , m ) ( by   2 CSE   of   ρ , Θ ¯ ) = Θ p t ¯ ( S , e S , h S , ρ 2 , m ) Θ p t ¯ ( S , e S , h S , Θ ¯ 2 , m ) ( by   2 CS   of   ρ , Θ ¯ ) = 1 2 · ( h S , ρ 2 , t ) ( S ) + ( h S , ρ 2 , t ) ( { p } ) ( h S , ρ 2 , t ) ( { q } ) 1 2 · ( h S , Θ ¯ 2 , t ) ( S ) + ( h S , Θ ¯ 2 , t ) ( { p } ) ( h S , Θ ¯ 2 , t ) ( { q } ) .
By definitions of h S , ρ 2 , t and h S , Θ ¯ 2 , t ,
( h S , ρ 2 , t ) ( { p } ) ( h S , ρ 2 , t ) ( { q } ) = 1 2 | P \ S | · Q P \ S h t ( { p } Q ) h t ( { q } Q ) = ( h S , Θ ¯ 2 , t ) ( { p } ) ( h S , Θ ¯ 2 , t ) ( { q } ) .
By Equation (6), Equation (5) becomes
ρ p t ( P , e , H m ) Θ p t ¯ ( P , e , H m ) = 1 2 · ( h S , ρ 2 , t ) ( S ) ( h S , Θ t ¯ 2 , t ) ( S ) = 1 2 · ρ p t ( P , e , H m ) + ρ q t ( P , e , H m ) Θ p t ¯ ( P , e , H m ) + Θ q t ¯ ( P , e , H m ) .
That is, for every p , q P ,
ρ p t ( P , e , H m ) ρ q t ( P , e , H m ) = Θ p t ¯ ( P , e , H m ) Θ q t ¯ ( P , e , H m ) .
By MEIY of ρ and Θ ¯ ,
| P | · ρ p t ( P , e , H m ) h t ( P ) = | P | · Θ p t ¯ ( P , e , H m ) h t ( P ) .
Thus, ρ p t ( P , e , H m ) = Θ p t ¯ ( P , e , H m ) for every p P , i.e., ρ ( P , e , H m ) = Θ ¯ ( P , e , H m ) . □
In the following we take some examples to show that each of the properties applied in Theorem 1 are independent of the rest of properties.
Example 3.
Consider an output ρ for every ( P , e , H m ) Δ , for every t Γ m and for every p P , ρ p t ( P , e , H m ) = 0 . Clearly, ρ conforms 2CSE, but it does not conform 2CS.
Example 4.
Consider an output ρ for every ( P , e , H m ) Δ , for every t Γ m and for every p P ,
ρ p t ( P , e , H m ) = Θ p t ¯ ( P , e , H m ) i f | P | 2 , 0 o t h e r w i s e .
On Δ, ρ conforms 2CS, but it does not conform 2CSE.
Lemma 4.
Let ( P , e , H m ) Δ and x M E ( P , e , H m ) . Then, for every p , q P and t Γ m ,
S P \ { p , q } E x ( S { p } , h t , x t a t ) = S P \ { p , q } E x ( S { q } , h t , x t a t ) x = Φ ¯ ( P , e , H m ) ,
where a t = h t ( P ) k P Θ k t ( P , e , H m ) .
Proof. 
Let ( P , e , H m ) Δ and x M E ( P , e , H m ) . For every p , q P and t Γ m ,
S P \ { p , q } E x ( S { p } , h t , x t a t ) = S P \ { p , q } E x ( S { q } , h t , x t a t ) S P \ { p , q } h t ( S { p } ) x t ( S { p } ) a t = S P \ { p , q } h t ( S { q } ) x t ( S { q } ) a t S P \ { p , q } h t ( S { p } ) 2 | P | 2 · x p t a t = S P \ { p , q } h t ( S { q } ) 2 | P | 2 · x q t a t x p t x q t = a t 2 | P | 2 · S P \ { p , q } h t ( S { p } ) h t ( S { q } ) .
By definition of Φ ¯ ,
Φ p t ¯ ( P , e , H m ) Φ q t ¯ ( P , e , H m ) = a t 2 | P | 2 · S P \ { p , q } h t ( S { p } ) h t ( S { q } )
By Equations (7) and (8), for every pair { p , q } P and t Γ m ,
x p t x q t = Φ p t ¯ ( P , e , H m ) Φ q t ¯ ( P , e , H m ) .
Hence,
q p x p t x q t = q p Φ p t ¯ ( P , e , H m ) Φ q t ¯ ( P , e , H m ) .
That is, | P | 1 · x p t q p x q t = | P | 1 · Φ p t ¯ ( P , e , H m ) q p Φ q t ¯ ( P , e , H m ) . Since x M E ( P , e , H m ) and Φ ¯ conforms MEIY, | P | · x p t h t ( P ) = | P | · Φ p t ¯ ( P , e , H m ) h t ( P ) . Hence, x p t = Φ p t ¯ ( P , e , H m ) for every ( P , e , H m ) Δ , for every p P and for every t Γ m . □
Theorem 2.
1.
The MNBCO conforms 3CSE on Δ .
2.
If ρ conforms 3CS and 3CSE, then it also conforms MEIY.
3.
On Δ , the MNBCO is the only output conforming 3CS and 3CSE.
Proof. 
The proofs of outcomes 1 and 2 are similar to the proofs of outcomes 1 and 2 of Theorem 1, so we omit them. Next, we demonstrate result 3. By result 1, the MNBCO conforms 3CSE. Clearly, the MNBCO conforms 3CS. To demonstrate uniqueness, suppose ρ conforms 3CSE and 3CS on Δ . By result 2, ρ conforms MEIY on Δ . Let ( P , e , H m ) Δ . The proof could be finished by induction on | P | . By 3CS, it is trivial that ρ ( P , e , H m ) = Θ ¯ ( P , e , H m ) if | P | 2 . Suppose that it holds if | P | l 1 , l 3 . The condition | P | = l : Let p , q P with p q and t Γ m . By Definition 2, Φ k t ¯ ( P , e , H m ) = h t ( P ) h P Φ h t ( P , e , H m ) · Φ k t ( P , e , H m ) for every k P . Assume that ω k t = Φ k t ( P , e , H m ) h P Φ h t ( P , e , H m ) for every k P and for every t Γ m . Therefore,
ρ p t ( P , e , H m ) = ρ p t P \ { q } , e P \ { q } , h P \ { q } , ρ 2 , t ( by   3 CSE   of   ρ ) = Φ p t ¯ P \ { q } , e P \ { q } , h P \ { q } , ρ 2 , t ( by   3 CS   of   ρ ) = h P \ { q } , ρ 2 , t P \ { q } k P \ { q } Φ k t P \ { q } , e P \ { q } , h P \ { q } , ρ 2 , t · Φ p t P \ { q } , e P \ { q } , h P \ { q } , ρ 2 , t = h t ( P ) ρ p t ( P , e , H m ) k P \ { q } Φ k t ( P , e , H m ) · Φ p t ( P , e , H m ) ( by   Equation   ( 8 ) ) = h t ( P ) ρ p t ( P , e , H m ) Φ q t ( P , e , H m ) + k P Φ k t ( P , e , H m ) · Φ p t ( P , e , H m ) .
By Equation (9),
ρ p t ( P , e , H m ) · [ 1 ω q t ] = [ h t ( P ) ρ q t ( P , e , H m ) ] · ω q t p P ρ p t ( P , e , H m ) · [ 1 ω q t ] = [ h t ( P ) ρ q t ( P , e , H m ) ] · p P ω q t h t ( P ) · [ 1 ω q t ] = [ h t ( P ) ρ q t ( P , e , H m ) ] · 1 ( by   MEIY   of   ρ ) h t ( P ) h t ( P ) · ω q t = h t ( P ) ρ q t ( P , e , H m ) Φ q t ¯ ( P , e , H m ) = ρ q t ( P , e , H m ) .
The proof is finished. □
In the following we take some examples to manifest that each of the properties applied in Theorem 1 are independent of the rest of the properties.
Example 5.
Consider an output ρ by for every ( P , e , H m ) Δ , for every t Γ m and for every p P , ρ p t ( P , e , H m ) = 0 . On Δ , ρ conforms 3CSE, but it does not conform 3CS.
Example 6.
Consider an output ρ by for every ( P , e , H m ) Δ , for every t Γ m and for every p P ,
ρ p t ( P , e , H m ) = Φ p t ¯ ( P , e , H m ) i f | P | 2 , 0 o t h e r w i s e .
On Δ , ρ conforms 3CS, but it does not conform 3CSE.

4. Dynamic Processes

Here, we adopt excess mappings and reductions to offer dynamic outcomes for the MEBCO and the MNBCO.
In order to present the dynamic processes of the MEBCO and the MNBCO, we firstly define switch mappings by means of excess mappings. The switch mappings are based on the notion that each performer shortens the complaint relating to its own and others’ non-participation, and uses these regulations to revise the original remuneration. In the following, we firstly introduce the dynamic processes for the MEBCO.
Definition 3.
Let ( P , e , H m ) Δ and p P . Theswitch mappingis considered to be f = ( f t ) t Γ m , where f t = ( f p t ) p P and f p t : M E ( P , e , H m ) R is defined by
f p t ( x ) = x p t + α q P \ { p } 1 2 | P | 2 Q P \ { p , q } E x ( Q \ { q } , h t , x t ) E x ( Q \ { p } , h t , x t )
Define [ x ] 0 = x , [ x ] 1 = f ( [ x ] 0 ) , , [ x ] n = f ( [ x ] n 1 ) for every n N .
Lemma 5.
f ( x ) M E ( P , e , H m ) for every ( P , e , H m ) Δ and for every x M E ( P , e , H m ) .
Proof. 
Let ( P , e , H m ) Δ , t Γ m , p , q P and x M E ( P , e , H m ) . Similar to Equation (2),
q P \ { p } 1 2 | P | 2 Q P \ { p , q } E x ( Q \ { q } , h t , x t ) E x ( Q \ { p } , h t , x t ) = q P \ { p } 1 2 | P | 2 Q P \ { p , q } h t ( Q \ { q } ) h t ( Q \ { p } ) x p t + x q t .
By definition of Θ ¯ ,
Θ p t ¯ ( P , e , H m ) Θ q t ¯ ( P , e , H m ) = 1 2 | P | 2 Q P \ { p , q } h t ( Q \ { q } ) h t ( Q \ { p } ) .
By Equations (10) and (11),
q P \ { p } 1 2 | P | 2 Q P \ { p , q } E x ( Q \ { q } , h t , x t ) E x ( Q \ { p } , h t , x t ) = q P \ { p } Θ p t ¯ ( P , e , H m ) Θ q t ¯ ( P , e , H m ) x p t + x q t = ( | P | 1 ) Θ p t ¯ ( P , e , H m ) x p t q P \ { p } Θ q t ¯ ( P , e , H m ) + q P \ { p } x q t = | P | Θ p t ¯ ( P , e , H m ) x p t h t ( P ) + h t ( P ) by   MEIY   of Θ ¯ , x M E ( P , e , H m ) = | P | · Θ p t ¯ ( P , e , H m ) x p t .
Moreover,
p P q P \ { p } 1 2 | P | 2 Q P \ { p , q } E x ( Q \ { q } , h t , x t ) E x ( Q \ { p } , h t , x t ) = p P | P | · Θ p t ¯ ( P , e , H m ) x p t = | P | · p P Θ p t ¯ ( P , e , H m ) p P x p t = | P | · h t ( P ) h t ( P ) by   MEIY   of Θ ¯ , x M E ( P , e , H m ) = 0 .
Therefore, we have that
p P f p t ( x ) = p P x p t + α q P \ { p } 1 2 | P | 2 Q P \ { p , q } E x ( Q \ { q } , h t , x t ) E x ( Q \ { p } , h t , x t ) = p P x p t + α p P q P \ { p } 1 2 | P | 2 Q P \ { p , q } E x ( Q \ { q } , h t , x t ) E x ( Q \ { p } , h t , x t ) = h t ( P ) + 0 by   Equation   ( 13 )   and   x M E ( P , e , H m ) = h t ( P ) .
Hence, f ( x ) M E ( P , e , H m ) if x M E ( P , e , H m ) . □
Theorem 3.
Let ( P , e , H m ) Δ . If 0 < α < 2 | P | , then { [ x ] n } n = 1 converges to Θ ¯ ( P , e , H m ) for each x M E ( P , e , H m ) .
Proof. 
Let ( P , e , H m ) Δ , t Γ m , p P and x M E ( P , e , H m ) . By Equation (12) and the definition of f,
f p t ( x ) x p t = α q P \ { p } 1 2 | P | 2 Q P \ { p , q } E x ( Q \ { q } , h t , x t ) E x ( Q \ { p } , h t , x t ) = α · | P | · Θ p t ¯ ( P , e , H m ) x p t .
Hence,
Θ p t ¯ ( P , e , H m ) f p t ( x ) = Θ p t ¯ ( P , e , H m ) x p t + x p t f p t ( x ) = Θ p t ¯ ( P , e , H m ) x p t α · | P | · ( Θ p t ¯ ( P , e , H m ) x p t ) = 1 α · | P | Θ p t ¯ ( P , e , H m ) x p t .
Therefore, for every n N ,
Θ ¯ ( P , e , H m ) [ x ] P = 1 α · | P | n Θ ¯ ( P , e , H m ) x .
If 0 < α < 2 | P | , then 1 < 1 α · | P | < 1 and { [ x ] n } n = 1 converges to Θ ¯ ( P , e , H m ) . □
Similar to the work of Maschler and Owen [13], a dynamic outcome could be provided under reductions as follows.
Definition 4.
Let ρ be an output, ( P , e , H m ) Δ , S P and x M E ( P , e , H m ) . The ( x , ρ ) -reduced scheme ( S , e S , H ρ , S , x r , m ) is given by H ρ , S , x r , m = ( h ρ , S , x r , t ) t Γ m and for every T S ,
h ρ , S , x r , t ( ω ) = max τ E P \ S { h ( ω , τ ) | S ( τ ) = P \ S } p P \ S x p t , S ( ω ) = S , h S , ρ 2 , t ( ω ) , o t h e r w i s e .
Similar to the work of Maschler and Owen [13], we also introduce related switch mapping as follows. The R-switch mapping is g = ( g t ) t Γ m , where g t = ( g p t ) p P and g p t : M E ( P , e , H m ) R is defined by
g p t ( x ) = x p t + α k P \ { p } Θ p t ¯ { p , k } , h Θ ¯ , { p , k } , x r , t x p t .
Define [ θ ] 0 = x , [ θ ] 1 = g ( [ θ ] 0 ) , , [ θ ] n = g ( [ θ ] n 1 ) for every n N .
Lemma 6.
g x M E ( P , e , H m ) for every ( P , e , H m ) Δ and for every x M E ( P , e , H m ) .
Proof. 
Let ( P , e , H m ) Δ , t Γ m , p , k P and x M E ( P , e , H m ) . Let S = { p , k } , by MEIY of Θ ¯ and Definition 4,
Θ p t ¯ ( S , e S , H Θ ¯ , S , x r , m ) + Θ k t ¯ ( S , e S , H Θ ¯ , S , x r , m ) = x p t + x k t .
By 2CSE and 2CS of Θ ¯ ,
Θ p t ¯ ( S , e S , H Θ ¯ , S , x r , m ) Θ k t ¯ ( S , e S , H Θ ¯ , S , x r , m ) = ( h Θ ¯ , S , x r , t ) ( { p } ) ( h Θ ¯ , S , x r , t ) ( { k } ) = ( h S , Θ ¯ 2 , t ) ( { p } ) ( h S , Θ ¯ 2 , t ) ( { k } ) = Θ p t ¯ ( S , e S , H S , Θ ¯ 2 , m ) Θ k t ¯ ( S , e S , H S , Θ ¯ 2 , m ) = Θ p t ¯ ( P , e , H m ) Θ k t ¯ ( P , e , H m ) .
Therefore,
2 · Θ p t ¯ ( S , e S , H Θ ¯ , S , x r , m ) x p t = Θ p t ¯ ( P , e , H m ) Θ k t ¯ ( P , e , H m ) x p t + x k t .
By definition of g and Equation (14),
g p t ( x ) = x p t + α 2 · [ k P \ { p } Θ p t ¯ ( P , e , H m ) k P \ { p } x p t k P \ { p } Θ k t ¯ ( P , e , H m ) + k P \ { p } x k t ] = x p t + α 2 · [ k P \ { p } Θ p t ¯ ( P , e , H m ) | P | 1 x p t k P \ { p } Θ k t ¯ ( P , e , h ) + h t ( P ) x p t ] = x p t + α 2 · [ | P | 1 Θ p t ¯ ( P , e , H m ) | P | 1 x p t h t ( P ) Θ p t ¯ ( P , e , H m ) + h t ( P ) x p t ] = x p t + | P | · α 2 · Θ p t ¯ ( P , e , H m ) x p t .
Therefore, we have that
p P g p t ( x ) = p P x p t + | P | · α 2 · Θ p t ¯ ( P , e , H m ) x p t = p P x p t + | P | · α 2 · p P Θ p t ¯ ( P , e , H m ) p P x p t = h t ( P ) + | P | · α 2 · h t ( P ) h t ( P ) = h t ( P ) .
Thus, g x M E ( P , e , H m ) for every x M E ( P , e , H m ) . □
Theorem 4.
Let ( P , e , H m ) Δ . If 0 < α < 4 | P | , then { [ θ ] n } n = 1 converges to Θ ¯ ( P , e , H m ) for each x M E ( P , e , H m ) .
Proof. 
Let ( P , e , H m ) Δ , t Γ m and x M E ( P , e , H m ) . By Equation (15), g p t ( x ) = x p t + | P | · α 2 · Θ p t ¯ ( P , e , H m ) x p t for every p P . Therefore,
1 | P | · α 2 · Θ p t ¯ ( P , e , H m ) x p t = Θ p t ¯ ( P , e , H m ) g p t ( x )
Therefore, for every n N ,
Θ ¯ ( P , e , H m ) [ θ ] P = 1 | P | · α 2 n Θ ¯ ( P , e , H m ) x .
If 0 < α < 4 | P | , then 1 < 1 | P | · α 2 < 1 and { [ θ ] n } n = 1 converges to Θ ¯ ( P , e , h ) for every ( P , e , H m ) Δ , for every t Γ m and for every p P . □
Subsequently, we present the dynamic outcomes for the MNBCO.
Definition 5.
  • Let ( P , e , H m ) Δ and p P . The N-switch mapping is considered to be f N = ( f N , t ) t Γ m , where f N , t = ( f p N , t ) p P and f p N , t : M E ( P , e , H m ) R is considered by
    f p N , t ( x ) = x p t + α q P \ { p } a t 2 | P | 2 S P \ { p , q } E x ( S { p } , h t , x t a t ) E x ( S { q } , h t , x t a t ) ,
    where a t = h t ( P ) k P Φ k t ( P , e , H m ) . Let [ λ ] 0 = x , [ λ ] 1 = f N , t ( [ λ ] 0 ) , , [ λ ] n = f N , t ( [ λ ] n 1 ) for every n N .
  • The N-R-switch mapping is g N = ( g N , t ) t Γ m , where g N , t = ( g p N , t ) p P and g p N , t : M E ( P , e , H m ) R is considered by
    g p N , t ( x ) = x p t + α k P \ { p } Φ p t ¯ { p , k } , h Φ ¯ , { p , k } , x r , t x p t .
    Let [ χ ] 0 = x , [ χ ] 1 = g N , t ( [ χ ] 0 ) , , [ χ ] n = g N , t ( [ χ ] n 1 ) for every n N .
Theorem 5.
  • f N ( x ) M E ( P , e , H m ) and g N ( x ) M E ( P , e , H m ) for every ( P , e , H m ) Δ and for every x M E ( P , e , H m ) .
  • Let ( P , e , H m ) Δ . If 0 < α < 2 | P | , then { [ λ ] n } n = 1 converges to Φ ¯ ( P , e , H m ) for each x M E ( P , e , H m ) .
  • Let ( P , e , H m ) Δ . If 0 < α < 4 | P | , then { [ χ ] n } n = 1 converges to Φ ¯ ( P , e , H m ) for each x M E ( P , e , H m ) .
Proof. 
The proofs of this theorem are similar to Lemmas 5, 6 and Theorems 3 and 4. □

5. Conclusions

In this article, we investigate the multi-consideration Banzhaf–Coleman output, the multi-consideration efficacious Banzhaf–Coleman output and the multi-consideration normalized Banzhaf–Coleman output. Based on the reduced scheme, several axiomatic outcomes for these outputs are proposed to analyze the reasonability. By adopting reductions and excess mappings, we also present alternative formulations and related dynamic outcomes for these outputs. One should compare related existing outcomes with the outcomes proposed in this article.
  • The multi-consideration Banzhaf–Coleman output, the multi-consideration efficacious Banzhaf–Coleman output and the multi-consideration normalized Banzhaf–Coleman output are presented initially in the contexts of traditional schemes and multi-attribute multi-choice schemes.
  • The notion of our switch mappings in Definitions 3–5 and related dynamic outcomes are based on that of Maschler and Owen’s [13] dynamic outcomes for the Shapley value [14]. The major difference is that our switch mappings in Definitions 3 and 5 are based on “excess mappings”, and the Maschler and Owen [13] switch mapping is based on “reduced schemes”.
The outcomes proposed in this article raise one motivation:
  • Whether there exist other generalizations and related outcomes for some more outputs in the context of multi-attribute multi-choice schemes.
To our knowledge, these issues are still open questions.

Author Contributions

Conceptualization, Y.-H.L.; methodology, Y.-H.L.; software, E.-C.C. and Y.-H.L.; validation, Y.-H.L.; formal analysis, Y.-H.L.; investigation, Y.-H.L.; resources, E.-C.C. and Y.-H.L.; data curation, E.-C.C. and Y.-H.L.; writing—original draft preparation, E.-C.C. and Y.-H.L.; writing—review and editing, E.-C.C. and Y.-H.L.; visualization, E.-C.C. and Y.-H.L.; supervision, E.-C.C. and Y.-H.L.; project administration, E.-C.C. and Y.-H.L.; funding acquisition, none. All authors have read and agreed to the published version of the manuscript.

Funding

This research received no external funding.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Banzhaf, J.F. Weighted voting doesn’t work: A mathematical analysis. Rutgers Law Rev. 1965, 19, 317–343. [Google Scholar]
  2. Owen, G. Multilinear extensions and the Banzhaf value. Nav. Res. Logist. Q. 1975, 22, 741–750. [Google Scholar] [CrossRef]
  3. Dubey, P.; Shapley, L.S. Mathematical properties of the Banzhaf power index. Math. Oper. Res. 1979, 4, 99–131. [Google Scholar] [CrossRef]
  4. Moulin, H. The separability axiom and equal-sharing methods. J. Econ. Theory 1985, 36, 120–148. [Google Scholar] [CrossRef]
  5. Lehrer, E. An axiomatization of the Banzhaf value. Int. J. Game Theory 1988, 17, 89–99. [Google Scholar] [CrossRef]
  6. Haller, H. Collusion properties of values. Int. J. Game Theory 1994, 23, 261–281. [Google Scholar] [CrossRef]
  7. Van den Brink, R.; van der Lann, G. Axiomatizations of the normalized Banzhaf value and the Shapley value. Soc. Choice Welf. 1998, 15, 567–582. [Google Scholar] [CrossRef]
  8. Hwang, Y.A.; Liao, Y.H. The multi-efficacious core, balancedness and axiomatizations for multi-choice games. Int. J. Game Theory 2011, 40, 677–689. [Google Scholar] [CrossRef]
  9. Hwang, Y.A.; Liao, Y.H.; Yeh, C.H. Consistent extensions and subsolutions of the core for the multichoice transferable-utility games. Optimization 2015, 64, 913–928. [Google Scholar] [CrossRef]
  10. Liao, Y.H. Moulin reduction, V-N reduction and axiomatizations of the duplicate core. Asia Pac. J. Oper. Res. 2009, 26, 623–636. [Google Scholar] [CrossRef]
  11. Hwang, Y.A.; Liao, Y.H. Potential approach and characterizations of a Shapley value in multi-choice games. Math. Soc. Sci. 2008, 56, 321–335. [Google Scholar] [CrossRef]
  12. Stearns, R.E. Convergent transfer schemes for P-person games. Trans. Am. Math. Soc. 1968, 134, 449–459. [Google Scholar]
  13. Maschler, M.; Owen, G. The consistent Shapley value for hyperplane games. Int. J. Game Theory 1989, 18, 389–407. [Google Scholar] [CrossRef]
  14. Shapley, L.S. A value for n-person game. In Contributions to the Theory of Games II; Kuhn, H.W., Tucker, A.W., Eds.; Princeton University Press: Princeton, NJ, USA, 1953; pp. 307–317. [Google Scholar]
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Share and Cite

MDPI and ACS Style

Chi, E.-C.; Liao, Y.-H. Sustainable Usability Distribution Mechanisms under Multi-Attribute Sports Management Schemes. Sustainability 2021, 13, 1528. https://doi.org/10.3390/su13031528

AMA Style

Chi E-C, Liao Y-H. Sustainable Usability Distribution Mechanisms under Multi-Attribute Sports Management Schemes. Sustainability. 2021; 13(3):1528. https://doi.org/10.3390/su13031528

Chicago/Turabian Style

Chi, En-Cheng, and Yu-Hsien Liao. 2021. "Sustainable Usability Distribution Mechanisms under Multi-Attribute Sports Management Schemes" Sustainability 13, no. 3: 1528. https://doi.org/10.3390/su13031528

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop