Values of Graph-Restricted Games

DOI10.1137/0607025MaRDI QIDQ3796995zbMATH OpenOpenAlexFDO

Authors Guillermo Owen

Publication date 1986

Published in SIAM Journal on Algebraic Discrete Methods (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/0607025

zbMATH Keywords

Banzhaf-Coleman valueconnected partial graphsgame on a graphlines of communicationpower indicesShapley value

Mathematics Subject Classification ID

Positional games (pursuit and evasion, etc.) (91A24)

Recommendations

• Values of games with weighted graphs
• ON THE COMPLEXITY OF COMPUTING VALUES OF RESTRICTED GAMES
• Values of games with probabilistic graphs
• Values of games with graph restricted communication and a priori unions
• Value of games with two-layered hypergraphs
• The -value of cooperative games restricted by graphs
• Values for games on the cycles of a digraph
• The Myerson value for directed graph games
• Characterization of a value for games under restricted cooperation
• scientific article; zbMATH DE number 5823886

Cites work

• Graphs and Cooperation in Games
• scientific article; zbMATH DE number 4089357 (Why is no real title available?)
• scientific article; zbMATH DE number 3078997 (Why is no real title available?)
• Multilinear extensions and the banzhaf value
• Multilinear Extensions of Games

Cited in

(only showing first 100 items - show all)

• Bargaining sets and the core in partitioning games
• Axiomatizations of the Shapley value for games on augmenting systems
• Communication and its cost in graph-restricted games
• Restriction of simple games
• Allocation rules for hypergraph communication situations
• Games with permission structures: The conjunctive approach
• Strongly balanced cooperative games
• Coalition formation under limited communication
• The Shapley value for cooperative games under precedence constraints
• The \({\mathcal B}\)-nucleolus of TU-games
• A note on voting
• A value with incomplete communication
• Consistent restricted Shapley values
• Values of games with probabilistic graphs
• An axiomatization of the disjunctive permission value for games with a permission structure
• Restricted component additive games
• Centrality and power in social networks: A game theoretic approach.
• Graphs and (levels of) cooperation in games: two ways how to allocate the surplus
• Values for cooperative games over graphs and games with inadmissible coalitions
• Luxembourg in the early days of the EEC: null player or not?
• Generalized additive games
• The class of ASN-position values. Centrality and consequences of connection failure
• Dynamics in matching and coalition formation games with structural constraints
• Games with nested constraints given by a level structure
• Monotonicity of power in weighted voting games with restricted communication
• The cg-position value for games on fuzzy communication structures
• Cooperative games on antimatroids
• -component additive games
• Games and cooperation indices
• Hierarchical organization structures and constraints on coalition formation
• A simple procedure to compute the nucleolus of \(\Gamma\)-component additive games
• The Myerson value and superfluous supports in union stable systems
• Games induced by the partitioning of a graph
• Values and potential of games with cooperation structure
• The Shapley value for cooperative games with restricted worths
• Cooperative games with partial information
• The average tree value for hypergraph games
• Measuring power in coalitional games with friends, enemies and allies
• Spatial games and endogenous coalition formation
• The nucleolus and inheritance of properties in communication situations
• Allocation rules for cooperative games with restricted communication and a priori unions based on the Myerson value and the average tree solution
• A value for communication situations with players having different bargaining abilities
• The Banzhaf value for generalized probabilistic communication situations
• Values for transferable utility games with coalition and graph structure
• Harsanyi power solutions for games on union stable systems
• A Shapley value for games with restricted coalitions
• The socially stable core in structured transferable utility games
• Component efficient solutions in line-graph games with applications
• Decomposition of network communication games
• A Banzhaf value for games with a proximity relation among the agents
• A value for generalized probabilistic communication situations
• Power indices expressed in terms of minimal winning coalitions
• The average tree solution for cycle-free graph games
• A unified approach to the myerson value and the position value
• A note on a value with incomplete communication
• Monotonicity of the core and value in dynamic cooperative games
• Inheritance of convexity for the \(\mathcal{P}_{\min}\)-restricted game
• Adaptive allocation rules for hypergraph games
• Consistency and the graph Banzhaf value for communication graph games
• A Banzhaf value for games with fuzzy communication structure: computing the power of the political groups in the European parliament
• Some open problems in simple games
• Network topology, higher orders of stability and efficiency
• Computing Banzhaf-Coleman and Shapley-Shubik power indices with incompatible players
• ON THE COMPLEXITY OF COMPUTING VALUES OF RESTRICTED GAMES
• Cooperation when some players are incompatible
• Values of games with weighted graphs
• An axiomatization of probabilistic Owen value for games with coalition structure
• scientific article; zbMATH DE number 1843547 (Why is no real title available?)
• Multilateral bargaining in networks: on the prevalence of inefficiencies
• New characteristic function for cooperative games with hypergraph communication structure
• Networks, communication and hierarchy: applications to cooperative games
• Augmenting and decreasing systems
• Comparable characterizations of four solutions for permission tree games
• Harsanyi power solutions for graph-restricted games
• THE MARGINAL OPERATORS FOR GAMES ON CONVEX GEOMETRIES
• scientific article; zbMATH DE number 970204 (Why is no real title available?)
• Bargaining power in communication networks
• On the convexity of games corresponding to sequencing situations with due dates.
• Peer group situations and games with fuzzy uncertainty
• Marginality and a characterization of the Owen graph value
• The probabilistic Harsanyi power solutions for probabilistic graph games
• Value of games with two-layered hypergraphs
• Consistency of the Owen value for TU-games with coalition and graph structures
• A new value for communication situations
• Political power on a line graph
• Graph-restricted games and their inheritance of properties
• Fair value distribution in cooperative committee election
• On cycle-free accessible union stable network structures
• On compromised value for cooperative games with graph communication structures
• Control by adding or deleting edges in graph-restricted weighted voting games
• Node centrality based on its edges importance: the position centrality
• Weighted simple games and the topology of simplicial complexes
• A Shapley value for games with expanded coalitions
• Values of games with graph restricted communication and a priori unions
• Generalized form solutions of cooperative game with fuzzy coalition structure
• A Shapley distance in graphs
• On the convexity of communication games
• Values for interior operator games
• Accessibility in oriented networks
• The complexity of power indexes with graph restricted coalitions

This page was built for publication: Values of Graph-Restricted Games

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3796995)