Activity selection games and the minimum‐cut problem

DOI10.1002/net.3230130106zbMath0504.90092OpenAlexW2128805075MaRDI QIDQ4740362

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

selection problemShapley valuecorecooperative gameoptimal selectionconvex gamecapacitated networkminimum-cut problemactivity selection games

Mathematics Subject Classification ID

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

Related Items (8)

Activity optimization games with complementarity ⋮ Monotonicity of the core and value in dynamic cooperative games ⋮ Communication and its cost in graph-restricted games ⋮ 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 ⋮ Adjacency on polymatroids

Cites Work

• Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
• Unnamed Item

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