We give a non-cooperative and an axiomatic characterization of the Average Lexicographic value (AL-value) on the class of balanced games. The AL-value is a single-valued solution for balanced TU-games. It is defined as the average of lexicographic maximum of the core of the game with respect to...

The goal of this work is to provide a comprehensive review of different Game Theory applications that have been recently used to predict the behavior of non-rational agents in interaction situations arising from computational biology. In the first part of the paper, we focus on evolutionary...

In many share problems there is an a priori given a natural set of possible divisions to solve the sharing problem. Cooperative games related to such share sets are introduced, which may be helpful in solving share problems. Relations between properties of share sets and properties of games are...

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

This article considers single-valued solutions of transferable utility cooperative games that satisfy core selection and aggregate monotonicity, defined either on the set of all games, G <Superscript> N </Superscript>, or on the set of essential games, E <Superscript> N </Superscript> (those with a non-empty imputation set). The main result is that...</superscript></superscript>

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

This paper introduces a new model concerning cooperative situations in which the payoffs are modeled by random variables. We analyze these situations by means of cooperative games with random payoffs. Special attention is paid to three types of convexity, namely coalitional-merge,...

Recently it is proved that all infinite assignment games have a non-empty core. Using this fact, and a technique suggested by L. S. Shapley for finite permutation games, we prove similar results for infinite permutation games. Infinite transportation games can be interpreted as a generalization...