By generalizing the standard solution for 2-person games into n-person cases, this paper develops a new solution concept for cooperative games: the consensus value.We characterize the consensus value as the unique function that satisfies efficiency, symmetry, the quasi dummy property and...

This paper studies a generalization of the consensus value (cf.Ju, Borm and Ruys (2004)) to the class of partition function form games.The concepts and axioms, related to the consensus value, are extended.This value is characterized as the unique function that satisfies efficiency, complete...

AMS classification: 90D12

AMS classification: 90D12

Bayesian equilibria are characterized by means of consistency and one-person rationality in combination with non-emptiness or converse consistency. Moreover, strong and coalition-proof Bayesian equilibria of extended Bayesian games are introduced and it is seen that these notions can be...

In this paper we characterize the class of games for which the core coincides with the core cover (compromise stable games).Moreover we will develop an easy explicit formula for the nucleolus for this class of games, using an approach based on bankruptcy problems.Also the class of convex...

Informationally Robust Equilibria (IRE) are introduced in Robson (1994) as a refinement of Nash equilibria for e.g. bimatrix games, i.e. mixed extensions of two person finite games.Similar to the concept of perfect equilibria, basically the idea is that an IRE is a limit of some sequence of...

In this paper we introduce multiple longest traveling salesman (MLTS) games. An MLTS game arises from a network in which a salesman has to visit each node (player) precisely once, except its home location, in an order that maximizes the total reward.First it is shown that the value of a...