Levels and transitions in126Te

The decay of¹²⁶Sb to¹²⁶Te is studied by use of Ge(Li) detectors in singles and coincidence arrangements. The gamma-gamma directional correlations of six cascades are measured. A level scheme is constructed where all transitions observed are located. The characteristics of several of the levels are assigned, on basis of the logft values deduced and the directional correlation results. Mixing ratios are deduced for three transitions. From the comparison of the relative intensities ofE1 andE2 transitions depopulating the same levels, threeE1 transitions are concluded to be strongly retarded.     

Perfect equilibria in stochastic games

We examine stochastic games with finite state and action spaces. For the -discounted case, as well as for the irreducible limiting average case, we show the existence of trembling-hand perfect equilibria and give characterizations of those equilibria. In the final section, we give an example which illustrates that the existence of stationary limiting average equilibria in a nonirreducible stochastic game does not imply the existence of a perfect limiting average equilibrium.Support was provided by the Netherlands Organization for Scientific Research NWO via the Netherlands Foundation for Mathematics SMC, Project 10-64-10.     

The general nucleolus and the reduced game property

The nucleolus of a TU game is a solution concept whose main attraction is that it always resides in any nonempty -core. In this paper we generalize the nucleolus to an arbitrary pair (,F), where is a topological space andF is a finite set of real continuous functions whose domain is . For such pairs we also introduce the least core concept. We then characterize the nucleolus forclasses of such pairs by means of a set of axioms, one of which requires that it resides in the least core. It turns out that different classes require different axiomatic characterizations.One of the classes consists of TU-games in which several coalitions may be nonpermissible and, moreover, the space of imputations is required to be a certain generalized core. We call these gamestruncated games. For the class of truncated games, one of the axioms is a new kind ofreduced game property, in which consistency is achieved even if some coalitions leave the game, being promised the nucleolus payoffs. Finally, we extend Kohlberg's characterization of the nucleolus to the class of truncated games.     

Strongly essential coalitions and the nucleolus of peer group games

Most of the known efficient algorithms designed to compute the nucleolus for special classes of balanced games are based on two facts: (i) in any balanced game, the coalitions which actually determine the nucleolus are essential; and (ii) all essential coalitions in any of the games in the class belong to a prespecified collection of size polynomial in the number of players. We consider a subclass of essential coalitions, called strongly essential coalitions, and show that in any game, the collection of strongly essential coalitions contains all the coalitions which actually determine the core, and in case the core is not empty, the nucleolus and the kernelcore. As an application, we consider peer group games, and show that they admit at most 2n−1 strongly essential coalitions, whereas the number of essential coalitions could be as much as 2ⁿ⁻¹. We propose an algorithm that computes the nucleolus of an n-player peer group game in time directly from the data of the underlying peer group situation.Research supported in part by OTKA grant T030945. The authors thank a referee and the editor for their suggestions on how to improve the presentation     

Weighted allocation rules for standard fixed tree games

In this paper we consider standard fixed tree games, for which each vertex unequal to the root is inhabited by exactly one player. We present two weighted allocation rules, the weighted down-home allocation and the weighted neighbour-home allocation, both inspired by the painting story in Maschler et al. (1995) . We show, in a constructive way, that the core equals both the set of weighted down-home allocations and the set of weighted neighbour allocations. Since every weighted down-home allocation specifies a weighted Shapley value (Kalai and Samet (1988)) in a natural way, and vice versa, our results provide an alternative proof of the fact that the core of a standard fixed tree game equals the set of weighted Shapley values. The class of weighted neighbour allocations is a generalization of the nucleolus, in the sense that the latter is in this class as the special member where players have all equal weights.     

A constrained egalitarian solution for convex multi-choice games

This paper deals with a constrained egalitarian solution for convex multi-choice games named the d value. It is proved that the d value of a convex multi-choice game belongs to the precore, Lorenz dominates each other element of the precore and possesses a population monotonicity property regarding players’ participation levels. Furthermore, an axiomatic characterization is given where a specific consistency property plays an important role.     

Theτ-value for games on matroids

In the classical model of games with transferable utility one assumes that each subgroup of players can form and cooperate to obtain its value. However, we can think that in some situations this assumption is not realistic, that is, not all coalitions are feasible. This suggests that it is necessary to raise the whole question of generalizing the concept of transferable utility game, and therefore to introduce new solution concepts. In this paper we define games on matroids and extend theτ-value as a compromise value for these games. This work has been partially supported by the Spanish Ministery of Science and Technology under grant SEC2000-1243.