On the Position Value for Communication Situations
From MaRDI portal
Recommendations
- The position value in communication structures.
- A modified position value for communication situations and its fuzzification
- On the position value for communication situations with fuzzy coalition
- A note on the position value for hypergraph communication situations
- Characterizations of the position value for hypergraph communication situations
- A value for generalized probabilistic communication situations
- The position value and the Myerson value for hypergraph communication situations
- scientific article; zbMATH DE number 67445
- The Banzhaf value and communication situations
- Efficient extensions of communication values
Cited in
(only showing first 100 items - show all)- Networks and outside options
- LINK MONOTONIC ALLOCATION SCHEMES
- The \(\alpha \)-egalitarian Myerson value of games with communication structure
- Networked control design for coalitional schemes using game-theoretic methods
- Two-step values for games with two-level communication structure
- Stabilization of the Shapley value for cooperative games through level-induced structures
- Multilateral bargaining in networks: on the prevalence of inefficiencies
- The class of ASN-position values. Centrality and consequences of connection failure
- Average tree solutions and the distribution of Harsanyi dividends
- ON THE COMPLEXITY OF COMPUTING VALUES OF RESTRICTED GAMES
- Simple games on closure spaces
- Bidding for surplus in network allocation problems
- A unified approach to the myerson value and the position value
- Values for cooperative games with a prior unions and a communication graph based on combined effects
- Communication situations with asymmetric players.
- Uncertain production environment and communication structure
- Coalitional games for networked controllers with constraints on semivalues: a randomized design approach
- A note on the position value for hypergraph communication situations
- On the position value for special classes of networks
- Adaptive allocation rules for hypergraph games
- The position value and the structures of graphs
- A system-theoretic model for cooperation, interaction and allocation
- 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
- Characterizations of the position value for hypergraph communication situations
- Values for interior operator games
- The Banzhaf value as a design tool in coalitional control
- scientific article; zbMATH DE number 7528221 (Why is no real title available?)
- Implementation of weighted values in hierarchical and horizontal cooperation structures
- Cooperative games with partial information
- 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
- A bi-average tree solution for probabilistic communication situations with fuzzy coalition
- A core-allocation for a network restricted linear production game
- Pseudo-Shapley value for weak games of threats
- Bargaining power in communication networks
- Efficient extensions of communication values
- Expected values for variable network games
- A note on a value with incomplete communication
- The position value in communication structures.
- Average tree solution in multi-agent systems with network structure
- 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
- The Myerson value and superfluous supports in union stable systems
- Parameterized fairness axioms on cycle-free graph games
- The effects of excluding coalitions
- The degree value for games with communication structure
- On the convexity of communication games
- A simple procedure to compute the nucleolus of \(\Gamma\)-component additive games
- Weighted simple games and the topology of simplicial complexes
- The Banzhaf value and communication situations
- Probabilistic network values
- The core of cooperative differential games on networks
- Directed networks, allocation properties and hierarchy formation
- Monotonicity of power in weighted voting games with restricted communication
- A value with incomplete communication
- Axiomatization of an allocation rule for ordered tree TU-games
- The core of games on convex geometries
- Cooperative games on antimatroids
- The average tree value for hypergraph games
- Node centrality based on its edges importance: the position centrality
- A coalitional control scheme with applications to cooperative game theory
- Power surplus solutions for weighted hypergraph communication situations
- A solution concept for network games: the role of multilateral interactions
- An axiomatization of the disjunctive permission value for games with a permission structure
- The Myerson value for complete coalition structures
- Values and potential of games with cooperation structure
- On the position value for communication situations with fuzzy coalition
- The \(\chi\) value and team games
- Luxembourg in the early days of the EEC: null player or not?
- Harsanyi power solutions for games on union stable systems
- Axiomatizations of the Shapley value for games on augmenting systems
- The probabilistic Harsanyi power solutions for probabilistic graph games
- The position value is the Myerson value, in a sense
- An allocation rule for dynamic random network formation processes
- The average tree solution for cooperative games with communication structure
- Axioms for the Shapley value on convex geometries
- A characterization of the average tree solution for tree games
- A note on voting
- The complexity of power indexes with graph restricted coalitions
- Comparable axiomatizations of the average tree solution and the Myerson value
- Marginality and the position value
- A linear proportional effort allocation rule
- A new value for communication situations
- Fuzzy Average Tree Solution for Graph Games with Fuzzy Coalitions
- The cg-position value for games on fuzzy communication structures
- The average tree solution for cycle-free graph games
- Allocation rules for network games
- A position value for multigraphs
- Graph-restricted games and their inheritance of properties
- Cost allocation and communication
- The center value: a sharing rule for cooperative games on acyclic graphs
- A simple bargaining procedure for the Myerson value
- Shapley value of a cooperative game with fuzzy set of feasible coalitions
- The generalized position values for communication games with coalition configuration
- Associated consistency, value and graphs
- THE MARGINAL OPERATORS FOR GAMES ON CONVEX GEOMETRIES
- Fair link contributions for values of network cooperative games
This page was built for publication: On the Position Value for Communication Situations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4018842)
