We consider a set of cellular users associated with base station (BS) in network that employs Device-to-device (D2D) communication. A subset the request for some files from server BS. Now, can potentially act as relays and forward requested files, or partitions BS to requesting (destination nodes) over D2D links. However, this requires cooperation among users. Also, when cooperate each other, t...

With the advent of Distributed Energy Resources within smart grid systems, traditional demand response management (DRM) models need to be redesigned capture prosumers’ energy consumption requests and dynamic behavior market. In this paper, a coalitional DRM model is introduced based on principles Game Theory reinforcement learning dynamically determine formation in local trading communities the...

Interval games are an extension of cooperative coalitional games, in which players assumed to face payoff uncertainty. Characteristic functions thus assign a closed interval instead real number. This study revisits two game versions Shapley values (i.e., the value and Shapley-like value) characterizes them using axiomatic approach. For value, we show that existing axiomatization can be generali...

The study of cooperation among agents is of central interest in multiagent systems research. A popular way to model cooperation is through coalitional game theory. Much research in this area has had limited practical applicability as regards real-world multi-agent systems due to the fact that it assumes deterministic payoffs to coalitions and in addition does not apply to multi-agent environmen...

We propose a new representation for coalitional games, called the coalitional skill vector model, where there is a set of skills in the system, and each agent has a skill vector—a vector consisting of values that reflect the agents’ level in different skills. Furthermore, there is a set of goals, each with requirements expressed in terms of the minimum skill level necessary to achieve the goal....

This paper characterizes the complexity of the core in coalitional games. There are different proposals for representing coalitional games in a compact way, where the worths of coalitions may be computed in polynomial time. In all those frameworks, it was shown that core non-emptiness is a co-NPhard problem. However, for the most general of them, it was left as an open problem whether it belong...

Coalitional games, including Coalition Structure Generation (CSG), have been attracting considerable attention from the AI research community. Traditionally, the input of a coalitional game is a black-box function called a characteristic function. Previous studies have found that many problems in coalitional games tend to be computationally intractable in this black-box function representation....

Coalitional games are mathematical models suited to analyze scenarios where players can collaborate by forming coalitions in order to obtain higher worths than by acting in isolation. A fundamental problem for coalitional games is to single out the most desirable outcomes in terms of appropriate notions of worth distributions, which are usually called solution concepts. Motivated by the fact th...