A cluster-based method for constructing sparse principal components is proposed. The method initially forms clusters of variables, using a new clustering approach called the semi-partition, in two steps. First, the variables are ordered sequentially according to a criterion involving the...

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...

We consider the model of cooperative games in which the agents can restrict the communication, because agents are sometimes divided into subgroups in a natural way, for example by their political affinities or by the companies that employ them. More particularly we focus on cooperative games...

In this note we study uncertainty sequencing situations, i.e., one-machine sequencing situations in which no initial order is specified. We associate cooperative games with these sequencing situations, study their core, and provide links with the classic sequencing games introduced by Curiel et...

We consider a situation in which a group of banks consider connecting their Automated Teller Machines (ATMs) in a network, so that the banks’ customers may use ATMs of any bank in the network. The problem studied is that of allocating the total transaction costs arising in the network, among...

Ausgehend von kontinuierlichen 1-Standortproblemen wird in diesem Paper eine neue Klasse von kostenbasierten TU-Spielen eingeführt. Es werden einige hinreichende Bedingungen präsentiert unter denen ein Spiel in dieser Klasse einen nicht-leeren Kern hat. Weiterhin werden Zuordnungsregeln für...

Inventory situations, introduced in Meca et al. (Eur J Oper Res 156: 127–139, 2004), study how a collective of firms can minimize its joint inventory cost by means of co-operation. Depending on the information revealed by the individual firms, they analyze two related cooperative TU games:...

We study coalitional values for games in generalized characteristic function form. There are two extensions of the Shapley value (Shapley (1953)) in this context, one introduced by Nowak and Radzik (1994) and the other introduced by us. We generalize both values to games with a priori unions in...

In this paper we look at semi-infinite assignment problems. These are situations where a finite set of agents of one type has to be assigned to an infinite set of agents of another type. This has to be done in such a way that the total profit arising from these assignments is as large as...

In this note we show that the mathematical tools of cooperative game theory allow a successful approach to the statistical problem of estimating a density function. Specifically, any random sample of an absolutely continuous random variable determines a transferable utility game, the Shapley...