Graphs and Cooperation in Games
From MaRDI portal
Publication:4187625
DOI10.1287/moor.2.3.225zbMath0402.90106OpenAlexW1975617599WikidataQ56701506 ScholiaQ56701506MaRDI QIDQ4187625
Publication date: 1977
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: http://www.kellogg.northwestern.edu/research/math/papers/246.pdf
cooperation structuresShapley valueapplication of graph theorygames in characteristic function form\(n\)-person cooperative gamefair allocation rules
Cooperative games (91A12) Games involving graphs (91A43) (n)-person games, (n>2) (91A06) Graph theory (05C99)
Related Items (only showing first 100 items - show all)
Measuring the relevance of factors in the occurrences of events ⋮ A value for cooperative games with coalition and probabilistic graph structures ⋮ Games on signed graphs ⋮ A Shapley value for games with restricted coalitions ⋮ Structures of values for set games restricted by partition system ⋮ Socially structured games ⋮ The socially stable core in structured transferable utility games ⋮ Allocation rules for cooperative games with restricted communication and a priori unions based on the Myerson value and the average tree solution ⋮ Contractually stable networks ⋮ The priority value for cooperative games with a priority structure ⋮ The position value is the Myerson value, in a sense ⋮ Component efficient solutions in line-graph games with applications ⋮ Maximal information propagation via lotteries ⋮ The impact of intermediaries on a negotiation: an approach from game theory ⋮ Cooperative games on convex geometries with a coalition structure ⋮ Impacts of boycotts concerning the Shapley value and extensions ⋮ Power measures and solutions for games under precedence constraints ⋮ A strategic implementation of the sequential equal surplus division rule for digraph cooperative games ⋮ On benefits of cooperation under strategic power ⋮ Clique games: a family of games with coincidence between the nucleolus and the Shapley value ⋮ Shapley value of a cooperative game with fuzzy set of feasible coalitions ⋮ The Banzhaf value as a design tool in coalitional control ⋮ A cooperative game-theoretic approach to the social ridesharing problem ⋮ Decomposition of network communication games ⋮ Stability, efficiency, and contentedness of social storage networks ⋮ Constrained coalition formation on valuation structures: formal framework, applications, and islands of tractability ⋮ Two efficient values of cooperative games with graph structure based on \(\tau\)-values ⋮ Associated consistency, value and graphs ⋮ A Banzhaf value for games with a proximity relation among the agents ⋮ Necessary versus equal players in axiomatic studies ⋮ Coalitional surplus desirability and the equal surplus division value ⋮ The Egalitarian efficient extension of the Aumann-Drèze value ⋮ Comments on: ``Recent developments in the queueing problem ⋮ Path monotonicity, consistency and axiomatizations of some weighted solutions ⋮ A value for generalized probabilistic communication situations ⋮ Characterization of the core in games with restricted cooperation ⋮ A strategic implementation of the average tree solution for cycle-free graph games ⋮ Information-sharing in social networks ⋮ An efficient and fair solution for communication graph games ⋮ Potential maximizers and network formation ⋮ On hierarchies and communication ⋮ Solution concepts for games with general coalitional structure ⋮ Equivalence and axiomatization of solutions for cooperative games with circular communication structure ⋮ Measuring power and satisfaction in societies with opinion leaders: an axiomatization ⋮ Constrained core solutions for totally positive games with ordered players ⋮ Values and potential of games with cooperation structure ⋮ Allocating positions fairly: auctions and Shapley value ⋮ Network potentials ⋮ The Myerson value for directed graph games ⋮ A value for communication situations with players having different bargaining abilities ⋮ The Banzhaf value for generalized probabilistic communication situations ⋮ Bidding for surplus in network allocation problems ⋮ Probabilistic network values ⋮ Hyperadditive games and applications to networks or matching problems ⋮ The Shapley value for cooperative games with restricted worths ⋮ Myopic and farsighted stability in network formation games: an experimental study ⋮ Evaluating groups with the generalized Shapley value ⋮ Tree, web and average web values for cycle-free directed graph games ⋮ The average tree solution for cycle-free graph games ⋮ The average tree permission value for games with a permission tree ⋮ Farsighted network formation ⋮ The position value and the structures of graphs ⋮ Games with a local permission structure: separation of authority and value generation ⋮ The average tree solution for cooperative games with communication structure ⋮ Cooperative games with partial information ⋮ Interaction indices for games on combinatorial structures with forbidden coalitions ⋮ An approach via generating functions to compute power indices of multiple weighted voting games with incompatible players ⋮ Multi-sided assignment games on \(m\)-partite graphs ⋮ Necessary players, myerson fairness and the equal treatment of equals ⋮ Coalitional games induced by matching problems: complexity and islands of tractability for the Shapley value ⋮ The average covering tree value for directed graph games ⋮ The efficient proportional Myerson values ⋮ Valuation monotonicity, fairness and stability in assignment problems ⋮ On the structural stability of values for cooperative games ⋮ Assignment of heterogeneous agents in trees under the permission value ⋮ Marginality and Myerson values ⋮ Cooperative games on intersection closed systems and the Shapley value ⋮ The weighted Shapley-egalitarian value for cooperative games with a coalition structure ⋮ Voting power on a graph connected political space with an application to decision-making in the council of the European Union ⋮ Cooperative games with overlapping coalitions: charting the tractability frontier ⋮ Attachment centrality: measure for connectivity in networks ⋮ The average tree value for hypergraph games ⋮ The Myerson value on local structures of coalitions ⋮ Shapley value for TU-games with multiple memberships and externalities ⋮ The \(cg\)-average tree value for games on cycle-free fuzzy communication structures ⋮ Priority relations and cooperation with multiple activity levels ⋮ Uncertain production environment and communication structure ⋮ Measuring power in coalitional games with friends, enemies and allies ⋮ Characterization of a value for games under restricted cooperation ⋮ Spatial games and endogenous coalition formation ⋮ The nucleolus and inheritance of properties in communication situations ⋮ Extension of Owen value for the game with a coalition structure under the limited feasible coalition ⋮ On reward sharing in blockchain mining pools ⋮ Values for transferable utility games with coalition and graph structure ⋮ Unilateral vs. bilateral link-formation: a transition without decay ⋮ The core of cooperative differential games on networks ⋮ Explanation with the winter value: efficient computation for hierarchical Choquet integrals ⋮ Preface: DGAA focused issue on dynamic games and social networks ⋮ Harsanyi power solutions for games on union stable systems ⋮ The \(\chi\) value and team games
This page was built for publication: Graphs and Cooperation in Games
