Allocation rules for network games
From MaRDI portal
Publication:2486155
Recommendations
Cites work
- A strategic model of social and economic networks
- Bidding for the surplus: a non-cooperative approach to the Shapley value
- Graphs and Cooperation in Games
- scientific article; zbMATH DE number 4172789 (Why is no real title available?)
- scientific article; zbMATH DE number 2096858 (Why is no real title available?)
- N‐person games in partition function form
- On the Position Value for Communication Situations
- On the reduced game property and its converse
- Stable networks
- Subscription mechanisms for network formation.
- The Nucleolus of a Characteristic Function Game
Cited in
(48)- The path player game
- Marginal contribution, reciprocity and equity in segregated groups: bounded rationality and self-organization in social networks
- A linear proportional effort allocation rule
- Values for cooperative games over graphs and games with inadmissible coalitions
- Roles of clustering coefficient for the network reconstruction
- Weighted allocation rules for standard fixed tree games
- Directed networks, allocation properties and hierarchy formation
- Forming efficient networks
- A value for communication situations with players having different bargaining abilities
- Probabilistic network values
- The Myerson value on local structures of coalitions
- Socially structured games
- A discrete cost sharing model with technological cooperation
- A value for generalized probabilistic communication situations
- Network potentials
- Bidding for surplus in network allocation problems
- Internal structure of coalitions in competitive and altruistic graphical coalitional games
- Network design in games with spillovers
- Impact of equity and equality on stability and collusion in a decentralized network
- A review on cost allocation methods in collaborative transportation
- A simple bargaining procedure for the Myerson value
- Bargaining power and value sharing in distribution networks: a cooperative game theory approach
- A solution concept for network games: the role of multilateral interactions
- Connectivity and Allocation Rule in a Directed Network
- scientific article; zbMATH DE number 3922356 (Why is no real title available?)
- Expected fair allocation in farsighted network formation
- Coalitional stochastic stability
- Allocation rules for games with optimistic aspirations
- Stable and efficient coalitional networks
- Outside option values for network games
- A simple family of solutions for forest games
- Cooperative game as non-additive measure
- Influence functions, followers and command games
- LINK MONOTONIC ALLOCATION SCHEMES
- Comments on: Transversality of the Shapley value
- Network games and solutions from decomposition techniques
- The enemy of my enemy is my friend: new conditions for network games
- On the resolution of cross-liabilities
- Solidarity to achieve stability
- Expected values for variable network games
- Allocation rules for communication situations with incompatibilities
- The k-egalitarian Myerson values: characterizations and implementation
- Bidding for the surplus: realizing efficient outcomes in economic environments
- A comparison of the Myerson value and the position value
- An allocation rule for dynamic random network formation processes
- Fair allocation in networks with externalities
- Allocation rules for coalitional network games
- Flexible network rules for identified externalities
This page was built for publication: Allocation rules for network games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2486155)
