NTU LP games are introduced with proofs of core non-emptiness conditions, MIP-representability, co-NP-completeness of core membership, and a cutting-plane algorithm applied to Chicago bus planning.
Logist.14, 4 (1967), 453–460
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.GT 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Linear Production Games with Non-transferable Utilities
NTU LP games are introduced with proofs of core non-emptiness conditions, MIP-representability, co-NP-completeness of core membership, and a cutting-plane algorithm applied to Chicago bus planning.