On Some Network Flow Games
From MaRDI portal
Publication:4027792
Recommendations
Cited in
(37)- Bargaining sets and the core in partitioning games
- The least-core of threshold network flow games
- Network flow problems and permutationally concave games
- Symmetrically multilateral-bargained allocations in multi-sided assignment markets
- Another proof that assignment games have singleton cores only if multiple optimal matchings exist
- Stable families of coalitions for network resource allocation problems
- Hyperadditive games and applications to networks or matching problems
- Vertical syndication-proof competitive prices in multilateral assignment markets
- Cooperative networks games with elastic demands
- The nucleolus of balanced simple flow networks
- On the dimension of the core of the assignment game
- An algorithm to compute the nucleolus of shortest path games
- Social enterprise tree network games
- (Pre)kernel catchers for cooperative games
- Relative nucleolus of flow game on a simple network
- On the core of network synthesis games
- An algorithm for finding the nucleolus of assignment games
- The cooperative game theory foundations of network bargaining games
- The complexity of the nucleolus in compact games
- The kernel is in the least core for permutation games
- Social exchange networks with distant bargaining
- Threshold based discounting networks: the cost allocation provided by the nucleolus
- On -roughly weighted games
- scientific article; zbMATH DE number 4027222 (Why is no real title available?)
- A note on Steiner tree games
- Extended cooperative networks games
- The bargaining set of a large game
- Operations research games: A survey. (With comments and rejoinder)
- Buyer-Supplier Games: Optimization over the Core
- Cooperative solutions for the Eurasian gas network
- Modeling cooperation on a class of distribution problems
- On bargaining sets of supplier-firm-buyer games
- The assignment problem as a cooperative game
- Tarification par des jeux Coopératifs avec Demandes Élastiques
- Multi-sided assignment games on \(m\)-partite graphs
- A note on the nucleolus and the kernel of the assignment game
- On the core and nucleolus of directed acyclic graph games
This page was built for publication: On Some Network Flow Games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4027792)