Activity selection games and the minimum‐cut problem

DOI10.1002/NET.3230130106MaRDI QIDQ4740362zbMATH OpenOpenAlexFDO

Authors Donald M. Topkis

Publication date 1983

Published in Networks (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/net.3230130106

zbMATH Keywords

activity selection gamescapacitated networkconvex gamecooperative gamecoreminimum-cut problemoptimal selectionselection problemShapley value

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Integer programming (90C10) Programming involving graphs or networks (90C35) Cooperative games (91A12) Other game-theoretic models (91A40)

Cites work

• scientific article; zbMATH DE number 3078997 (Why is no real title available?)
• Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems

Cited in

(8)

• Activity optimization games with complementarity
• Communication and its cost in graph-restricted games
• Cooperative games arising from network flow problems
• Two algorithms for maximizing a separable concave function over a polymatroid feasible region
• Paths on polymatroids
• Monotonicity of the core and value in dynamic cooperative games
• Adjacency on polymatroids
• A bankruptcy problem and an information trading problem: Applications tok-convex games

This page was built for publication: Activity selection games and the minimum‐cut problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4740362)