Fuzzy transferable-utility games: a weighted allocation and related results
Authors
Abstract:
By considering the supreme-utilities among fuzzy sets and the weights among participants simultaneously, we introduce the supreme-weighted value on fuzzy transferable-utility games. Further, we provide some equivalent relations to characterize the family of all solutions that admit a potential on weights. We also propose the dividend approach to provide alternative viewpoint for the potential approach. Based on these equivalent relations, several axiomatic results are also proposed to present the rationality for the supreme-weighted value.
similar resources
Transferable Utility Planning Games
Connecting between standard AI planning constructs and a classical cooperative model of transferable-utility coalition games, we introduce the notion of transferable-utility (TU) planning games. The key representational property of these games is that coalitions are valued implicitly based on their ability to carry out efficient joint plans. On the side of the expressiveness, we show that exist...
full textTransferable utility games with uncertainty
We introduce the concept of a TUU-game, a transferable utility game with uncertainty. In a TUU-game there is uncertainty regarding the payoffs of coalitions. One out of a finite number of states of nature materializes and conditional on the state, the players are involved in a particular transferable utility game. We consider the case without ex ante commitment possibilities and propose the Wea...
full textFuzzy Classes of Cooperative Games with Transferable
The present work is concerned with cooperative games with transferable utility the characteristic function of which may have fuzzy values. Main attention is devoted to notions of superadditivity, convexity, core, and Shapley value. It turns out that the proposed fuzzy counterparts of these notions eliminate difficulties and disappointing features connected with previous approaches.
full textConvex and exact games with non-transferable utility
We generalize exactness to games with non-transferable utility (NTU). In an exact game for each coalition there is a core allocation on the boundary of its payoff set. Convex games with transferable utility are well-known to be exact. We study five generalizations of convexity in the NTU setting. We show that each of ordinal, coalition merge, individual merge and marginal convexity can be unifi...
full textStable partitions for games with non-transferable utility and externalities
We provide a model of coalitional bargaining with claims in order to solve games with non-transferable utilities and externalities. We show that, for each such game, payoff configurations exist which will not be renegotiated. In the ordinal game derived from these payoff configurations, we can find a partition in which no group of players has an incentive to jointly change their coalitions. For...
full textThe procedural value for cooperative games with non-transferable utility
I adapt Raiffa's discrete bargaining solution in order to take the possibility of partial cooperation into account when there are more than two players. The approach is non-cooperative. I slightly modify the bargaining procedure proposed by Sjöström for supporting the Raiffa solution, exactly as Hart and MasColell introduced the possibility of partial cooperation in (a slight variation of) the ...
full textMy Resources
Journal title
volume 16 issue 3
pages 189- 197
publication date 2019-06-29
By following a journal you will be notified via email when a new issue of this journal is published.
Hosted on Doprax cloud platform doprax.com
copyright © 2015-2023