Graphs and Cooperation in Games
From MaRDI portal
Publication:4187625
Recommendations
Cited in
(only showing first 100 items - show all)- Bargaining sets and the core in partitioning games
- Adaptive allocation rules for hypergraph games
- Graph sharing games: complexity and connectivity
- Allocation rules for multi-choice games with a permission tree structure
- Indirect control and power in mutual control structures
- The position value and the structures of graphs
- Efficient quotient extensions of the Myerson value
- The Shapley value of phylogenetic trees
- A polynomial time algorithm for computing the nucleolus for a class of disjunctive games with a permission structure
- The river sharing problem: a survey
- A system-theoretic model for cooperation, interaction and allocation
- The covering values for acyclic digraph games
- A value for communication situations with players having different bargaining abilities
- The Banzhaf value for generalized probabilistic communication situations
- The Myerson value for directed graph games
- Some properties for probabilistic and multinomial (probabilistic) values on cooperative games
- Efficient extensions of the Myerson value
- On benefits of cooperation under strategic power
- Complexity and stochastic evolution of dyadic networks
- The efficient proportional Myerson values
- Generating functions of weighted voting games, MacMahon's partition analysis, and Clifford algebras
- Measuring the difficulties in forming a coalition government
- Coalition structure value considering the outside alignment option of priori coalition
- Convexity of graph-restricted games induced by minimum partitions
- Coordination games on graphs
- Union negotiations: complement-associated games
- Characterizations of the core of TU and NTU games with communication structures
- Values for interior operator games
- On reward sharing in blockchain mining pools
- The restricted core of games on distributive lattices: how to share benefits in a hierarchy
- Network topology, higher orders of stability and efficiency
- Explanation with the winter value: efficient computation for hierarchical Choquet integrals
- Preface: DGAA focused issue on dynamic games and social networks
- Strongly balanced cooperative games
- Information-sharing in social networks
- Constrained coalition formation on valuation structures: formal framework, applications, and islands of tractability
- The Banzhaf value as a design tool in coalitional control
- The average tree solution for multi-choice forest games
- Path monotonicity, consistency and axiomatizations of some weighted solutions
- Solutions for cooperative games with a major player and a hierarchical structure
- Strong coalitional structure in an open vehicle routing game
- A discrete Choquet integral for ordered systems
- Hyperadditive games and applications to networks or matching problems
- The Shapley value for cooperative games with restricted worths
- The prenucleolus and the prekernel for games with communication structures
- scientific article; zbMATH DE number 7528221 (Why is no real title available?)
- Outside options in probabilistic coalition situations
- Implementation of weighted values in hierarchical and horizontal cooperation structures
- Outside options, component efficiency, and stability
- Matrix expression of Shapley value in graphical cooperative games
- Allocation of portfolio risk and outside options: which is the best coalition structure value to solve the low-risk anomaly?
- Varying weights of marginal contributions: one approach to solving the low-risk puzzle?
- Cooperative games with partial information
- Expected fair allocation in farsighted network formation
- Network structures with hierarchy and communication
- On axiomatizations of the Shapley value for assignment games
- Balanced consistency and balanced cost reduction for sequencing problems
- Games with fuzzy authorization structure: a Shapley value
- Contractually stable networks
- Cooperative game as non-additive measure
- The core and the Weber set of games on augmenting systems
- Interaction indices for games on combinatorial structures with forbidden coalitions
- Coalition formation and potential games
- A bi-average tree solution for probabilistic communication situations with fuzzy coalition
- Dual auctions for assigning winners and compensating losers
- Duality and anti-duality in TU games applied to solutions, axioms, and axiomatizations
- Volume of trade and dynamic network formation in two-sided economies
- The consistency and potential for values of games with coalition structure
- A core-allocation for a network restricted linear production game
- Axiomatic characterizations under players nullification
- The \(cg\)-average tree value for games on cycle-free fuzzy communication structures
- WEIGHTED MYERSON VALUE
- An approach via generating functions to compute power indices of multiple weighted voting games with incompatible players
- New characteristic function for cooperative games with hypergraph communication structure
- Potentials in cooperative TU-games
- The principle of balanced contributions and hierarchies of cooperation
- Communication and its cost in graph-restricted games
- Bargaining power in communication networks
- Population solidarity, population fair-ranking, and the egalitarian value
- Evaluating groups with the generalized Shapley value
- Efficient extensions of communication values
- Zoning of districts of the region according to the proximity to the external border
- Expected values for variable network games
- The Myerson value on local structures of coalitions
- Centrality measures in networks
- A note on a value with incomplete communication
- Allocating positions fairly: auctions and Shapley value
- Network disruption and the common-enemy effect
- Incomplete stable structures in symmetric convex games
- On the existence of efficient and fair extensions of communication values for connected graphs
- The in-group egalitarian Owen values
- Incomplete cooperative games with player-centered information
- Difference between the position value and the myerson value is due to the existence of coalition structures
- Component-wise proportional solutions for communication graph games
- A Banzhaf value for games with fuzzy communication structure: computing the power of the political groups in the European parliament
- The two-step average tree value for graph and hypergraph games
- Tree, web and average web values for cycle-free directed graph games
- The average tree permission value for games with a permission tree
- Power, cooperation indices and coalition structures
- The Egalitarian efficient extension of the Aumann-Drèze value
This page was built for publication: Graphs and Cooperation in Games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4187625)
