2-pile Nim with a restricted number of move-size imitations.
Page 1 Next
Larsson, Urban (2009)
Integers
Szidarovszky, F., Shen, L. (2000)
Southwest Journal of Pure and Applied Mathematics [electronic only]
Patriche, Monica (2009)
Abstract and Applied Analysis
Miloslav Jirina (1978)
Annales de l'I.H.P. Probabilités et statistiques
Xianghui Li, Hao Sun, Dongshuang Hou (2019)
Kybernetika
A probabilistic communication structure considers the setting with communication restrictions in which each pair of players has a probability to communicate directly. In this paper, we consider a more general framework, called a probabilistic communication structure with fuzzy coalition, that allows any player to have a participation degree to cooperate within a coalition. A maximal product spanning tree, indicating a way of the greatest possibility to communicate among the players, is introduced...
Werner Brannath, Walter Schachermayer (1999)
Séminaire de probabilités de Strasbourg
Islam, M.Ataharul (2003)
Bulletin of the Malaysian Mathematical Sciences Society. Second Series
Biondini, Riccardo, Lin, Yan-Xia, McCrae, Michael (2003)
Journal of Applied Mathematics and Decision Sciences
Länger, Helmut (1993)
Mathematica Pannonica
Bruce R. Ebanks (1981)
Kybernetika
Francesc Carreras (1984)
Stochastica
In the class of complete games, the Shapley index of power is the characteristic invariant of the group of automorphisms, for these are exactly the permutations of players preserving the index.
Alfonso Mateos, Sixto Ríos-Insua (1996)
Extracta Mathematicae
An important issue in multi-attribute decision making consists of identifying the set of efficient solutions. The importance of this set is that the decision maker (DM) can restrict his attention to it, discarding all other solutions, because a nonefficient solution can never be optimal. Several methods have been developed to aid a DM in generating all or representative subsets of efficient solutions, [1] and [4], or to approximate it [7]. However most of these methods may be hard to apply to nonlinear...
Sanyang Liu, Haiyan Li (2017)
Open Mathematics
Restricted (s, t)-Wythoff’s game, introduced by Liu et al. in 2014, is an impartial combinatorial game. We define and solve a class of games obtained from Restricted (s, t)-Wythoff’s game by adjoining to it some subsets of its P-positions as additional moves. The results show that under certain conditions they are equivalent to one case in which only one P-position is adjoined as an additional move. Furthermore, two winning strategies of exponential and polynomial are provided for the games.
Xu, Jiuping, Yao, Liming (2010)
International Journal of Mathematics and Mathematical Sciences
Moshe Sniedovich (2011)
Applications of Mathematics
We examine worst-case analysis from the standpoint of classical Decision Theory. We elucidate how this analysis is expressed in the framework of Wald's famous Maximin paradigm for decision-making under strict uncertainty. We illustrate the subtlety required in modeling this paradigm by showing that information-gap's robustness model is in fact a Maximin model in disguise.
Roşca, Natalia C. (2009)
Acta Universitatis Apulensis. Mathematics - Informatics
Yang, Zhaojun, Ewald, Christian-Oliver, Wang, Wen-Kai (2011)
Journal of Probability and Statistics
Boyarsky, Abraham, Góra, Paweł (2000)
Discrete Dynamics in Nature and Society
Josep Maria Mateo Sanz, Josep Domingo Ferrer (1998)
Qüestiió
Microaggregation is a statistical disclosure control technique for microdata. Raw microdata (i.e. individual records) are grouped into small aggregates prior to publication. Each aggregate should contain at least k records to prevent disclosure of individual information. Fixed-size microaggregation consists of taking fixed-size microaggregates (size k). Data-oriented microaggregation (with variable group size) was introduced recently. Regardless of the group size, microaggregations on a multidimensional...
Breaz, Nicoleta, Breaz, Daniel (2003)
Acta Universitatis Apulensis. Mathematics - Informatics
Page 1 Next