A flow game is convex if and only if its network is acyclic with bottleneck exclusivity and capacity sufficiency, which is equivalent to dual separability.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.GT 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
A Complete Characterization of Convexity in Flow Games
A flow game is convex if and only if its network is acyclic with bottleneck exclusivity and capacity sufficiency, which is equivalent to dual separability.