In this paper we study and compute E-points in an explicit way for a special kind of diagonal games with 3k + 1, 4k + 3 and sk + 1 players where 1 ≤ s ≤ k.

In this paper we study and compute E-points in an explicit way for a special general kind of 3k + 1 and 3k + 2 players.

In this paper we study and compute E-points in an explicit way for diagonal games of three, four, five and n-players.

In this short note we extend the very well known Centipede game of Rosenthal to the same extensive games with perfect information. The only difference that here the Centipede games have instead of numbers as payoff functions, they have variables. We introduce and study the relationship between...

Partitioning games and games with restricted cooperation are general games which include large classes of different and important cooperative games. In this paper we combined both concepts and prove a generalization of the theorem of Quint [1991] which characterizes the core of the game by means...

In this paper we introduce two simple versions of the hat game for three players and a generalization for n players. We compute the extensive version of the game and all the equilibrium and friendly equilibrium points as a simple example of the structure function.

In this paper we characterize a general existence theorem concerning E-points for n-persons extensive games with complete information. We provide a sufficient and necessary condition for the existence of such E-points.