Values of Graph-Restricted Games
From MaRDI portal
Publication:3796995
DOI10.1137/0607025zbMath0651.90109OpenAlexW1984552109MaRDI QIDQ3796995
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
Shapley valuepower indicesBanzhaf-Coleman valuegame on a graphconnected partial graphslines of communication
Related Items (88)
A Banzhaf value for games with fuzzy communication structure: computing the power of the political groups in the European parliament ⋮ A Shapley value for games with restricted coalitions ⋮ The socially stable core in structured transferable utility games ⋮ New Characteristic Function for Cooperative Games with Hypergraph Communication Structure ⋮ Allocation rules for cooperative games with restricted communication and a priori unions based on the Myerson value and the average tree solution ⋮ Computing Banzhaf-Coleman and Shapley-Shubik power indices with incompatible players ⋮ \(\Gamma\)-component additive games ⋮ Networks, Communication and Hierarchy: Applications to Cooperative Games ⋮ Games and cooperation indices ⋮ Values of games with weighted graphs ⋮ Graphs and (levels of) cooperation in games: two ways how to allocate the surplus ⋮ Hierarchical organization structures and constraints on coalition formation ⋮ Component efficient solutions in line-graph games with applications ⋮ An axiomatization of the disjunctive permission value for games with a permission structure ⋮ Monotonicity of the core and value in dynamic cooperative games ⋮ Luxembourg in the early days of the EEC: null player or not? ⋮ Communication and its cost in graph-restricted games ⋮ Restricted component additive games ⋮ Accessibility in oriented networks ⋮ A simple procedure to compute the nucleolus of \(\Gamma\)-component additive games ⋮ Inheritance of convexity for the \(\mathcal{P}_{\min}\)-restricted game ⋮ Decomposition of network communication games ⋮ NETWORK TOPOLOGY, HIGHER ORDERS OF STABILITY AND EFFICIENCY ⋮ A Banzhaf value for games with a proximity relation among the agents ⋮ Adaptive allocation rules for hypergraph games ⋮ Consistency and the graph Banzhaf value for communication graph games ⋮ Generalized additive games ⋮ Peer group situations and games with fuzzy uncertainty ⋮ The Myerson value and superfluous supports in union stable systems ⋮ Marginality and a characterization of the Owen graph value ⋮ The complexity of power indexes with graph restricted coalitions ⋮ Centrality and power in social networks: A game theoretic approach. ⋮ A value for generalized probabilistic communication situations ⋮ The probabilistic Harsanyi power solutions for probabilistic graph games ⋮ Games induced by the partitioning of a graph ⋮ 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 ⋮ Value of games with two-layered hypergraphs ⋮ Power indices expressed in terms of minimal winning coalitions ⋮ An axiomatization of probabilistic Owen value for games with coalition structure ⋮ Values and potential of games with cooperation structure ⋮ Restriction of simple games ⋮ The Shapley value of phylogenetic trees ⋮ Allocation rules for hypergraph communication situations ⋮ Games with permission structures: The conjunctive approach ⋮ Strongly balanced cooperative games ⋮ A value for communication situations with players having different bargaining abilities ⋮ The Banzhaf value for generalized probabilistic communication situations ⋮ Coalition formation under limited communication ⋮ The Shapley value for cooperative games with restricted worths ⋮ Comparable characterizations of four solutions for permission tree games ⋮ ON THE COMPLEXITY OF COMPUTING VALUES OF RESTRICTED GAMES ⋮ The core of games on ordered structures and graphs ⋮ The Shapley value for cooperative games under precedence constraints ⋮ Monotonicity of power in weighted voting games with restricted communication ⋮ Harsanyi power solutions for graph-restricted games ⋮ The average tree solution for cycle-free graph games ⋮ Bargaining power in communication networks ⋮ The core and the Weber set of games on augmenting systems ⋮ A unified approach to the myerson value and the position value ⋮ A note on a value with incomplete communication ⋮ Cooperative games with partial information ⋮ On the convexity of games corresponding to sequencing situations with due dates. ⋮ The \(cg\)-position value for games on fuzzy communication structures ⋮ Values of games with graph restricted communication and a priori unions ⋮ Augmenting and Decreasing Systems ⋮ THE MARGINAL OPERATORS FOR GAMES ON CONVEX GEOMETRIES ⋮ Multilateral Bargaining in Networks: On the Prevalence of Inefficiencies ⋮ The \({\mathcal B}\)-nucleolus of TU-games ⋮ Bargaining sets and the core in partitioning games ⋮ A note on voting ⋮ A value with incomplete communication ⋮ Consistent restricted Shapley values ⋮ Cooperative games on antimatroids ⋮ The average tree value for hypergraph games ⋮ Axiomatizations of the Shapley value for games on augmenting systems ⋮ Generalized form solutions of cooperative game with fuzzy coalition structure ⋮ A Shapley distance in graphs ⋮ SOME OPEN PROBLEMS IN SIMPLE 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 ⋮ Values for transferable utility games with coalition and graph structure ⋮ Harsanyi power solutions for games on union stable systems ⋮ Cooperation when some players are incompatible ⋮ On the convexity of communication games ⋮ Values for interior operator games
Cites Work
This page was built for publication: Values of Graph-Restricted Games
