Pith. sign in

REVIEW 3 major objections 5 minor 45 references

Linear Production Games with Non-transferable Utilities

T0 review · 3 major / 5 minor · reviewed 2026-08-07 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗

Pith's one-line read A new model shows when cooperation on public goods can fail, and why checking for stable deals is computationally hard.

desk verdict New NTU LP game framework with solid structural results and a sharp co-NP-completeness theorem; the Chicago case study is unconverged and does not support the abstract's cooperation claims. read the letter →

arxiv 2506.05251 v3 pith:3PLMBMFG submitted 2025-06-05 cs.GT math.OC

J. Carlos Martínez Mori , Alejandro Toriello This is my paper
classification cs.GTmath.OC MSC 91A1291A4090C0590C2768Q17
keywords cooperativegametheorynon-transferableutilitylinearproductiongamescorenon-emptinessco-NP-completenesscuttingplanealgorithmpublicgoodstransitserviceplanning
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

This paper introduces NTU LP games, a cooperative game model where players pool resources to produce public goods but each player values the goods differently and utilities are not transferable. The authors aim to characterize when stable outcomes—points in the core that no coalition can improve upon—exist, and how hard it is to find or verify them. They prove that non-empty cores are guaranteed under fairly general conditions, but that deciding whether a proposed utility allocation is in the core is co-NP-complete, meaning it is provably hard to verify in general even for very simple instances. Along the way they develop a cutting-plane algorithm for optimizing social welfare over the core. The practical motivation is a Chicago bus case showing that cooperative stability can come with counterintuitive and sometimes adverse distributive consequences.

What carries the argument

The central object is the utility space $U(S)$, the set of utility vectors a coalition $S$ can achieve by pooling its resources and producing a feasible mixture of public goods, with each player's utility linear in the produced goods. The core $C(N)$ is the subset of grand-coalition utility vectors not strictly dominated by any coalition. The key mechanisms are the classic balancedness condition, adapted to these games via dual cones of the design spaces to yield non-empty cores, and a reduction from three-dimensional perfect matching that forces any blocking coalition to correspond exactly to a perfect matching, proving co-NP-completeness of core membership. A cutting-plane algorithm then works in the extended design-utility space, using intersection cuts obtained from blocking coalitions, to approximate optimal core points.

What would settle it

Find an instance of an NTU LP game that satisfies the dual-cone condition of Theorem 3.3 but whose core is empty; or exhibit a polynomial-time algorithm that decides core membership for all instances with $|K|=1$, $A$ a row of ones, $b_i=1$, $v^i \ge 0$, and $u^*_i=1$ for all $i$; or run Algorithm 1 on a small instance where it fails to terminate or returns a point outside the core despite the theoretical convergence argument.

Watch

Extended reading notes

Core claim

The paper's central claim is that the core of an NTU LP game, although non-empty under broad conditions, is structurally and computationally hard to work with. In particular, Theorem 3.3 gives sufficient conditions for non-emptiness: if every player's valuation vector lies in the dual cone of every coalition's design space, then the game is balanced and the core is non-empty. A simple corollary is that non-negative valuations always yield a non-empty core. But the paper also proves that checking whether a given utility vector is in the core is co-NP-complete (i.e., the complementary "not in the core" problem is NP-complete), even when there is a single resource, the production matrix is a row of ones, each player has one unit of resource, valuations are non-negative, and the test vector is the all-ones vector. The proof reduces from three-dimensional perfect matching. In addition, when the core is non-empty it is representable as a union of finitely many polytopes, hence representable by mixed-integer programming, and the paper develops a cutting-plane algorithm using intersection cuts to optimize linear social-welfare objectives subject to core membership. A case study on Chicago bus frequency setting shows that imposing cooperation can lower both maximin and utilitarian welfare while blocking some highly concentrated service plans.

Load-bearing premise

The model assumes each player's utility for a design is a linear function of the produced goods, $u_i(x) = (v^i)^\top x$, and that utilities are not transferable; if utilities were nonlinear or concave, the core could be non-empty in different regimes and the distributive conclusions would not necessarily hold.

Editorial extensions

If this is right

  • Any public agency that optimizes a service plan without regard to coalitional opposition may produce a plan that coalition members can credibly block and improve upon, so cooperative stability is a necessary constraint for practical deployment.
  • In general, recognizing whether a proposed solution is stable is computationally intractable, so heuristics and approximation are unavoidable for large-scale problems such as the Chicago bus case.
  • Service plans selected under core constraints can be qualitatively different from unconstrained optima, for example shifting resources from suburban trunk lines toward high-density corridors with mutually compatible demand.
  • Cooperation can reduce the intended social welfare, as measured by either maximin or utilitarian objectives, while still being the only realistically implementable option.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • If utilities are concave rather than linear, the core characterization and the distributive conclusions may change; the paper itself notes that linear utilities cannot model diminishing returns and that the concentration of the utilitarian plan is a polyhedral artifact of linearity.
  • The co-NP-completeness result suggests that even approximate verification of stability is hard, so practical methods will need to rely on certificates produced by algorithms that exploit problem-specific structure or on approximate core concepts with additive or multiplicative tolerances.
  • The cutting-plane framework could extend to NTU games where each coalition's feasible set is a more general convex or mixed-integer program, provided the relevant separation problems remain tractable.
  • The Chicago case study hints that policy recommendations about flat versus differentiated fares could be revisited within this cooperative framework, since coalitional threats may hinge on how riders with similar preferences cluster.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

3 major / 5 minor

Summary. The paper introduces non-transferable utility linear production (NTU LP) games, in which players with linear valuations and resource endowments pool resources to produce public goods, and the core is defined through utility spaces. It proves sufficient conditions for non-emptiness of the core via dual cones (Theorem 3.3), MIP-representability of the core when nonempty (Theorem 3.7), and co-NP-completeness of core membership even for a single resource, unit endowments, nonnegative valuations, and an all-ones target utility vector (Theorem 3.8, by reduction from 3DM). It then proposes a cutting-plane algorithm (Algorithm 1) and applies it to a Chicago bus frequency-setting case study, concluding that cooperation is necessary for deployment and can have adverse distributive implications. The case study's final service plans, however, are explicitly not in the core after 100 iterations, which weakens the applied conclusions.

Significance. The theoretical results are a meaningful extension of Owen's linear production games to NTU settings. The proof of Theorem 3.3 is a clean dual-cone argument; Theorem 3.8 is an explicit and apparently sound 3DM reduction with two structural lemmas; Theorem 3.7 gives a useful representability statement. The paper also makes its code and data available, which supports reproducibility. The applied contribution is considerably weaker: the final service plans are not verified core allocations, and the linear-utility assumption is acknowledged to produce at least one 'polyhedral artifact.' If the theoretical results are the focus, the paper is publishable after revision; the empirical claims need to be substantially reframed or supported by stronger computational evidence.

major comments (3)
  1. [Section 4.4 / Fig. 6] The abstract and Section 1.2 claim that cooperation is necessary for successful deployment and can have adverse distributive implications, and Figures 3–5 are presented as evidence. However, Section 4.4 explicitly states that the incumbent solutions after 100 iterations are 'not formally in the core' and that multiplicative least objections remain in the neighborhood of 2. A plan against which a coalition can roughly double its members' utility is still blockable and is not a cooperative equilibrium outcome. Consequently, the utility shifts in Figure 4 and the welfare tradeoffs in Figure 5 cannot be attributed to the effect of imposing core stability; they may be artifacts of premature termination or of the specific cut-generation heuristic. The authors should either establish, exactly or with a certified approximation, that the reported plans are core allocations, or recast the case study as a heuristic exploration and soften the strong policy conclusion.
  2. [Section 3.3.2 / Algorithm 1] The finite-convergence discussion after Theorem 3.17 is not a proof. It asserts that a depth lower bound follows from boundedness of P' and the loop condition ϵ(u*)>δ, and it invokes Porembski's theorem without checking its hypotheses. As written, Algorithm 1 is best described as a heuristic with an informal termination argument, not as a finitely convergent algorithm. This distinction matters because the case study uses exactly this algorithm and stops at 100 iterations without reaching the core; the paper should state the algorithm's status precisely and, if a finite-convergence theorem is intended, supply the required hypotheses and a proof.
  3. [Section 4.4 / Eq. (2)] The case study's distributive conclusions rest on the linear utility assumption u_i(x)=(v_i)^T x. The authors themselves note in Section 4.4 that linear utilities cannot capture diminishing returns and that the utilitarian plan's concentration is a 'polyhedral artifact' of this assumption. Since the case study is the only empirical support for the abstract's general claim that cooperation 'may also have adverse or counterintuitive distributive implications,' the conclusion should be explicitly restricted to the linear-utility model; with concave utilities, the core and the distributive effects could change qualitatively, as the authors also acknowledge in Section 5.
minor comments (5)
  1. [Section 3.3.2 / Lemma 3.15] The proof states that a convex combination of at most J+N distinct points can be used, but Carathéodory's theorem in R^{J+N} gives at most J+N+1 points; the argument is unaffected if the bound is corrected.
  2. [Section 3.2.1 / Theorem 3.3] The symbol S is used both for the balanced collection and for a coalition in that collection; using a different script (e.g., \mathcal{S}) for the collection would remove ambiguity.
  3. [Section 3.2.3 / proof of Theorem 3.8] The co-NP certificate is described as a pair (S, u^S); since u^S may not have a succinct description, it is cleaner to define the certificate as a coalition S and a rational design x^S ∈ X(S) with (v_i)^T x^S > u^*_i for all i ∈ S.
  4. [Example 3.11] The notation v_i^j = t_i^j is ambiguous; assuming all players share the same valuation, it should be written as v_i^j = t_j or equivalent.
  5. [Figures 6 and 7] The figures would benefit from explicit axis labels and units, since the reader cannot otherwise assess the magnitudes of the reported multiplicative objections and basis condition numbers.

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity: all claimed results are derived from explicitly stated assumptions and standard external theorems, with no fitted parameter renamed as a prediction.

full rationale

The paper's derivation chain is self-contained rather than circular. Theorem 3.3's balancedness condition follows from the definition of the dual cone X^*(S) and a direct convex-combination argument over balanced collections; Corollary 3.4 is an immediate application. Theorem 3.7's MIP-representability uses Lemma 3.6 and the external result of Jeroslow and Lowe (1984), not an assumption of the conclusion. Theorem 3.8 is a standard Karp-style reduction from 3DM to core non-membership; the valuation fractions are part of the reduction gadget, not parameters fitted to the target instances, and the lemmas establish the iff relationship. The cutting-plane algorithm's convergence claim is qualified with a tolerance delta, and the paper explicitly acknowledges in Section 4.4 that after 100 iterations the incumbent solutions are not formally in the core, with multiplicative least objections near 2. That is a correctness or robustness caveat about the case study, not a circular derivation: the case study's empirical conclusions are weaker than the proved theorems and would remain unsupported even if the theory were circularity-free. The only self-citations (Toriello and Uhan references in Section 2) are literature positioning and carry no load in the proofs. No fitted parameter is later relabeled as a prediction, no definition is stated in terms of the target result, and no uniqueness theorem from the authors' prior work is invoked. Thus the circularity score is 0.

Assumptions & free parameters 2 free parameters · 4 assumptions · 0 invented entities

The structural results rely entirely on classical theorems (Scarf, Karp, Jeroslow-Lowe, McMullen) and the explicit assumption of bounded individual design spaces. No free parameter is fitted in any proof; the only hand-chosen numbers are in the illustrative case study and do not affect the central theoretical claims.

free parameters (2)
  • Accessibility thresholds (400 m and 1600 m) = 400, 1600
    Chosen from the transportation literature (Walker, 2024) in Section 4.1 to construct piecewise-linear walk-accessibility valuations. Not fitted to the case study data and not used in the structural theorems.
  • Trip sample size (1,430) = 1430
    Number of sampled ride-hailing trips retained after preprocessing in Section 4.2. A data collection choice, not a fitted constant; affects the empirical case study only.
assumptions (4)
  • standard math Scarf's balancedness theorem: a balanced NTU game has a non-empty core (Theorem 3.2).
    Invoked as the foundation for the sufficient conditions in Theorem 3.3. Classical result from Scarf (1967).
  • standard math Karp's NP-completeness of 3-dimensional perfect matching.
    Used as the source problem in the co-NP-completeness reduction of Theorem 3.8.
  • standard math Jeroslow-Lowe theorem: finite unions of polytopes are MIP-representable.
    Used in the proof of Theorem 3.7 to conclude that a finite union of polytopes is MIP-representable.
  • domain assumption Individual design spaces X({i}) are non-empty and bounded for all players i.
    Stated in Section 3.2 to ensure X(S) is a non-empty polytope for every coalition S. The authors note this holds, for example, when all resource endowments b_i are non-negative.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Linear Production Games with Non-transferable Utilities." pith.science (2026). https://pith.science/paper/3PLMBMFG

@misc{pith2026250605251,
  author       = {Pith},
  title        = {Pith review of: Linear Production Games with Non-transferable Utilities},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/3PLMBMFG}},
  note         = {Machine review of arXiv:2506.05251}
}
read the original abstract

We introduce non-transferable utility linear production (NTU LP) games, a non-transferable utility analogue of classical linear production games, as a framework for the study of cooperative behavior in the production or establishment of public goods with pooled resources. NTU LP games combine the game-theoretic tensions inherent in public decision-making with the modeling flexibility of linear programming. We derive structural properties regarding the non-emptiness, representability and complexity of the core, a solution concept that models the viability of cooperation. In particular, we provide fairly general sufficient conditions under which the core of an NTU LP game is guaranteed to be non-empty, prove that determining membership in the core is co-NP-complete, and develop a cutting plane algorithm to optimize various social welfare objectives subject to core membership. We apply these results in a data-driven case study on service plan optimization for the Chicago bus system. As our study illustrates, cooperation is necessary for the successful deployment of transportation service plans and similar public goods, but it may also have adverse or counterintuitive distributive implications.

Figures

Figures reproduced from arXiv: 2506.05251 by the authors.

Figure 1
Figure 1. The A line is long and shown in orange, whereas the B line is short and shown in blue. The agency funds its operations strictly through fare-box recovery—no external funding is available. Each rider is charged a flat fare of $1.00. Thus, the agency must decide how to distribute its $3.00 budget among its two lines. One option is to not operate the B line at all, and to dedicate the entire budget to the operation of … view at source ↗
Figure 2
Figure 2. Illustration of the input data. In Figure 2a, the [PITH_FULL_IMAGE:figures/full_fig_p020_2.png] view at source ↗
Figure 3
Figure 3. Progression of maximin service plans toward a cooperative solution. The different bus [PITH_FULL_IMAGE:figures/full_fig_p022_3.png] view at source ↗
Figures from the paper (4 more)
Figure 4
Figure 4. Figure 4: Distributive implications of cooperation for the maximin and utilitarian service goals. [PITH_FULL_IMAGE:figures/full_fig_p023_4.png]
Figure 5
Figure 5. Figure 5: Social welfare implications of approaching a cooperative solution for the maximin and [PITH_FULL_IMAGE:figures/full_fig_p024_5.png]
Figure 6
Figure 6. Figure 6: Multiplicative least objections ϵ(u ∗ ) observed throughout the execution of Algorithm 1 [PITH_FULL_IMAGE:figures/full_fig_p025_6.png]
Figure 7
Figure 7. Figure 7: Condition numbers of the basis matrices observed throughout the execution of Algo [PITH_FULL_IMAGE:figures/full_fig_p025_7.png]

Discussion (0). Sign in to comment.

Reference graph

Works this paper leans on

45 extracted references · 33 canonical work pages

  1. [1]

    2019.Derailed: How Nashville’s Ambitious Transit Plan Crashed at the Polls—And What Other Cities Can Learn From It

    Zak Accuardi. 2019.Derailed: How Nashville’s Ambitious Transit Plan Crashed at the Polls—And What Other Cities Can Learn From It. Technical Report. TransitCenter, New York, NY. R. J. Aumann and B. Peleg

    work page 2019

  2. [13]

    Xin Chen and Jiawei Zhang

    A Stochastic Programming Duality Approach to Inventory Centralization Games.Operations Research57, 4 (2009), 840–851. Xin Chen and Jiawei Zhang

    work page 2009

  3. [16]

    Comput.39, 1 (2009), 195–259

    The complexity of com- puting a Nash equilibrium.SIAM J. Comput.39, 1 (2009), 195–259. doi:10.1137/070699652 Matt Dougherty. 2024.TCAT-Cornell Service Agreement Strains Operations, Threatens Community Routes. Ithaca Times.https://www.ithaca.com/news/ithaca/ tcat-cornell-service-agreement-strains-operations-threatens-community-routes/ article_f9c7aa00-12e0...

    doi:10.1137/070699652 2009

  4. [22]

    doi:10.1007/bfb0121015 Richard M

    Springer, Berlin Heidelberg, 167–184. doi:10.1007/bfb0121015 Richard M. Karp

    doi:10.1007/bfb0121015

  5. [31]

    doi:10.1112/S0025579300002850 Brentin Mock

    The maximum numbers of faces of a convex polytope.Mathematika17 (1970), 179–184. doi:10.1112/S0025579300002850 Brentin Mock. 2023.How Buckhead’s Secession From Atlanta Would Destabilize the Entire State. Bloomberg.https://www.bloomberg.com/news/articles/2023-03-02/ buckhead-secession-effort-threatens-financial-health-of-atlanta-region John F. Nash, Jr

    doi:10.1112/s0025579300002850 1970

  6. [35]

    Global Optim.20, 2 (2001), 113–136

    Finitely convergent cutting planes for concave minimization.J. Global Optim.20, 2 (2001), 113–136. doi:10.1023/A:1011240309783 Jasmine Robinson. 2024.Cobb and Gwinnett voters reject public transit ex- pansion proposed in ballot measures. WABE.https://www.wabe.org/ cobb-and-gwinnett-voters-reject-public-transit-expansion-proposed-in-ballot-measures/ Rick R...

    work page doi:10.1023/a:1011240309783 2001

  7. [37]

    Logist.14, 4 (1967), 453–460

    On balanced sets and cores.Naval Res. Logist.14, 4 (1967), 453–460. doi:10.1002/ nav.3800140404 Lloyd S. Shapley

    work page 1967

  8. [40]

    Res.61, 6 (2013), 1429–1434

    Technical note—on traveling salesman games with asym- metric costs.Oper. Res.61, 6 (2013), 1429–1434. doi:10.1287/opre.2013.1225 Alejandro Toriello and Nelson A. Uhan

    work page arXiv 2013

Show all 45 references
  1. [41]

    Dynamic cost allocation for economic lot sizing games.Oper. Res. Lett.42, 1 (2014), 82–84. doi:10.1016/j.orl.2013.12.005 Alejandro Toriello and Nelson A. Uhan

    2014 doi

  2. [42]

    Program.163, 1-2 (2017), 25–56

    Dynamic linear programming games with risk-averse play- ers.Math. Program.163, 1-2 (2017), 25–56. doi:10.1007/s10107-016-1054-y Hoang Tuy

    2017 doi

  3. [43]

    Concave programming under linear constraints.Doklady Akademii Nauk5 (1964), 1437–

    1964

  4. [44]

    doi:10.1137/130915303 John von Neumann and Oskar Morgenstern

    Mixed integer linear programming formulation techniques.SIAM Rev.57, 1 (2015), 3–57. doi:10.1137/130915303 John von Neumann and Oskar Morgenstern. 1944.Theory of Games and Economic Behavior. Princeton Uni- versity Press, Princeton, NJ. xviii+625 pages. Jarrett Walker. 2024.Hum...

    2015 doi

  5. [57]

    doi:10.1145/1516512.1516516 Xin Chen and Jiawei Zhang

  6. [1928]

    Neuer beweis f ¨ur die invarianz der dimensionszahl und des gebietes.Abh. Math. Sem. Univ. Hamburg6, 1 (1928), 265–272. doi:10.1007/BF02940617 Alejandro Toriello and Nelson A. Uhan

    1928 doi

  7. [1950]

    Equilibrium points inn-person games.Proc. Nat. Acad. Sci. U.S.A.36 (1950), 48–49. doi:10.1073/pnas.36.1.48 OpenStreetMap contributors. 2025.https://www.openstreetmap.org Guillermo Owen

    1950 doi

  8. [1959]

    Michel A

    Solutions to general non-zero-sum games.Contributions to the Theory of Games4, 40 (1959), 47–85. Michel A. Goemans and Martin Skutella

    1959

  9. [1960]

    Von Neumann-Morgenstern solutions to co-operative games without side payments.Bull. Amer. Math. Soc.66 (1960), 173–179. doi:10.1090/S0002-9904-1960-10418-1 Egon Balas

    1960 doi

  10. [1963]

    Ralf Bornd ¨orfer, Martin Gr¨otschel, and Marc E Pfetsch

    Some applications of the methods of linear programming to the theory of coop- erative games.Problemy Kibernet.10 (1963), 119–139. Ralf Bornd ¨orfer, Martin Gr¨otschel, and Marc E Pfetsch

    1963

  11. [1964]

    Equilibrium points of bimatrix games.J. Soc. Indust. Appl. Math.12 (1964), 413–423. Evangelos Markakis and Amin Saberi

    1964

  12. [1967]

    doi:10.2307/ 1909383 Lloyd S

    The core of anNperson game.Econometrica35 (1967), 50–69. doi:10.2307/ 1909383 Lloyd S. Shapley

    1967

  13. [1970]

    Some theorems on the core of ann-person game without side-payments.SIAM J. Appl. Math.18 (1970), 567–579. doi:10.1137/0118049 25 Geoff Boeing

    1970 doi

  14. [1971]

    19 (1971), 19–39

    Intersection cuts—a new type of cutting planes for integer programming.Operations Res. 19 (1971), 19–39. doi:10.1287/opre.19.1.19 Louis J. Billera

    1971 doi

  15. [1972]

    InComplexity of computer computa- tions (Proc

    Reducibility among combinatorial problems. InComplexity of computer computa- tions (Proc. Sympos., IBM Thomas J. Watson Res. Center, Yorktown Heights, N.Y., 1972). Plenum, New York- London, 85–103. Shiva Kintali, Laura J. Poplawski, Rajmohan Rajaraman, Ravi Sundaram, and Shang...

    1972

  16. [1973]

    InMathematical Programming, T

    On balanced games without side payments. InMathematical Programming, T. C. Hu and Stephen M. Robinson (Eds.). Academic Press, 261–290. doi:10.1016/B978-0-12-358350-5. 50012-9 E. Sperner

    doi

  17. [1975]

    Programming9, 3 (1975), 358–370

    On the core of linear production games.Math. Programming9, 3 (1975), 358–370. doi:10.1007/BF01681356 27 Christos H. Papadimitriou

    1975 doi

  18. [1981]

    doi:10.1007/BF00148459 Violet Xinying Chen and J

    Flat versus differentiated transit pricing: what’s a fair fare?Transportation10, 3 (1981), 211–232. doi:10.1007/BF00148459 Violet Xinying Chen and J. N. Hooker

    1981 doi

  19. [1994]

    On the complexity of the parity argument and other inefficient proofs of existence.J. Comput. System Sci.48, 3 (1994), 498–532. doi:10.1016/S0022-0000(05)80063-7 Bezalel Peleg and Peter Sudh ¨olter. 2007.Introduction to the theory of cooperative games(second ed.). Theory and D...

    1994 doi

  20. [2001]

    InComputing and combinatorics (Guilin, 2001)

    Membership for core of LP games and other games. InComputing and combinatorics (Guilin, 2001). Lecture Notes in Comput. Sci., Vol

    2001

  21. [2003]

    InProceedings of the 4th ACM Conference on Electronic Commerce

    On the Core of the Multicommodity Flow Game. InProceedings of the 4th ACM Conference on Electronic Commerce. ACM, New York, NY, 93–97. doi:10.1145/779928. 779940 Karel Martens

    doi

  22. [2004]

    Algorithms50, 2 (2004), 194–214

    Cooperative facility location games.J. Algorithms50, 2 (2004), 194–214. doi:10.1016/S0196-6774(03)00098-1SODA 2000 special issue. 26 Luyi Gui and ¨Ozlem Ergun

    2004 doi

  23. [2007]

    doi:10.1287/trsc.1060.0161 Ralf Bornd ¨orfer and Nam-D ˜ung Hoang

    A column-generation approach to line plan- ning in public transport.Transportation Science41, 1 (2007), 123–132. doi:10.1287/trsc.1060.0161 Ralf Bornd ¨orfer and Nam-D ˜ung Hoang

    2007

  24. [2008]

    InInternet and Network Economics (WINE 2008), Chris- tos Papadimitriou and Shuzhong Zhang (Eds.)

    Dual Payoffs, Core and a Collaboration Mechanism Based on Capacity Exchange Prices in Multicommodity Flow Games. InInternet and Network Economics (WINE 2008), Chris- tos Papadimitriou and Shuzhong Zhang (Eds.). Lecture Notes in Computer Science, Vol

    2008

  25. [2009]

    ACM56, 3 (2009), Art

    Settling the complexity of computing two-player Nash equilibria.J. ACM56, 3 (2009), Art. 14,

    2009

  26. [2011]

    Program.130, 1 (2011), 153–176

    Lexicography and degeneracy: can a pure cutting plane algorithm work?Math. Program.130, 1 (2011), 153–176. doi:10.1007/s10107-009-0335-0 28

    2011 doi

  27. [2012]

    Spheres of Justice

    Justice in transport as justice in accessibility: applying Walzer’s “Spheres of Justice” to the transport sector.Transportation39 (2012), 1035–1053. doi:10.1007/s11116-012-9388-7 P . McMullen

    2012 doi

  28. [2013]

    Comput.42, 6 (2013), 2063–2113

    Re- ducibility among fractional stability problems.SIAM J. Comput.42, 6 (2013), 2063–2113. doi:10.1137/ 120874655 Elizabeth Kneebone and Alan Berube. 2023.Post-pandemic poverty is rising in Amer- ica’s suburbs. Brookings Institution.https://www.brookings.edu/articles/ post-pan...

    2013

  29. [2014]

    doi:10.1111/juaf

    Racial and ethnic trends in the suburbanization of poverty in US metropolitan areas, 1980–2010.Journal of Urban Affairs36, 1 (2014), 79–98. doi:10.1111/juaf. 12030 R. G. Jeroslow and J. K. Lowe

    2014 doi

  30. [2015]

    Fair ticket pricing in public transport as a constrained cost allocation game.Ann. Oper. Res.226 (2015), 51–68. doi:10.1007/s10479-014-1698-z Marlin Caddell. 2005.Plans in the works for campus transit system. The Chrimson White. https://now.dirxion.com/Crimson_White/library/Cr...

    2015 doi

  31. [2016]

    doi:10.1111/poms.12542 Chicago Data Portal

    Duality Approaches to Economic Lot-Sizing Games.Production and Operations Management25, 7 (2016), 1203–1215. doi:10.1111/poms.12542 Chicago Data Portal

    2016 doi

  32. [2017]

    doi:10.1016/j

    OSMnx: New methods for acquiring, constructing, analyzing, and visualizing com- plex street networks.Computers, Environment and Urban Systems65 (2017), 126–139. doi:10.1016/j. compenvurbsys.2017.05.004 Olga N. Bondareva

    2017 doi

  33. [2018]

    doi:10.1016/j.cities.2018.05.013 C

    The unaffordable city: Housing and transit in North American cities.Cities83 (2018), 1–10. doi:10.1016/j.cities.2018.05.013 C. E. Lemke and J. T. Howson, Jr

    2018 doi

  34. [2023]

    A guide to formulating fairness in an optimization model. Ann. Oper. Res.326, 1 (2023), 581–619. doi:10.1007/s10479-023-05264-y Xi Chen, Xiaotie Deng, and Shang-Hua Teng

    2023 doi

  35. [2025]

    2014.Integer programming

    Transportation Network Providers - Trips (2023-).https://data.cityofchicago.org/Transportation/ Transportation-Network-Providers-Trips-2023-/n26f-ihde/about_data Michele Conforti, G ´erard Cornu ´ejols, and Giacomo Zambelli. 2014.Integer programming. Gradu- ate Texts in Mathem...

    2023

  36. [2108]

    doi:10.1007/3-540-44679-6_27 Donald B

    Springer, Berlin, 247–256. doi:10.1007/3-540-44679-6_27 Donald B. Gillies

    doi

  37. [5385]

    doi:10.1007/978-3-540-92185-1_15 Gurobi Optimization, LLC

    Springer, Berlin Heidelberg, 61–69. doi:10.1007/978-3-540-92185-1_15 Gurobi Optimization, LLC. 2025.Gurobi Optimizer Reference Manual. Gurobi Optimization, LLC.https: //docs.gurobi.com/_/downloads/optimizer/en/12.0/pdf/Chapter 7: Guidelines for Nu- merical Issues. Aaron J. How...

    2025 doi

Pith tools

Reviewed August 7, 2026 · model on record in the stance chip above.