All a b c d e f g h i j k l m n o p q r s t u v w x y z Other

Previous Page 5 Next

Displaying 81 – 100 of 105

Showing per page

Alternative model of fuzzy NTU coalitional game

Milan Mareš, Milan Vlach (2003)

Kybernetika

One of the possible models of fuzzification of non-transferable utility (NTU) coalitional games was extensively treated in [4]. In this paper, we suggest an alternative structure of fuzzification of the NTU games, where for every coalition a fuzzy class of (generally crisp) sets of its admissible pay-off vectors is considered. It is shown that this model of a fuzzy coalitional game can be represented by a fuzzy class of deterministic NTU games, and its basic concepts like the superadditivity or...

Amplitude of weighted majority game strict representations.

Josep Freixas Bosch, M. Albina Puente del Campo (1999)

Qüestiió

Some real situations which may be described as weighted majority games can be modified when some players increase or decrease their weights and/or the quota is modified. Nevertheless, some of these modifications do not change the game. In the present work we shall estimate the maximal percentage variations in the weights and the quota which may be allowed without changing the game (amplitude). For this purpose we have to use strict representations of weighted majority games.

An axiomatization of the aspiration core

Hans Keiding (2006)

Banach Center Publications

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 games. The axioms...

An idempotent algorithm for a class of network-disruption games

William M. McEneaney, Amit Pandey (2016)

Kybernetika

A game is considered where the communication network of the first player is explicitly modelled. The second player may induce delays in this network, while the first player may counteract such actions. Costs are modelled through expectations over idempotent probability measures. The idempotent probabilities are conditioned by observational data, the arrival of which may have been delayed along the communication network. This induces a game where the state space consists of the network delays. Even...

Analyse mathématique élémentaire d'un jeu sportif

P. Parlebas (1974)

Mathématiques et Sciences Humaines

Un jeu sportif bien connu, les quatre coins, est l'objet de cette étude. Les règles de ce jeu déterminent une succession de déplacements qui sont organisés selon une structure de groupe. L'ensemble des graphes de déplacement peut être distribué selon trois partitions qui offrent un précieux support à l'étude expérimentale: on obtient alors des classes d'équivalence de type cyclique, de type spatial et de type métrique. Les règles sont porteuses d'une logique qui accorde une grande importance à l'espace...

Currently displaying 81 – 100 of 105