The following pages link to Values of Graph-Restricted Games (Q3796995):
Displaying 50 items.
- A Banzhaf value for games with fuzzy communication structure: computing the power of the political groups in the European parliament (Q279484) (← links)
- Computing Banzhaf-Coleman and Shapley-Shubik power indices with incompatible players (Q298742) (← links)
- Values of games with weighted graphs (Q319060) (← links)
- An axiomatization of probabilistic Owen value for games with coalition structure (Q477465) (← links)
- Comparable characterizations of four solutions for permission tree games (Q523060) (← links)
- Harsanyi power solutions for graph-restricted games (Q532510) (← links)
- Value of games with two-layered hypergraphs (Q656788) (← links)
- Values of games with graph restricted communication and a priori unions (Q732923) (← links)
- Generalized form solutions of cooperative game with fuzzy coalition structure (Q780277) (← links)
- A Shapley distance in graphs (Q781912) (← links)
- On the convexity of communication games (Q811421) (← links)
- Values for interior operator games (Q816512) (← links)
- Accessibility in oriented networks (Q869605) (← links)
- The complexity of power indexes with graph restricted coalitions (Q898757) (← links)
- The Shapley value of phylogenetic trees (Q938148) (← links)
- The core and the Weber set of games on augmenting systems (Q968126) (← links)
- Bargaining sets and the core in partitioning games (Q1022406) (← links)
- Axiomatizations of the Shapley value for games on augmenting systems (Q1041948) (← links)
- Communication and its cost in graph-restricted games (Q1107455) (← links)
- Restriction of simple games (Q1181760) (← links)
- Allocation rules for hypergraph communication situations (Q1185760) (← links)
- Games with permission structures: The conjunctive approach (Q1185765) (← links)
- Strongly balanced cooperative games (Q1189671) (← links)
- Coalition formation under limited communication (Q1194262) (← links)
- The Shapley value for cooperative games under precedence constraints (Q1202565) (← links)
- The \({\mathcal B}\)-nucleolus of TU-games (Q1268656) (← links)
- A note on voting (Q1277468) (← links)
- A value with incomplete communication (Q1279616) (← links)
- Consistent restricted Shapley values (Q1280087) (← links)
- Values of games with probabilistic graphs (Q1296512) (← links)
- An axiomatization of the disjunctive permission value for games with a permission structure (Q1357209) (← links)
- Restricted component additive games (Q1362677) (← links)
- Centrality and power in social networks: A game theoretic approach. (Q1402484) (← links)
- Graphs and (levels of) cooperation in games: two ways how to allocate the surplus (Q1642169) (← links)
- Values for cooperative games over graphs and games with inadmissible coalitions (Q1651251) (← links)
- Luxembourg in the early days of the EEC: null player or not? (Q1651910) (← links)
- Generalized additive games (Q1684121) (← links)
- The class of ASN-position values. Centrality and consequences of connection failure (Q1707110) (← links)
- Dynamics in matching and coalition formation games with structural constraints (Q1711887) (← links)
- Games with nested constraints given by a level structure (Q1714476) (← links)
- Monotonicity of power in weighted voting games with restricted communication (Q1758191) (← links)
- The \(cg\)-position value for games on fuzzy communication structures (Q1795038) (← links)
- Cooperative games on antimatroids (Q1827722) (← links)
- \(\Gamma\)-component additive games (Q1893193) (← links)
- Games and cooperation indices (Q1896694) (← links)
- Hierarchical organization structures and constraints on coalition formation (Q1897341) (← links)
- A simple procedure to compute the nucleolus of \(\Gamma\)-component additive games (Q1919115) (← links)
- The Myerson value and superfluous supports in union stable systems (Q1935304) (← links)
- Games induced by the partitioning of a graph (Q1945082) (← links)
- Values and potential of games with cooperation structure (Q1972566) (← links)
