Pages that link to "Item:Q2576648"
From MaRDI portal
The following pages link to A characterization of the position value (Q2576648):
Displaying 35 items.
- Component-wise proportional solutions for communication graph games (Q277301) (← links)
- A solution concept for network games: the role of multilateral interactions (Q319240) (← links)
- Parameterized fairness axioms on cycle-free graph games (Q427375) (← links)
- Outside option values for network games (Q502371) (← links)
- Networked control design for coalitional schemes using game-theoretic methods (Q518344) (← links)
- Harsanyi power solutions for graph-restricted games (Q532510) (← links)
- Difference between the position value and the myerson value is due to the existence of coalition structures (Q532765) (← links)
- Graph monotonic values (Q647557) (← links)
- An allocation rule for dynamic random network formation processes (Q747347) (← links)
- A linear proportional effort allocation rule (Q1038269) (← links)
- The degree value for games with communication structure (Q1621730) (← links)
- Efficient extensions of communication values (Q1639272) (← links)
- Two-step values for games with two-level communication structure (Q1702838) (← links)
- The class of ASN-position values. Centrality and consequences of connection failure (Q1707110) (← links)
- Monotonicity of power in weighted voting games with restricted communication (Q1758191) (← links)
- An axiomatic characterization of the position value for network situations (Q1758195) (← links)
- The \(cg\)-position value for games on fuzzy communication structures (Q1795038) (← links)
- A probabilistic position value (Q1945080) (← links)
- The position value and the structures of graphs (Q2009536) (← links)
- Probabilistic network values (Q2243528) (← links)
- The average tree solution for cooperative games with communication structure (Q2268115) (← links)
- Marginality and Myerson values (Q2301968) (← links)
- The position value is the Myerson value, in a sense (Q2384722) (← links)
- Bidding for surplus in network allocation problems (Q2469856) (← links)
- The average tree solution for cycle-free graph games (Q2483116) (← links)
- Values for games with two-level communication structures (Q2636826) (← links)
- Adaptive allocation rules for hypergraph games (Q2670453) (← links)
- A coalitional control scheme with applications to cooperative game theory (Q2931073) (← links)
- A Note on the Position Value for Hypergraph Communication Situations (Q3297833) (← links)
- On the Position Value for Special Classes of Networks (Q4687455) (← links)
- Fuzzy Average Tree Solution for Graph Games with Fuzzy Coalitions (Q4982180) (← links)
- Power surplus solutions for weighted hypergraph communication situations (Q6060660) (← links)
- Marginality and the position value (Q6168658) (← links)
- Expected values for variable network games (Q6573342) (← links)
- A new value for communication situations (Q6629535) (← links)