The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

Displaying similar documents to “Limit theorems for Parrondo's paradox.”

Parrondo's paradox.

Berresford, Geoffrey C., Rockett, Andrew M. (2003)

International Journal of Mathematics and Mathematical Sciences

Similarity:

Separability by semivalues modified for games with coalition structure

Rafael Amer, José Miguel Giménez (2009)

RAIRO - Operations Research

Similarity:

Two games are inseparable by semivalues if both games obtain the same allocation whatever semivalue is considered. The problem of separability by semivalues reduces to separability from the null game. For four or more players, the vector subspace of games inseparable from the null game by semivalues contains games different to zero-game. Now, for five or more players, the consideration of a priori coalition blocks in the player set allows us to reduce in a significant way the dimension...

Analysis and improvement attempt of prof. Alan Fowler's negotiation game

Jakub Jan Golik (2018)

Annales Universitatis Paedagogicae Cracoviensis | Studia ad Didacticam Mathematicae Pertinentia

Similarity:

The main goal of the following article is to design an improved version of the negotiation game created by prof. Alan Fowler (Fowler, 1997). I have tried to achieve this by constructing four separate versions of the game which represent different approaches while preserving rules, chosen basic technical assumptions and the simplicity of the base game. Each version of the game is supposed to i.a. make it less obvious, create new negotiation possibilities (including potential cooperation),...

Delegation equilibrium payoffs in integer-splitting games

Sylvain Sorin, Cheng Wan (2013)

RAIRO - Operations Research - Recherche Opérationnelle

Similarity:

This work studies a new strategic game called delegation game. A delegation game is associated to a basic game with a finite number of players where each player has a finite integer weight and her strategy consists in dividing it into several integer parts and assigning each part to one subset of finitely many facilities. In the associated delegation game, a player divides her weight into several integer parts, commits each part to an independent delegate and collects the sum of their...