A bargaining procedure with offer-dependent breakdown probabilities.
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...
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.
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...
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.
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.
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...