An infinite solitaire game with a random strategy
Andrzej Ehrenfeucht, Jan Mycielski (1979)
Colloquium Mathematicae
Similarity:
Andrzej Ehrenfeucht, Jan Mycielski (1979)
Colloquium Mathematicae
Similarity:
Zdzisław Porosiński, Krzysztof Szajowski (2000)
Applicationes Mathematicae
Similarity:
The following version of the two-player best choice problem is considered. Two players observe a sequence of i.i.d. random variables with a known continuous distribution. The random variables cannot be perfectly observed. Each time a random variable is sampled, the sampler is only informed whether it is greater than or less than some level specified by him. The aim of the players is to choose the best observation in the sequence (the maximal one). Each player can accept at most one realization...
Andrzej Młodak (2005)
Applicationes Mathematicae
Similarity:
We propose new systems of axioms which characterize four types of values of cooperative games: the Banzhaf value, the Deegan-Packel value, the least square prenucleolus and the least square nucleolus. The common element used in these axiomatizations is a fairness property. It requires that if to a cooperative game we add another game in which two given players are symmetric, then their payoffs change by the same amount. In our analysis we will use an idea applied by R. van den Brink...
dos Santos, Carlos Pereira, Silva, Jorge Nuno (2008)
Integers
Similarity:
Stanisław Trybuła (1991)
Applicationes Mathematicae
Similarity:
Kelly, Annela R. (2006)
International Journal of Mathematics and Mathematical Sciences
Similarity:
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),...
Mesdal, G.A., Ottaway, P. (2007)
Integers
Similarity:
S Trybuła (1991)
Applicationes Mathematicae
Similarity:
Spencer, Joel H., St.John, Katherine (2001)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Hans Keiding (2006)
Banach Center Publications
Similarity:
The aspiration core of a TU game was introduced by Bennett [1] as a payoff vector which is undominated and achievable in the sense that each player belongs to a coalition which can obtain the specified payoff for its members, and which minimizes the distance to the set of aggregate feasible payoffs among all such payoff vectors. In the paper a set of axioms is proposed which characterize the aspiration core, which may be considered as an extension of the core to a much larger set of...
Hugo Steinhaus (1949)
Colloquium Mathematicum
Similarity:
Dshalalow, Jewgeni H., Treerattrakoon, Ailada (2008)
Journal of Inequalities and Applications [electronic only]
Similarity:
Vladica Andrejić (2009)
Publications de l'Institut Mathématique
Similarity:
S. Trybuła (1991)
Applicationes Mathematicae
Similarity: