The following pages link to Values of Graph-Restricted Games (Q3796995):
Displaying 44 items.
- The Shapley value for cooperative games with restricted worths (Q1995911) (← links)
- Cooperative games with partial information (Q2021800) (← links)
- The average tree value for hypergraph games (Q2074839) (← links)
- Measuring power in coalitional games with friends, enemies and allies (Q2093400) (← links)
- Spatial games and endogenous coalition formation (Q2095954) (← links)
- The nucleolus and inheritance of properties in communication situations (Q2095955) (← links)
- Allocation rules for cooperative games with restricted communication and a priori unions based on the Myerson value and the average tree solution (Q2136167) (← links)
- A value for communication situations with players having different bargaining abilities (Q2241248) (← links)
- The Banzhaf value for generalized probabilistic communication situations (Q2241252) (← links)
- Values for transferable utility games with coalition and graph structure (Q2343068) (← links)
- Harsanyi power solutions for games on union stable systems (Q2348763) (← links)
- A Shapley value for games with restricted coalitions (Q2366098) (← links)
- The socially stable core in structured transferable utility games (Q2371152) (← links)
- Component efficient solutions in line-graph games with applications (Q2385112) (← links)
- Decomposition of network communication games (Q2407987) (← links)
- A Banzhaf value for games with a proximity relation among the agents (Q2411264) (← links)
- A value for generalized probabilistic communication situations (Q2427196) (← links)
- Power indices expressed in terms of minimal winning coalitions (Q2453423) (← links)
- The average tree solution for cycle-free graph games (Q2483116) (← links)
- A unified approach to the myerson value and the position value (Q2487770) (← links)
- A note on a value with incomplete communication (Q2491883) (← links)
- Monotonicity of the core and value in dynamic cooperative games (Q2641231) (← links)
- Inheritance of convexity for the \(\mathcal{P}_{\min}\)-restricted game (Q2661754) (← links)
- Adaptive allocation rules for hypergraph games (Q2670453) (← links)
- Consistency and the graph Banzhaf value for communication graph games (Q2670501) (← links)
- Some open problems in simple games (Q2854004) (← links)
- NETWORK TOPOLOGY, HIGHER ORDERS OF STABILITY AND EFFICIENCY (Q2941050) (← links)
- ON THE COMPLEXITY OF COMPUTING VALUES OF RESTRICTED GAMES (Q3021974) (← links)
- Cooperation when some players are incompatible (Q3142159) (← links)
- Multilateral Bargaining in Networks: On the Prevalence of Inefficiencies (Q4971558) (← links)
- New Characteristic Function for Cooperative Games with Hypergraph Communication Structure (Q5048468) (← links)
- Networks, Communication and Hierarchy: Applications to Cooperative Games (Q5057948) (← links)
- Augmenting and Decreasing Systems (Q5215352) (← links)
- THE MARGINAL OPERATORS FOR GAMES ON CONVEX GEOMETRIES (Q5470120) (← links)
- Cooperation and communication restrictions: A survey (Q5688334) (← links)
- The core of games on ordered structures and graphs (Q5902298) (← links)
- Bargaining power in communication networks (Q5932218) (← links)
- On the convexity of games corresponding to sequencing situations with due dates. (Q5953347) (← links)
- Peer group situations and games with fuzzy uncertainty (Q6065159) (← links)
- Marginality and a characterization of the Owen graph value (Q6113210) (← links)
- The probabilistic Harsanyi power solutions for probabilistic graph games (Q6181239) (← links)
- Consistency of the Owen value for TU-games with coalition and graph structures (Q6588517) (← links)
- A new value for communication situations (Q6629535) (← links)
- Political power on a line graph (Q6637512) (← links)
