Algorithms for Coalitional Games
نویسندگان
چکیده
Coalitional games are studied extensively in economics and computer science. They have recently shown to be a useful formalism and are applicable to a wide range of domains from electronic commerce to trade and negotiation systems. Key topics in coalitional games include both deciding the stability of given coalitions and calculating representative or all stable coalitions. However, typically the number of possible outcomes in coalitional games grows exponentially in the number of players involved. Thus, usually finding stable or optimal outcomes among all possible outcomes of a coalitional game is a challenging combinatorial task. The main objective of this research is to develop practically efficient algorithms for coalitional games with a large number of players. In particular, the research in the thesis focuses on hedonic coalitional games. As the main results, the thesis introduces new methods for finding a core stable coalition structure, calculating the set of all Nash stable coalition structures, and checking the core membership of a given hedonic game solution. In addition, the thesis presents a new technique to maximize social welfare in coalitional games represented as characteristic function
منابع مشابه
Path coalitional games
We present a general framework to model strategic aspects and stable and fair resource allocations in networks via variants and generalizations of path coalitional games. In these games, a coalition of edges or vertices is successful if it can enable an s-t path. We present polynomial-time algorithms to compute and verify least core payoffs of cost-based generalizations of path coalitional game...
متن کاملApproximating power indices
Many multiagent domains where cooperation among agents is crucial to achieving a common goal can be modeled as coalitional games. However, in many of these domains, agents are unequal in their power to affect the outcome of the game. Prior research on weighted voting games has explored power indices, which reflect how much “real power” a voter has. Although primarily used for voting games, thes...
متن کاملShapley Value for Games with Externalities and Games on Graphs
The Shapley value [46] is one of the most important solution concepts in coalitional game theory. It was originally defined for classical model of a coalitional game, which is relevant to a wide range of economic and social situations. However, while in certain cases the simplicity is the strength of the classical coalitional game model, it often becomes a limitation. To address this problem, a...
متن کاملComplexity of coalition structure generation
We revisit the coalition structure generation problem in which the goal is to partition the players into exhaustive and disjoint coalitions so as to maximize the social welfare. One of our key results is a general polynomial-time algorithm to solve the problem for all monotonic coalitional games provided that player types are known and the number of player types is bounded by a constant. As a c...
متن کاملCore Membership Computation for Succinct Representations of Coalitional Games
In this paper, I compare and contrast two formal results on the computational complexity of core membership determination in two compact representations of coalitional games. Conitzer and Sandholm [1] proposed the multi-issue representations of coalitional games. This representation attempts to decompose a coalitional games into a set of sub-games. Later, Ieong and Shoham [3] proposed the margi...
متن کامل