Activity selection games and the minimum‐cut problem
From MaRDI portal
Publication:4740362
DOI10.1002/net.3230130106zbMath0504.90092MaRDI QIDQ4740362
Publication date: 1983
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.3230130106
selection problem; Shapley value; core; cooperative game; optimal selection; convex game; capacitated network; minimum-cut problem; activity selection games
90C35: Programming involving graphs or networks
90C10: Integer programming
91A12: Cooperative games
90B10: Deterministic network models in operations research
91A40: Other game-theoretic models
Related Items
A bankruptcy problem and an information trading problem: Applications tok-convex games, Cooperative games arising from network flow problems, Two algorithms for maximizing a separable concave function over a polymatroid feasible region, Paths on polymatroids