The nucleolus of balanced simple flow networks

DOI10.1016/j.geb.2004.08.008zbMath1129.91006OpenAlexW2042923780MaRDI QIDQ817277

Hans Reijnierse, Jos A. M. Potters, Amit K. Biswas

Publication date: 8 March 2006

Published in: Games and Economic Behavior (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.geb.2004.08.008

zbMATH Keywords

potentialbalancednesscorecooperative game theorynucleolusflow network

Mathematics Subject Classification ID

Cooperative games (91A12) Games involving graphs (91A43) Deterministic network models in operations research (90B10)

Related Items (14)

On the lexicographic centre of multiple objective optimization ⋮ Finding the nucleoli of large cooperative games ⋮ The Least-Core and Nucleolus of Path Cooperative Games ⋮ On the complexity of nucleolus computation for bipartite \(b\)-matching games ⋮ Computing the least-core and nucleolus for threshold cardinality matching games ⋮ Finding and verifying the nucleolus of cooperative games ⋮ Finding nucleolus of flow game ⋮ An algorithm to compute the nucleolus of shortest path games ⋮ The nucleolus of arborescence games in directed acyclic graphs ⋮ Path cooperative games ⋮ Computing the nucleolus of weighted cooperative matching games in polynomial time ⋮ Network strength games: the core and the nucleolus ⋮ Network disconnection games: a game theoretic approach to checkpoint evaluation in networks ⋮ Sharing costs in highways: a game theoretic approach

Cites Work

• Unnamed Item
• Unnamed Item
• On balanced games and games with committee control
• The general nucleolus and the reduced game property
• The \({\mathcal B}\)-nucleolus of TU-games
• On computational complexity of membership test in flow games and linear production games
• Simple flow games
• Maximal Flow Through a Network
• Totally Balanced Games and Games of Flow
• On Some Network Flow Games

This page was built for publication: The nucleolus of balanced simple flow networks