Academic achievement with cooperative learning using homogeneous and heterogeneous groups

Cooperative learning is a proven teaching strategy that teachers have been using for over 40 years. Teachers often group students heterogeneously so that students who are lower achieving are learning with and from higher achieving students. The purpose of this study was to test homogeneous and heterogeneous grouping while using cooperative learning teaching structure. This study aimed to answer the question of whether students be grouped homogeneously or heterogeneously while participating in cooperative learning. The primary research design for this study was a quasi-experimental nonequivalent control-group design. A convenience sample of fifth-grade students was drawn from a Georgia elementary school in the 2017–2018 school year. The data were analyzed using analysis of covariance (ANCOVA) and paired samples t tests. The ANCOVA was run to compare the scores from the FOSS Survey/Posttest, and the analysis showed no significant difference between the homogeneous and heterogeneous group posttest scores. Both groups made significant gains (as shown by the results of the paired samples t-tests).     

The Shapley value,the Proper Shapley value,and sharing rules for cooperative ventures

In this note, we discuss two solutions for cooperative transferable utility games, namely the Shapley value and the Proper Shapley value. We characterize positive Proper Shapley values by affine invariance and by an axiom that requires proportional allocation of the surplus according to the individual singleton worths in generalized joint venture games. As a counterpart, we show that affine invariance and an axiom that requires equal allocation of the surplus in generalized joint venture games characterize the Shapley value.     

Existence of the solutions of a reaction cross-diffusion model for two species

In this paper, we investigate a two-cooperative species model with reaction cross-diffusion under the Dirichlet boundary value condition. By applying Lyapunov–Schmidt reduction method and some important formulas, we obtain the existence of coexistence solutions under some given conditions.     

Convex games with an infinite number of players and sequencing situations

In this paper we study convex games with an infinite countable set of agents and provide characterizations of this class of games. To do so, and in order to overcome some shortcomings related to the difficulty of dealing with infinite orderings, we need to use a continuity property. Infinite sequencing situations where the number of jobs is infinite countable can be related to convex cooperative TU games. It is shown that some allocations turn out to be extreme points of the core of an infinite sequencing game.     

The Shapley value for arbitrary families of coalitions

We address the problem of finding a suitable definition of a value similar to that of Shapley’s, when the games are defined on a subfamily of coalitions with no structure. We present two frameworks: one based on the familiar efficiency, linearity and null player axioms, and the other on linearity and the behavior on unanimity games. We give several properties and examples in each case, and give necessary and sufficient conditions on the family of coalitions for the approaches to coincide.     

Positive Periodic Solution of a Periodic Cooperative Model with State Dependent Delays

By using the continuation theorem of coincidence degree theory, sufficient conditions are obtained for the existence of positive periodic solution for the periodic cooperative system with state dependent delays where r i , a i , c i , i = 1, 2 are positive continuous y -periodic functions, b i , i = 1, 2 are nonnegative continuous y -periodic functions, and ij , i = 1, 2; j = 1, 2, 3 are nonnegative continuous functions and y -periodic with respect to their first argument.     

Cooperative advertising in a distribution channel with fairness concerns

Cooperative (co-op) advertising has been widely used in practice and employed as a strategy to improve the performance of a distribution channel. It is known from the existing models that co-op advertising could not achieve the channel coordination (i.e., maximize the total channel profit). In this paper, we consider a distribution channel consisting of a single manufacturer and a single retailer, and investigate the effect of the retailer’s fairness concerns. Applying the equilibrium analysis, we obtain the following results: (1) Channel coordination can be achieved if the retailer has fairness concerns and model parameters satisfy certain conditions. (2) Although both channel members become better off with co-op advertising if neither channel member has fairness concerns, we find situations where co-op advertising brings detrimental effects to the retailer if the retailer has fairness concerns. (3) The retailer’s fairness concerns may increase or decrease the equilibrium participation rate, the equilibrium advertising effort, and the equilibrium profit of the manufacturer and the whole channel. (4) We identify the conditions under which the effectiveness of co-op advertising can be improved or reduced by the retailer’s fairness concerns. As long as co-op advertising can bring extra profit to the manufacturer, the retailer’s fairness concerns could improve the effectiveness of the co-op advertising. (5) There exists a Pareto improvement for the profits of both the manufacturer and the retailer when a retailer without fairness concerns becomes fair-minded.     

Cooperative game theoretic centrality analysis of terrorist networks: The cases of Jemaah Islamiyah and Al Qaeda

The identification of key players in a terrorist organization aids in preventing attacks, the efficient allocation of surveillance measures, and the destabilization of the corresponding network. In this paper, we introduce a game theoretic approach to identify key players in terrorist networks. In particular we use the Shapley value as a measure of importance in cooperative games that are specifically designed to reflect the context of the terrorist organization at hand. The advantage of this approach is that both the structure of the terrorist network, which usually reflects a communication and interaction structure, as well as non-network features, i.e., individual based parameters such as financial means or bomb building skills, can be taken into account. The application of our methodology to the analysis results in rankings of the terrorists in the network. We illustrate our methodology through two case studies: Jemaah Islamiyah’s Bali bombing and Al Qaedas 9/11 attack, which lead to new insights in the operational networks responsible for these attacks.     

Computation of the random arrival rule for bankruptcy problems

Bankruptcy problems are a fundamental class of fair division problems in microeconomics. Among the various solution concepts proposed for the problem, the random arrival rule is one of the most prominent. In this paper, we conduct a computational analysis of the rule. It is shown that the allocation returned by the rule is #P-complete to compute. The general complexity result is complemented by a pseudo-polynomial-time dynamic programming algorithm for the random arrival rule.     

"稀溶液的依数性"多维互动教学模式的探索

Colligative properties of dilute solutions are the basic contents for chemistry, chemical engineering and biomedicine majors. The teaching model of multidimensional interact takes teachers as the leader and students as the main body. Through the multi-dimensional interaction among teachers and students, students and groups, students' interest in learning, strong sense of cooperation and independent learning ability can be cultivated. This paper introduces the implementation process of the multi-dimensional interactive teaching mode of "colligative properties of dilute solutions", which includes clarifying the purpose of interaction, constructing learning groups, raising interactive questions, launching interactive activities and implementing interactive evaluation, etc. Multi-dimensional teaching goals can be achieved through group explorations, group presentations and group discussions.