Network partitioning algorithms as cooperative games

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Cooperative Game Theory Approaches for Network Partitioning

The paper is devoted to game-theoretic methods for community detection in networks. The traditional methods for detecting community structure are based on selecting denser subgraphs inside the network. Here we propose to use the methods of cooperative game theory that highlight not only the link density but also the mechanisms of cluster formation. Specifically, we suggest two approaches from c...

متن کامل

Asynchronous Algorithms in Non-cooperative Games*

An equilibrium solution of an N-person game is said to be globally stable (or, simply, stable) with respect to an a priori fixed ordering of computation of policies if, regardless of what initial policies the players start with, the generated algorithm converges to that equilibrium. At each step of such an iteration, each player determines his policy (or action, if the underlying game is static...

متن کامل

Industrial Symbiotic Relations as Cooperative Games

In this paper, we introduce a game-theoretical formulation for a specific form of collaborative industrial relations called “Industrial Symbiotic Relation (ISR) games” and provide a formal framework to model, verify, and support collaboration decisions in this new class of two-person operational games. ISR games are formalized as cooperative cost-allocation games with the aim to allocate the to...

متن کامل

Decision Algorithms for Multiplayer Non-Cooperative Games of Incomplete Information

Extending the complexity results of Reif 1, 2] for two player games of incomplete information, this paper (also see 3]) presents algorithms for deciding the outcome for various classes of multiplayer games of incomplete information, i.e. deciding whether or not a team has a winning strategy for a particular game. Our companion paper (Peter-son, Reif, and Azhar 4]) shows that these algorithms ar...

متن کامل

A TRANSITION FROM TWO-PERSON ZERO-SUM GAMES TO COOPERATIVE GAMES WITH FUZZY PAYOFFS

In this paper, we deal with games with fuzzy payoffs. We proved that players who are playing a zero-sum game with fuzzy payoffs against Nature are able to increase their joint payoff, and hence their individual payoffs by cooperating. It is shown that, a cooperative game with the fuzzy characteristic function can be constructed via the optimal game values of the zero-sum games with fuzzy payoff...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Computational Social Networks

سال: 2018

ISSN: 2197-4314

DOI: 10.1186/s40649-018-0059-5