Pith. sign in

REVIEW 3 major objections 5 minor 296 references

Supervised Fine-Tuning vs. In-Context Learning: An Equilibrium Analysis of LLM Personalization under Congestion

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

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

Pith's one-line read The paper derives a threshold rule for when supervised fine-tuning outperforms in-context learning, and shows that offering both never cuts platform profit.

desk verdict A serious theory paper on SFT vs ICL with real formal content; the core threshold and platform theorems hold, but the non-monotonicity results rest on an unvalidated approximation and the empirics are qualitative. read the letter →

arxiv 2607.14371 v1 pith:7TXSIHRX submitted 2026-07-15 cs.LG econ.THstat.ML

Fengzhuo Zhang , Zhuoran Yang , Dirk Bergemann This is my paper
classification cs.LGecon.THstat.ML MSC 91A1662J0568T07
keywords LLMpersonalizationin-contextlearningsupervisedfine-tuningcongestiongamesmean-fieldequilibriumplatformpricingpretrainingcoveragesignal-to-noiseratio
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

The paper builds a tractable model of LLM personalization with two options: in-context learning (ICL), which only adjusts the prompt, and supervised fine-tuning (SFT), which updates parameters at higher compute cost. It claims that which method is statistically better is governed by a threshold in pretraining coverage and the signal-to-noise ratio of user data, with SFT dominating once coverage passes a critical value. In a shared-resource setting with congestion, it proves that an equilibrium exists and that the equilibrium congestion level is unique, but that congestion responds non-monotonically to pretraining quality, coverage, task noise, and SFT cost. Finally, it shows that offering both SFT and ICL never lowers the platform's maximal profit relative to an ICL-only menu. If correct, user algorithm choice, congestion levels, and platform menu design reduce to computable functions of pretraining coverage, task dimension, noise, and per-sample compute costs.

What carries the argument

The central objects are the coverage ratio R=r/(d-r) and the null-space signal-to-noise ratio κ=sτ/(2σ̃²), together with the critical threshold R_crit derived from the exact error formulas. The threshold comes from comparing ICL's conservatism in uncovered directions—a fixed cost τ per uncovered dimension—with SFT's variance there, which scales as 2σ̃²/s. The equilibrium analysis uses a monotone congestion mapping: each user's best-response resource demand decreases as conjectured congestion rises, which yields a unique fixed point for aggregate demand and supports the subsequent price and menu comparative statics.

What would settle it

Compute the exact errors from equation (4.1) at intermediate sample counts and re-solve the equilibrium congestion and platform profit for a concrete parameter grid; if R* as a function of r, σ̃, or R_SFT loses its non-monotone shape, or if the maximal profit with SFT available drops below the ICL-only profit for any price, the central claims fail. A complementary experiment would measure ICL and SFT errors on linear regression with sample sizes between, say, 10 and 200, where ICL may not yet have plateaued, and check whether the predicted ranking flips match the threshold.

Watch

Extended reading notes

Core claim

Under aligned Gaussian linear models, the paper derives closed-form mean-squared errors for ICL and SFT. ICL can only reduce error within the subspace covered by pretraining and pays a fixed residual bias in the uncovered directions, whereas SFT can learn all directions but risks large variance when data are noisy. With optimally regularized SFT, the comparison reduces to a threshold: SFT achieves weakly lower error than ICL if and only if the coverage ratio R=r/(d-r) at least equals R_crit, a closed-form function of the null-space SNR κ=sτ/(2σ̃²), pretraining precision, and task variance. The paper then embeds these statistical errors in a continuum congestion game, proves the equilibrium c

Load-bearing premise

The headline congestion and profit results are proven under simplified error curves E_ICL(N)=2σ̃²r/(N^α+2σ̃²/ζ)+(d-r)τ and E_SFT(N)=2σ̃²d/N^α, which are chosen to match the exact formulas only as N approaches 0 or infinity; the paper provides no bound on the approximation error at intermediate sample counts, so if the true error curves deviate there, the non-monotone congestion patterns and the 'adding SFT never hurts profit' result could be artifacts of the approximation.

Editorial extensions

If this is right

  • Users with low pretraining coverage or noisy personalization data should prefer ICL; users with high coverage and informative data should prefer SFT, and congestion shifts the balance toward ICL.
  • Equilibrium congestion follows an increase-decrease-increase pattern as pretraining coverage expands when compute is cheap, and becomes monotone when prices or ICL costs are high.
  • Raising the platform's unit resource price always reduces equilibrium congestion, and the profit-maximizing price is finite under stated regularity conditions.
  • Platforms that add SFT to an ICL-only menu do not reduce their maximal profit, despite higher aggregate compute load.
  • Improving pretraining precision always lowers equilibrium congestion, while broader coverage and harder tasks can sometimes increase it.

Reading between the lines

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

  • Editorial extension: the threshold formula suggests a calibration recipe for real platforms—estimate r, d, τ, s, and σ̃ from task data to decide when to market SFT versus ICL and how to price compute, but the paper does not propose an estimation procedure.
  • Editorial extension: the 'adding SFT never hurts profit' result is proven for a single platform; in a competitive multi-platform setting, users could migrate platforms, so the profit guarantee may fail without additional assumptions.
  • Editorial extension: the non-monotonicity results are proven for simplified error curves that match the exact formulas only at extreme sample counts; re-running the equilibrium analysis with exact errors at intermediate sample sizes would test whether the qualitative conclusions survive.
  • Editorial extension: the model implies a substitution between offline pretraining compute and online serving compute—improving pretraining precision reduces inference-time congestion—which could inform infrastructure planning beyond pricing.
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 proposes a continuum-user congestion game for LLM personalization, in which users choose between ICL and SFT and choose how many personalization samples to use, while a platform sets a per-unit resource price. The statistical component derives closed-form error formulas for ICL and SFT under spectral-alignment and isotropicity assumptions, yielding a threshold condition (Proposition 3.6) for when SFT with optimally tuned regularization outperforms ICL. The game-theoretic component proves existence of an equilibrium and uniqueness of the equilibrium congestion level (Theorem 4.1), derives comparative statics of equilibrium congestion with respect to pretraining precision, coverage, task noise, and resource costs (Propositions 4.4–4.6), and characterizes anchoring in a two-type model (Proposition 4.8). Finally, the platform-level analysis shows that equilibrium congestion decreases in the price (Theorem 5.2), that an optimal finite price exists under regularity conditions (Proposition 5.3), and that adding SFT to an ICL-only menu never reduces maximal profit (Theorem 5.5). The paper includes GPT-2 experiments on linear regression that validate qualitative predictions about ICL error plateaus, linear growth in uncovered dimensions, and the sample-size-dependent ranking of SFT and ICL, plus a survey of 21 AI platforms documenting the spread of SFT APIs.

Significance. If the main results hold, the paper makes a valuable contribution by connecting statistical primitives of LLM personalization — pretraining coverage, feature alignment, signal-to-noise ratios, and per-sample compute costs — to equilibrium congestion and platform pricing. Proposition 3.6 gives a closed-form, non-fitted threshold that separates regimes where ICL's conservatism is preferable to SFT's ability to learn outside the pretrained subspace. Theorem 4.1's uniqueness of the equilibrium congestion level is a useful mean-field-type result because it makes platform profit and congestion predictions single-valued even when equilibrium policies are not unique. The GPT-2 experiments provide independent support for the statistical model's qualitative predictions, since the constants in the theory were not fitted to these experiments. However, the paper's second main finding — non-monotone comparative statics of congestion — is proved only under an unvalidated simplified error model, which currently limits the support for those conclusions. The platform menu theorem is conditional on a strong uniformity assumption that is not reflected in the abstract's unqualified statement.

major comments (3)
  1. [Section 4.2, Eq. (4.2)] The simplified error functions E_ICL(N)=2σ̃²r/(N^α+2σ̃²/ζ)+(d−r)τ and E_SFT(N)=2σ̃²d/N^α are asserted to 'preserve the main insights' of the exact formulas (4.1), but no error bound or numerical audit at intermediate N is provided. Propositions 4.4–4.6 and 4.8, which constitute the paper's headline non-monotonicity results, are proved only for (4.2). The approximation matches the N→0 and N→∞ limits, yet the extensive-margin switching between ICL and SFT is governed by crossings of E_ICL and E_SFT, and those crossings can shift under the approximation. If the true curves differ at finite N, the increase–decrease–increase pattern in r, the hump in R_SFT, and the anchoring regions could be artifacts of (4.2). The limitations section does not flag this gap. This is load-bearing for Finding 2, even though Theorem 4.1 and Theorem 5.5 are derived from the exact (4.1).
  2. [Theorem 5.5 and Assumption 5.4] The theorem is stated as 'adding SFT cannot reduce optimal profit', and the abstract repeats this without qualification. The proof, however, relies on Assumption 5.4, which requires RSFT ≥ RICL · sup_t (rβ(t)/(d−r))^{1/α} with β(t)=1+π(τ+m²)/σ̄². This is a strong uniform per-sample compute gap that is not derived from any measurement or primitive in the paper. The theorem is therefore conditional on an assumption that may fail for platforms where SFT per-sample costs are not sufficiently larger than ICL per-sample costs. The main text should state the theorem with this condition prominently, and the abstract/introduction should not claim an unconditional result. This is a scope issue for a central claim, not merely a stylistic one.
  3. [Section 4.2, Figures 2–3] The simulation study that illustrates Propositions 4.4–4.6 computes equilibrium congestion using the simplified errors (4.2) itself. As a result, the figures do not provide evidence that the non-monotonicity survives under the exact error model (4.1). To support the approximation, the authors should either overlay the exact-model simulations in Figures 2–3 or provide analytic bounds showing that the comparative statics are preserved uniformly in N. Without this, the empirical content of the non-monotonicity results rests entirely on an unproven simplification.
minor comments (5)
  1. [Section 4.1 after Eq. (4.1)] The user type is defined as t=(d,r,σ̄,σ̃,m,π,τ), but the error formulas use s=N^α, which depends on the action N. Clarify that s is not part of the type but is determined by the action, or include α in the type.
  2. [Assumption 4.2 vs. Assumption 5.4] Assumption 4.2 only requires RSFT>RICL, while Assumption 5.4 imposes a much larger gap. The relationship between these assumptions should be discussed; the latter is not a strengthening of the former in an obvious quantitative sense and its necessity for Theorem 5.5 should be explained.
  3. [Appendix I] The robustness check with h(x)=max{0,x} is not a separate congestion function on R_+ since max{0,x}=x for x≥0. This is a linear congestion function, which is already covered by the assumptions; consider replacing it with a different nonlinearity or clarifying its role.
  4. [Figures 8–9] The labels 'Regime of MFE' are used without defining MFE; the text refers to 'regime of the equilibrium'. Use consistent terminology.
  5. [Section 6] The GPT-2 experiments test only the statistical comparisons of Section 3 (ICL plateau, linear bias in d−r, SFT/ICL ranking flip). They do not test the equilibrium non-monotonicity or the platform profit prediction. This should be stated explicitly so readers do not infer that the experiments validate the congestion-game results.

Circularity Check

0 steps flagged · score 1.0 of 10

No circular derivation found; the central SFT/ICL threshold and the profit theorem are derived from explicit primitives, while the main unresolved issue is an unvalidated simplifying approximation, not a circularity.

full rationale

The core derivation chain is self-contained. Theorem 3.3 derives closed-form ICL and SFT errors from the Gaussian linear model, the Bayesian-update definition of ICL, the regularized-estimator definition of SFT, and Assumptions 3.1, 3.2 and 3.5. Proposition 3.6 then computes the SFT/ICL threshold Rcrit as an explicit function of the primitives (π, s, τ, σ̃, σ̄, m, d, r); no parameter is fitted to data and no output is reused as an input. The equilibrium and platform sections are also derived in-paper: Theorem 4.1 proves existence and congestion-level uniqueness with a monotonicity lemma, Theorem 4.3 characterizes the homogeneous-user equilibrium from the error/cost functions, and Theorem 5.5 relies on the exact errors (4.1) plus Assumption 5.4 to establish R*(p) ≥ R*_ICL(p) by a valid monotonicity argument. The paper cites prior work by overlapping authors (notably Zhang et al. 2023a,b), but the load-bearing ICL-as-Bayesian-inference premise is also supported by the external Xie et al. 2021 citation and by the GPT-2 experiments, which test qualitative predictions (plateau, linear bias in d−r, ranking flip) rather than calibrating the model constants. Thus the self-citations are not load-bearing. The only notable weakness is in Section 4.2: the paper replaces the exact errors (4.1) with the simplified errors (4.2) and asserts that this 'preserves the main insights' without supplying an error bound at intermediate N. Propositions 4.4–4.6 are proved for this approximation. This is a correctness/robustness risk, not circularity, and it does not affect Theorem 5.5, whose proof is based on the exact expressions (4.1). Overall, no step reduces by construction to its own input, so the circularity score is minimal.

Assumptions & free parameters 3 free parameters · 8 assumptions · 0 invented entities

The framework is a chain: linear statistical model → closed-form errors → approximated errors → mean-field congestion game → Stackelberg pricing. Each link adds assumptions: spectral alignment and isotropicity make the error formulas tractable; the (4.2) approximation and h=R² make the equilibrium analysis closed-form; Assumption 5.4 makes the profit theorem hold. No free parameters are fitted to data in the derivations; the free choices are functional forms and the approximation. No new physical entities, forces, or conserved quantities are postulated: the user type space, congestion level R, and the platform are modeling constructs with defined operational meaning.

free parameters (3)
  • information-growth exponent α (s = N^α) = α = 1 assumed in Sections 4.2–5
    Models how personalization data strength s grows with sample count; α=1 (i.i.d. Gaussian covariates) is adopted for analytical convenience and all closed-form equilibrium results depend on it (Section 4.2).
  • simplified error functions (4.2) constants = 2σ̃²r, 2σ̃²/ζ, 2σ̃²d (chosen to match N→∞/N→0 asymptotics of (4.1))
    The error functions used in every equilibrium theorem are hand-chosen approximations; their constants are matched to asymptotics of the exact formulas (4.1) and are not derived or bounded at intermediate N (Section 4.2).
  • congestion function h(R)=R² = h(R)=R² (exp and max{0,x} checked numerically in Appendix I)
    Adopted 'for the ease of calculation' (Section 4.2); the paper verifies robustness only numerically for two alternative functional forms.
assumptions (8)
  • domain assumption Assumption 3.1: X^TX, X̃^TX̃, and Σ* share a common eigenbasis V (spectral alignment)
    Reduces the error analysis to d independent one-dimensional problems; without it, the covered/uncovered decomposition that drives the ICL-vs-SFT mechanism does not hold. Invoked in Theorem 3.3.
  • domain assumption Assumption 3.2: pretraining inputs have constant Σθ-norm
    Folds input power into a single scalar σ̄² = σ²+c²; heterogeneous norms are claimed to require only an averaged σ̄² without changing the qualitative results.
  • domain assumption Assumption 3.5: isotropicity (τ_i=τ, s_i=s, π_i=π, |v_i^T μ_θ|=m)
    Needed for the closed-form threshold R_crit in Proposition 3.6; the authors call it 'a structural simplification, not a claim of truly isotropic pretrained features.'
  • ad hoc to paper Simplified errors (4.2) preserve the ICL/SFT comparison and equilibrium structure for all N
    Asserts fidelity of the approximated errors used in all of Sections 4–5; matched at N→∞ and N→0 but unproven and unbounded for intermediate N.
  • ad hoc to paper Assumption 5.4: R_SFT ≥ R_ICL · sup_t (rβ(t)/(d−r))^{1/α}
    The compute-gap condition that makes Theorem 5.5 ('adding SFT never reduces profit') go through; the abstract states the theorem without this condition.
  • domain assumption ICL performs Bayesian inference under the learned pretraining prior
    Imported from Xie et al. 2021 and Zhang et al. 2023b; the entire ICL error formula rests on the posterior interpretation (Section 2.1).
  • domain assumption Continuum of users with compact type space and regular congestion h (strictly increasing, unbounded)
    Enables the mean-field equilibrium; core to Definition 2.1 and Theorem 4.1.
  • domain assumption LLM behavior on linear tasks is broadly representative of LLM personalization
    The empirical bridge that lets GPT-2 linear-regression results count as validation; asserted in Section 1, cited to Garg et al. 2022 / Akyürek et al. 2023.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Supervised Fine-Tuning vs. In-Context Learning: An Equilibrium Analysis of LLM Personalization under Congestion." pith.science (2026). https://pith.science/paper/7TXSIHRX

@misc{pith2026260714371,
  author       = {Pith},
  title        = {Pith review of: Supervised Fine-Tuning vs. In-Context Learning: An Equilibrium Analysis of LLM Personalization under Congestion},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/7TXSIHRX}},
  note         = {Machine review of arXiv:2607.14371}
}
read the original abstract

Large Language Models (LLMs) have revolutionized AI services, but a critical tension emerges: while personalization improves model performance, it consumes scarce computational resources that users must share. When should a user invest in expensive Supervised Fine-Tuning (SFT) versus lightweight In-Context Learning (ICL)? How does congestion from other users' personalization choices reshape these incentives? And what strategies should platforms adopt when offering multiple personalization algorithms? We develop a tractable framework for LLM serving that captures the statistical-economic trade-offs users face. Our analysis yields several surprising insights. First, we show that ICL and SFT dominate in different regimes, determined by an interplay between pretraining coverage and data signal-to-noise ratios, but congestion can flip these rankings. Second, equilibrium resource consumption exhibits pronounced non-monotonicity: improving pretraining precision reduces the congestion, while broader pretraining coverage and harder tasks sometimes increase it. Third, we prove that offering both personalization methods never hurts the platform's maximal profits, despite potentially increasing computational load. Experiments with GPT-2 on linear regression tasks validate our theoretical predictions about algorithm performance. Complementing these results, our review of documentation from 21 major AI platforms shows that the share offering both SFT and ICL increased from 9.5% in 2021 to 71.4% in 2025, consistent with our platform-design implications.

Figures

Figures reproduced from arXiv: 2607.14371 by the authors.

Figure 1
Figure 1. This figure illustrates the structure of the equilibrium with homogeneous users. The intersection point of the line y = H and the blue dotted curve corresponds to the equilibrium of the game. Theorem 4.3 characterizes the equilib￾rium with homogeneous users by reduc￾ing the equilibrium problem to a one￾dimensional fixed point in the effective per￾unit compute cost H = p + h(R), illustrated in [PITH_FULL_IMAGE:figur… view at source ↗
Figure 2
Figure 2. The figures show how the equilibrium congestion level [PITH_FULL_IMAGE:figures/full_fig_p019_2.png] view at source ↗
Figure 3
Figure 3. The figures show how the equilibrium congestion level [PITH_FULL_IMAGE:figures/full_fig_p021_3.png] view at source ↗
Figures from the paper (10 more)
Figure 4
Figure 4. Figure 4: The separator H∗ sep(t) summarizes a type’s willingness to pay in resource costs to use the more resource-intensive method. The ordering H∗ sep(t2) < H∗ sep(t1) implies that [PITH_FULL_IMAGE:figures/full_fig_p023_4.png]
Figure 5
Figure 5. Figure 5: The figure reports |∂qR∗ | + |∂σ˜1R∗ | across different values of the type-1 task noise σ˜1 and population share q. In the dark-blue region, the near-zero sensitivity indicates that the equilibrium congestion level is pinned by the type-2 separator and is locally insen…
Figure 6
Figure 6. Figure 6: The figures show the estimation error of [PITH_FULL_IMAGE:figures/full_fig_p028_6.png]
Figure 7
Figure 7. Figure 7: Panel (a) shows the estimation error of SFT across different numbers of personal￾ization samples N˜, illustrating that SFT can asymptotically drive the estimation error to zero as the sample size increases. Panel (b) reports the fraction of platforms that offer SFT in …
Figure 8
Figure 8. Figure 8: Figures (a)-(c) show the congestion level [PITH_FULL_IMAGE:figures/full_fig_p085_8.png]
Figure 9
Figure 9. Figure 9: Figures (a)-(c) show the congestion level [PITH_FULL_IMAGE:figures/full_fig_p085_9.png]
Figure 10
Figure 10. Figure 10: These figures illustrate how the equilibrium congestion level [PITH_FULL_IMAGE:figures/full_fig_p086_10.png]
Figure 11
Figure 11. Figure 11: These figures illustrate how the equilibrium congestion level [PITH_FULL_IMAGE:figures/full_fig_p086_11.png]
Figure 12
Figure 12. Figure 12: These figures illustrate how the equilibrium congestion level [PITH_FULL_IMAGE:figures/full_fig_p087_12.png]
Figure 13
Figure 13. Figure 13: These figures illustrate how the equilibrium congestion level [PITH_FULL_IMAGE:figures/full_fig_p087_13.png]

Discussion (0). Sign in to comment.

Reference graph

Works this paper leans on

296 extracted references · 13 linked inside Pith

  1. [1]

    Abril and Robert Plant

    Patricia S. Abril and Robert Plant. The patent holder's dilemma: Buy, sell, or troll?. Communications of the ACM. 2007. doi:10.1145/1188913.1188915

    arXiv 2007

  2. [2]

    Deciding equivalances among conjunctive aggregate queries

    Sarah Cohen and Werner Nutt and Yehoshua Sagic. Deciding equivalances among conjunctive aggregate queries. 2007. doi:10.1145/1219092.1219093

    arXiv 2007

  3. [3]

    Special issue: Digital Libraries. 1996

    1996

  4. [4]

    Understanding Policy-Based Networking

    David Kosiur. Understanding Policy-Based Networking. 2001

    2001

  5. [7]

    The title of book two. 2008. doi:10.1007/3-540-09237-4

    doi:10.1007/3-540-09237-4 2008

  6. [8]

    Asad Z. Spector. Achieving application requirements. Distributed Systems. 1990. doi:10.1145/90417.90738

    arXiv 1990

  7. [9]

    Douglass and David Harel and Mark B

    Bruce P. Douglass and David Harel and Mark B. Trakhtenbrot. Statecarts in use: structured analysis and object-orientation. Lectures on Embedded Systems. 1998. doi:10.1007/3-540-65193-4_29

    doi:10.1007/3-540-65193-4_29 1998

  8. [10]

    Donald E. Knuth. The Art of Computer Programming, Vol. 1: Fundamental Algorithms (3rd. ed.). 1997

    1997

Show all 296 references
  1. [11]

    Donald E. Knuth. The Art of Computer Programming. 1998

    1998

  2. [12]

    Journal of Urban Economics , volume=

    Road congestion: a reconsideration of pricing theory , author=. Journal of Urban Economics , volume=. 1974 , publisher=

    1974

  3. [13]

    2024 , publisher=

    The economics of urban transportation , author=. 2024 , publisher=

    2024

  4. [14]

    Handbook of regional and urban economics , volume=

    Transportation costs and the spatial organization of economic activity , author=. Handbook of regional and urban economics , volume=. 2015 , publisher=

    2015

  5. [15]

    American Economic Review , volume=

    The fundamental law of road congestion: Evidence from US cities , author=. American Economic Review , volume=. 2011 , publisher=

    2011

  6. [16]

    2015 , publisher=

    The traffic assignment problem: models and methods , author=. 2015 , publisher=

    2015

  7. [17]

    Econometrica , volume=

    Peak-Hour Road Congestion Pricing: Experimental Evidence and Equilibrium Implications , author=. Econometrica , volume=. 2024 , publisher=

    2024

  8. [18]

    Structured Variational Inference Procedures and their Realizations (as incol)

    Dan Geiger and Christopher Meek. Structured Variational Inference Procedures and their Realizations (as incol). Proceedings of Tenth International Workshop on Artificial Intelligence and Statistics, The Barbados

  9. [19]

    Stan W. Smith. An experiment in bibliographic mark-up: Parsing metadata for XML export. Proceedings of the 3rd. annual workshop on Librarians and Computers. 2010. doi:99.9999/woot07-S422

    2010

  10. [20]

    arXiv preprint arXiv:2408.14511 , year=

    Unveiling the statistical foundations of chain-of-thought prompting methods , author=. arXiv preprint arXiv:2408.14511 , year=

    arXiv

  11. [21]

    SIAM Journal on Control and Optimization , volume=

    Probabilistic analysis of mean-field games , author=. SIAM Journal on Control and Optimization , volume=. 2013 , publisher=

    2013

  12. [22]

    2018 , publisher=

    Probabilistic theory of mean field games with applications I-II , author=. 2018 , publisher=

    2018

  13. [23]

    Advances in neural information processing systems , volume=

    Locating and editing factual associations in gpt , author=. Advances in neural information processing systems , volume=

  14. [24]

    arXiv preprint arXiv:2509.26030 , year=

    Muon outperforms Adam in tail-end associative memory learning , author=. arXiv preprint arXiv:2509.26030 , year=

  15. [25]

    Journal of Machine Learning Research , volume=

    Learning regularized graphon mean-field games with unknown graphons , author=. Journal of Machine Learning Research , volume=

  16. [26]

    Catch me, if you can: Evading network signatures with web-based polymorphic worms

    Matthew Van Gundy and Davide Balzarotti and Giovanni Vigna. Catch me, if you can: Evading network signatures with web-based polymorphic worms. Proceedings of the first USENIX workshop on Offensive Technologies. 2007

    2007

  17. [27]

    Catch me, if you can: Evading network signatures with web-based polymorphic worms

    Matthew Van Gundy and Davide Balzarotti and Giovanni Vigna. Catch me, if you can: Evading network signatures with web-based polymorphic worms. Proceedings of the first USENIX workshop on Offensive Technologies. 2008

    2008

  18. [28]

    Catch me, if you can: Evading network signatures with web-based polymorphic worms

    Matthew Van Gundy and Davide Balzarotti and Giovanni Vigna. Catch me, if you can: Evading network signatures with web-based polymorphic worms. Proceedings of the first USENIX workshop on Offensive Technologies. 2009

    2009

  19. [29]

    Predicate Path expressions

    Sten Andler. Predicate Path expressions. Proceedings of the 6th. ACM SIGACT-SIGPLAN symposium on Principles of Programming Languages. 1979. doi:10.1145/567752.567774

    1979

  20. [30]

    LOGICS of Programs: AXIOMATICS and DESCRIPTIVE POWER

    David Harel. LOGICS of Programs: AXIOMATICS and DESCRIPTIVE POWER. 1978

    1978

  21. [31]

    Anisi , title =

    David A. Anisi , title =

  22. [32]

    Clarkson

    Kenneth L. Clarkson. Algorithms for Closest-Point Problems (Computational Geometry). 1985

    1985

  23. [33]

    Introduction to Bayesian Statistics

    Harry Thornburg. Introduction to Bayesian Statistics. 2001

    2001

  24. [34]

    CLIFFORD: a Maple 11 Package for Clifford Algebra Computations, version 11

    Rafal Ablamowicz and Bertfried Fauser. CLIFFORD: a Maple 11 Package for Clifford Algebra Computations, version 11. 2007

    2007

  25. [35]

    Stats and Analysis

    Poker-Edge.Com. Stats and Analysis. 2006

    2006

  26. [36]

    A more perfect union

    Barack Obama. A more perfect union. 2008

    2008

  27. [37]

    The fountain of youth

    Joseph Scientist. The fountain of youth. 2009

    2009

  28. [38]

    Solder man

    Dave Novak. Solder man. ACM SIGGRAPH 2003 Video Review on Animation theater Program: Part I - Vol. 145 (July 27--27, 2003). 2003. doi:99.9999/woot07-S422

    2003

  29. [39]

    Interview with Bill Kinder: January 13, 2005

    Newton Lee. Interview with Bill Kinder: January 13, 2005. Comput. Entertain. 2005. doi:10.1145/1057270.1057278

    2005

  30. [40]

    The Enabling of Digital Libraries

    Bernard Rous. The Enabling of Digital Libraries. Digital Libraries. 2008

    2008

  31. [42]

    (new) Finding minimum congestion spanning trees , journal =

    Werneck, Renato and Setubal, Jo\. (new) Finding minimum congestion spanning trees , journal =. 2000 , issn =. doi:10.1145/351827.384253 , acmid =

    2000

  32. [44]

    and Mei, Alessandro , title =

    Conti, Mauro and Di Pietro, Roberto and Mancini, Luigi V. and Mei, Alessandro , title =. Inf. Fusion , volume =. 2009 , issn =. doi:10.1016/j.inffus.2009.01.002 , acmid =

    2009 doi

  33. [45]

    and Hutchful, David K

    Li, Cheng-Lun and Buyuktur, Ayse G. and Hutchful, David K. and Sant, Natasha B. and Nainwal, Satyendra K. , title =. CHI '08 extended abstracts on Human factors in computing systems , year =. doi:10.1145/1358628.1358946 , acmid =

  34. [46]

    , title =

    Hollis, Billy S. , title =. 1999 , isbn =

    1999

  35. [47]

    Goossens, Michel and Rahtz, S. P. and Moore, Ross and Sutor, Robert S. , title =. 1999 , isbn =

    1999

  36. [48]

    and Rosenberg, Arnold L

    Buss, Jonathan F. and Rosenberg, Arnold L. and Knott, Judson D. , title =. 1987 , source =

    1987

  37. [49]

    CHI '08: CHI '08 extended abstracts on Human factors in computing systems , year =

    , note =. CHI '08: CHI '08 extended abstracts on Human factors in computing systems , year =

  38. [50]

    Algorithms for Closest-Point Problems (Computational Geometry) , year =

    Clarkson, Kenneth Lee , advisor =. Algorithms for Closest-Point Problems (Computational Geometry) , year =

  39. [51]

    SIGCOMM Comput. Commun. Rev. , year =

  40. [52]

    2004 , isbn =

    IEEE TCSC Executive Committee , booktitle =. 2004 , isbn =. doi:http://dx.doi.org/10.1109/ICWS.2004.64 , acmid =

    2004 doi

  41. [53]

    Distributed systems (2nd Ed.) , year =

  42. [54]

    , title =

    Petrie, Charles J. , title =. 1986 , source =

    1986

  43. [55]

    Donald E. Knuth. Seminumerical Algorithms. 1981

    1981

  44. [56]

    E-commerce and cultural values , year =

    Kong, Wei-Chang , Title =. E-commerce and cultural values , year =

  45. [57]

    E-commerce and cultural values , year =

    Kong, Wei-Chang , type =. E-commerce and cultural values , year =

  46. [58]

    Chapter 9 , booktitle =

    Kong, Wei-Chang , editor =. Chapter 9 , booktitle =. 2002 , address =

    2002

  47. [59]

    E-commerce and cultural values , editor =

    Kong, Wei-Chang , title =. E-commerce and cultural values , editor =. 2003 , isbn =

    2003

  48. [60]

    E-commerce and cultural values - (InBook-num-in-chap) , chapter =

    Kong, Wei-Chang , editor =. E-commerce and cultural values - (InBook-num-in-chap) , chapter =. 2004 , address =

    2004

  49. [61]

    E-commerce and cultural values (Inbook-text-in-chap) , chapter =

    Kong, Wei-Chang , editor =. E-commerce and cultural values (Inbook-text-in-chap) , chapter =. 2005 , address =

    2005

  50. [62]

    E-commerce and cultural values (Inbook-num chap) , chapter =

    Kong, Wei-Chang , editor =. E-commerce and cultural values (Inbook-num chap) , chapter =. 2006 , address =

    2006

  51. [63]

    Microelectron

    Mehdi Saeedi and Morteza Saheb Zamani and Mehdi Sedighi , title =. Microelectron. J. , volume =. 2010 , pages =

    2010

  52. [64]

    Mehdi Saeedi and Morteza Saheb Zamani and Mehdi Sedighi and Zahra Sasanian , title =. J. Emerg. Technol. Comput. Syst. , volume =

  53. [65]

    Kirschmer, Markus and Voight, John , title =. SIAM J. Comput. , issue_date =. 2010 , issn =. doi:http://dx.doi.org/10.1137/080734467 , acmid =

    2010 doi

  54. [66]

    Hoare, C. A. R. , title =. Structured programming (incoll) , editor =. 1972 , isbn =

    1972

  55. [67]

    History of programming languages I (incoll) , editor =

    Lee, Jan , title =. History of programming languages I (incoll) , editor =. 1981 , isbn =. doi:http://doi.acm.org/10.1145/800025.1198348 , acmid =

    1981

  56. [68]

    , title =

    Dijkstra, E. , title =. Classics in software engineering (incoll) , year =

  57. [69]

    , title =

    Wenzel, Elizabeth M. , title =. Multimedia interface design (incoll) , year =. doi:10.1145/146022.146089 , acmid =

  58. [70]

    , title =

    Mumford, E. , title =. Critical issues in information systems research (incoll) , year =

  59. [71]

    and Golden, Donald G

    McCracken, Daniel D. and Golden, Donald G. , title =. 1990 , isbn =

    1990

  60. [72]

    The analysis of linear partial differential operators

    H. The analysis of linear partial differential operators. 1985 , PAGES =

    1985

  61. [73]

    IEEE", address =

    A. Adya and P. Bahl and J. Padhye and A.Wolman and L. Zhou , title =. Proceedings of the IEEE 1st International Conference on Broadnets Networks (BroadNets'04) , publisher = "IEEE", address = "Los Alamitos, CA", year =

  62. [74]

    I. F. Akyildiz and W. Su and Y. Sankarasubramaniam and E. Cayirci , title =. Comm. ACM , volume = 38, number = "4", year =

  63. [75]

    I. F. Akyildiz and T. Melodia and K. R. Chowdhury , title =. Computer Netw. , volume = 51, number = "4", year =

  64. [76]

    ACM", address =

    P. Bahl and R. Chancre and J. Dungeon , title =. Proceeding of the 10th International Conference on Mobile Computing and Networking (MobiCom'04) , publisher = "ACM", address = "New York, NY", year =

  65. [77]

    8 (Special Issue on Sensor Networks)

    D. Culler and D. Estrin and M. Srivastava , title =. IEEE Comput. , volume = 37, number = "8 (Special Issue on Sensor Networks)", publisher = "IEEE", address = "Los Alamitos, CA", year =

  66. [78]

    Natarajan and M

    A. Natarajan and M. Motani and B. de Silva and K. Yap and K. C. Chua , title =. Network Architectures , editor =. 960935712

  67. [79]

    Tzamaloukas and J

    A. Tzamaloukas and J. J. Garcia-Luna-Aceves , title =

  68. [80]

    Zhou and J

    G. Zhou and J. Lu and C.-Y. Wan and M. D. Yarvis and J. A. Stankovic , title =

  69. [81]

    Mapping Powerlists onto Hypercubes

    Jacob Kornerup. Mapping Powerlists onto Hypercubes. 1994

    1994

  70. [82]

    Automatic Parallelization for Distributed-Memory Multiprocessing Systems

    Michael Gerndt. Automatic Parallelization for Distributed-Memory Multiprocessing Systems

  71. [83]

    J. E. Archer, Jr. and R. Conway and F. B. Schneider. User recovery and reversal in interactive systems. ACM Trans. Program. Lang. Syst

  72. [84]

    D. D. Dunlop and V. R. Basili. Generalizing specifications for uniformly implemented loops. ACM Trans. Program. Lang. Syst

  73. [85]

    Heering and P

    J. Heering and P. Klint. Towards monolingual programming environments. ACM Trans. Program. Lang. Syst

  74. [86]

    Donald E. Knuth. The book

  75. [87]

    Korach and D

    E. Korach and D. Rotem and N. Santoro. Distributed algorithms for finding centers and medians in networks. ACM Trans. Program. Lang. Syst

  76. [88]

    : A Document Preparation System

    Leslie Lamport. : A Document Preparation System

  77. [89]

    F. Nielson. Program transformations in a denotational setting. ACM Trans. Program. Lang. Syst

  78. [90]

    Brian K. Reid. A high-level approach to computer document formatting. Proceedings of the 7th Annual Symposium on Principles of Programming Languages

  79. [91]

    and Abdelzaher, Tarek F

    Zhou, Gang and Wu, Yafeng and Yan, Ting and He, Tian and Huang, Chengdu and Stankovic, John A. and Abdelzaher, Tarek F. , title =. ACM Trans. Embed. Comput. Syst. , issue_date =. 2010 , issn =. doi:10.1145/1721695.1721705 , acmid =

    2010

  80. [92]

    arXiv preprint arXiv:2402.02716 , year=

    Understanding the planning of LLM agents: A survey , author=. arXiv preprint arXiv:2402.02716 , year=

    arXiv

  81. [93]

    arXiv preprint arXiv:2407.10490 , year=

    Learning dynamics of llm finetuning , author=. arXiv preprint arXiv:2407.10490 , year=

    arXiv

  82. [94]

    arXiv preprint arXiv:2502.16852 , year=

    Improving LLM general preference alignment via optimistic online mirror descent , author=. arXiv preprint arXiv:2502.16852 , year=

    arXiv

  83. [95]

    arXiv preprint arXiv:2111.02080 , year=

    An explanation of in-context learning as implicit bayesian inference , author=. arXiv preprint arXiv:2111.02080 , year=

    arXiv

  84. [96]

    Advances in neural information processing systems , volume=

    Learning mean-field games , author=. Advances in neural information processing systems , volume=

  85. [97]

    IEEE Transactions on Audio, Speech and Language Processing , year=

    An empirical study of catastrophic forgetting in large language models during continual fine-tuning , author=. IEEE Transactions on Audio, Speech and Language Processing , year=

  86. [98]

    The Eleventh International Conference on Learning Representations , year=

    What learning algorithm is in-context learning? Investigations with linear models , author=. The Eleventh International Conference on Learning Representations , year=

  87. [99]

    2025 , institution=

    How people use chatgpt , author=. 2025 , institution=

    2025

  88. [100]

    SIAM Journal on Control and Optimization , volume=

    Limit theory for controlled McKean--Vlasov dynamics , author=. SIAM Journal on Control and Optimization , volume=. 2017 , publisher=

    2017

  89. [101]

    Proceedings of the National Academy of Sciences , volume=

    Asymptotic theory of in-context learning by linear attention , author=. Proceedings of the National Academy of Sciences , volume=. 2025 , publisher=

    2025

  90. [102]

    arXiv preprint arXiv:2511.00674 , year=

    Isotropic Curvature Model for Understanding Deep Learning Optimization: Is Gradient Orthogonalization Optimal? , author=. arXiv preprint arXiv:2511.00674 , year=

  91. [103]

    arXiv preprint arXiv:2404.00522 , year=

    Minimum-norm interpolation under covariate shift , author=. arXiv preprint arXiv:2404.00522 , year=

    arXiv

  92. [104]

    International conference on machine learning , pages=

    Transformers as algorithms: Generalization and stability in in-context learning , author=. International conference on machine learning , pages=. 2023 , organization=

    2023

  93. [105]

    arXiv preprint arXiv:2508.01059 , year=

    Llama-3.1-foundationai-securityllm-8b-instruct technical report , author=. arXiv preprint arXiv:2508.01059 , year=

    arXiv

  94. [106]

    Dynamic Games and Applications , volume=

    Q-learning in regularized mean-field games , author=. Dynamic Games and Applications , volume=. 2023 , publisher=

    2023

  95. [107]

    International Conference on Machine Learning , pages=

    Policy mirror ascent for efficient and independent learning in mean field games , author=. International Conference on Machine Learning , pages=. 2023 , organization=

    2023

  96. [108]

    arXiv preprint arXiv:2205.12944 , year=

    Learning in mean field games: A survey , author=. arXiv preprint arXiv:2205.12944 , year=

    arXiv

  97. [109]

    Mean field games with common noise , author=

  98. [110]

    Journal of Functional Analysis , volume=

    On monotonicity conditions for mean field games , author=. Journal of Functional Analysis , volume=. 2023 , publisher=

    2023

  99. [111]

    Japanese journal of mathematics , volume=

    Mean field games , author=. Japanese journal of mathematics , volume=. 2007 , publisher=

    2007

  100. [112]

    Advances in Neural Information Processing Systems , volume=

    Learning regularized monotone graphon mean-field games , author=. Advances in Neural Information Processing Systems , volume=

  101. [113]

    Proceedings of the ACM Web Conference 2024 , pages=

    Mechanism design for large language models , author=. Proceedings of the ACM Web Conference 2024 , pages=

    2024

  102. [114]

    Advances in Neural Information Processing Systems , volume=

    Ad auctions for llms via retrieval augmented generation , author=. Advances in Neural Information Processing Systems , volume=

  103. [115]

    Proceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining , pages=

    Auctions with llm summaries , author=. Proceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining , pages=

  104. [116]

    arXiv preprint arXiv:2509.01063 , year=

    An economy of AI agents , author=. arXiv preprint arXiv:2509.01063 , year=

    arXiv

  105. [117]

    Proceedings of the 26th ACM Conference on Economics and Computation , pages=

    The Economics of Large Language Models: Token Allocation, Fine-Tuning, and Optimal Pricing , author=. Proceedings of the 26th ACM Conference on Economics and Computation , pages=

  106. [118]

    Algorithmic collusion by large language models , author=

  107. [119]

    Proceedings of the 26th ACM Conference on Economics and Computation , pages=

    Data-Driven Mechanism Design: Jointly Eliciting Preferences and Information , author=. Proceedings of the 26th ACM Conference on Economics and Computation , pages=

  108. [120]

    2024 , booktitle=

    Truthful Aggregation of LLMs with an Application to Online Advertising , author=. 2024 , booktitle=

    2024

  109. [121]

    International Conference on Machine Learning , pages=

    Transformers learn in-context by gradient descent , author=. International Conference on Machine Learning , pages=. 2023 , organization=

    2023

  110. [122]

    Proceedings of the 2020 conference on empirical methods in natural language processing: system demonstrations , pages=

    Transformers: State-of-the-art natural language processing , author=. Proceedings of the 2020 conference on empirical methods in natural language processing: system demonstrations , pages=

    2020

  111. [123]

    OpenAI blog , volume=

    Language models are unsupervised multitask learners , author=. OpenAI blog , volume=

  112. [124]

    Advances in neural information processing systems , volume=

    What can transformers learn in-context? a case study of simple function classes , author=. Advances in neural information processing systems , volume=

  113. [125]

    2025 , institution=

    Designing Human-AI Collaboration: A Sufficient-Statistic Approach , author=. 2025 , institution=

    2025

  114. [126]

    Advances in Neural Information Processing Systems , volume=

    Fictitious play for mean field games: Continuous time analysis and applications , author=. Advances in Neural Information Processing Systems , volume=

  115. [127]

    OpenAI Status , year =

    OpenAI Service Incident: Major Outage across ChatGPT and API , author =. OpenAI Status , year =

  116. [128]

    OpenAI Status , year =

    GPT-3 powers the next generation of apps , author =. OpenAI Status , year =

  117. [129]

    arXiv preprint arXiv:1412.6980 , year=

    Adam: A method for stochastic optimization , author=. arXiv preprint arXiv:1412.6980 , year=

    arXiv

  118. [130]

    arXiv preprint arXiv:2307.09288 , year=

    Llama 2: Open foundation and fine-tuned chat models , author=. arXiv preprint arXiv:2307.09288 , year=

    arXiv

  119. [131]

    arXiv preprint arXiv:2407.21783 , year=

    The llama 3 herd of models , author=. arXiv preprint arXiv:2407.21783 , year=

    arXiv

  120. [132]

    arXiv preprint arXiv:2401.05459 , year=

    Personal llm agents: Insights and survey about the capability, efficiency and security , author=. arXiv preprint arXiv:2401.05459 , year=

    arXiv

  121. [133]

    Advances in neural information processing systems , volume=

    Language models are few-shot learners , author=. Advances in neural information processing systems , volume=

  122. [134]

    Microeconometrics , editor=

    Selection Bias and Self-Selection , author=. Microeconometrics , editor=. 2010 , publisher=

    2010

  123. [135]

    Identification and Estimation of a Discrete Game of Complete Information , year =

    Bajari, Patrick and Hong, Han and Ryan, Stephen P , journal =. Identification and Estimation of a Discrete Game of Complete Information , year =

  124. [136]

    What Happens When Wal-Mart Comes to Town: An Empirical Analysis of the Discount Retailing Industry , year =

    Jia, Panle , journal =. What Happens When Wal-Mart Comes to Town: An Empirical Analysis of the Discount Retailing Industry , year =

  125. [137]

    Competitive Price Discrimination , year =

    Armstrong, Mark and Vickers, John , journal =. Competitive Price Discrimination , year =

  126. [138]

    It Takes Two to Tango: Equilibria in a Model of Sales , year =

    Baye, Michael and Kovenock, Dan and De Vries, Casper , journal =. It Takes Two to Tango: Equilibria in a Model of Sales , year =

  127. [139]

    Search-Theoretic Models of the Labor Market: A Survey , year =

    Rogerson, Richard and Shimer, Robert and Wright, Randall , journal =. Search-Theoretic Models of the Labor Market: A Survey , year =

  128. [140]

    Wage Dispersion: Why Are Similar Workers Paid Differently? , year =

    Mortensen, Dale , publisher =. Wage Dispersion: Why Are Similar Workers Paid Differently? , year =

  129. [141]

    Optimal Nonparametric Estimation of First-price Auctions , year =

    Guerre, Emmanuel and Perrigne, Isabelle and Vuong, Quang , journal =. Optimal Nonparametric Estimation of First-price Auctions , year =

  130. [142]

    Journal of Economic Theory , year =

    Krishna, Vijay and Morgan, John , title =. Journal of Economic Theory , year =

  131. [143]

    Abraham and S

    I. Abraham and S. Athey and M. Babaioff and M. Grubb , journal =. Peaches, Lemons and Cookies: Designing Auction Markets with Dispersed Information , year =

  132. [144]

    Abramsky and A

    S. Abramsky and A. Brandenburger , journal =. The Sheaf-theoretic Structure of Non-locality and Contextuality , year =

  133. [145]

    Econometrica , Year =

    Bargaining and Reputation , Author =. Econometrica , Year =

  134. [146]

    Review of Economic Studies , Year =

    Optimal Learning by Experimentation , Author =. Review of Economic Studies , Year =

  135. [147]

    Econometrica , Year =

    Virtual Implementation in Iteratively Undominated Strategies: Complete Information , Author =. Econometrica , Year =

  136. [148]

    Abreu and H

    D. Abreu and H. Matsushima , journal =. A Response to Glazer and Rosenthal , year =

  137. [149]

    Journal of Economic Theory , Year =

    Exact Implementation , Author =. Journal of Economic Theory , Year =

  138. [150]

    A Behavioral Model of Bargaining with Endogeneous Types , Author =

  139. [151]

    Journal of Economic Theory , Year =

    Optimal Cartel Equilibrium with Imperfect Monitoring , Author =. Journal of Economic Theory , Year =

  140. [152]

    Econometrica , Year =

    Towards a Theory of Discounted Repeated Games with Imperfect Monitoring , Author =. Econometrica , Year =

  141. [153]

    Journal of Economic Theory , Year =

    Extremal Equilibria of Oligopolistic Supergames , Author =. Journal of Economic Theory , Year =

  142. [154]

    Econometrica , Year =

    Towards a Theory of Discounted Repeated Games , Author =. Econometrica , Year =

  143. [155]

    Economics in a Changing World: Microeconomics , Publisher =

    Implementation in Iteratively Undominated Strategies , Author =. Economics in a Changing World: Microeconomics , Publisher =. 1997 , Address =

    1997

  144. [156]

    Econometrica , Year =

    Virtual Implementation in Nash Equilibrium , Author =. Econometrica , Year =

  145. [157]

    Review of Economics and Statistics , Year =

    Moral Hazard in Health Insurance: Do Dynamic Incentives Matter? , Author =. Review of Economics and Statistics , Year =

  146. [158]

    Journal of Public Economics , Year =

    Political Economy of Ramsey Taxation , Author =. Journal of Public Economics , Year =

  147. [159]

    International Economic Review , Year =

    Advertising, Learning and Consumer Choice in Experience Good Markets: A Structural Empirical Examination , Author =. International Economic Review , Year =

  148. [160]

    Acharya and J

    A. Acharya and J. Ortner , title =

  149. [161]

    Econometrica , Year =

    The Network Origins of Aggregate Fluctuations , Author =. Econometrica , Year =

  150. [162]

    Review of Economics Studies , Year =

    Demand Reduction and Inefficiency in Multi-Unit Auctions , Author =. Review of Economics Studies , Year =

  151. [163]

    Marketing Science , Year =

    Conditioning Prices on Purchase History , Author =. Marketing Science , Year =

  152. [164]

    Review of Economic Studies , Year =

    Joint Projects Without Commitment , Author =. Review of Economic Studies , Year =

  153. [165]

    American Economic Review , Year =

    Selling and Trading Information in Financial Markets , Author =. American Economic Review , Year =

  154. [166]

    Econometrica , Year =

    Direct and Indirect Sale of Information , Author =. Econometrica , Year =

  155. [167]

    1988 , Address =

    Generalized Concavity , Author =. 1988 , Address =

    1988

  156. [168]

    Holden and T

    P Aghion and Drew Fudenberg and R. Holden and T. Kunimoto and O. Tercieux , journal =. Subgame-Perfect Implementation under Information Perturbations , year =

  157. [169]

    International Economic Review , Year =

    The Construction of Utility Functions from Expenditure Data , Author =. International Economic Review , Year =

  158. [170]

    American Economic Review , Year =

    Contracts as a Barrier to Entry , Author =. American Economic Review , Year =

  159. [171]

    American Economic Review , Year =

    Monopoly Price Discrimination and Demand Curvature , Author =. American Economic Review , Year =

  160. [172]

    European Economic Review , Year =

    On Renegotiation Design , Author =. European Economic Review , Year =

  161. [173]

    Econometrica , Year =

    Renegotiation Design with Unverifiable Information , Author =. Econometrica , Year =

  162. [174]

    Economic Theory , Year =

    Dynamic Duopoly with Learning through Market Experimentation , Author =. Economic Theory , Year =

  163. [175]

    Review of Economics and Statistics , Year =

    The Evolution of Markets and Entry, Exit and Survival of Firms , Author =. Review of Economics and Statistics , Year =

  164. [176]

    Econometrica , Year =

    A Model of Growth Through Creative Destruction , Author =. Econometrica , Year =

  165. [177]

    Stochastics and Stochastic Reports , Year =

    Multi-Armed Bandit Problems with Multiple Plays and Switching Cost , Author =. Stochastics and Stochastic Reports , Year =

  166. [178]

    European Economic Review , Year =

    Competition and Growth with Step-by-Step Innovation: An Example , Author =. European Economic Review , Year =

  167. [179]

    Quarterly Journal of Economics , Year =

    The Management of Innovation , Author =. Quarterly Journal of Economics , Year =

  168. [180]

    Journal of Political Economy , Year =

    Formal and Real Authority in Organizations , Author =. Journal of Political Economy , Year =

  169. [181]

    Journal of Optimization Theory and Applications , Year =

    Computation of Asymmetric Linear Complementarity Problems by Iterative Methods , Author =. Journal of Optimization Theory and Applications , Year =

  170. [182]

    Journal of Economic Theory , Year =

    Revenue Management by Sequential Sreening , Author =. Journal of Economic Theory , Year =

  171. [183]

    Quarterly Journal of Economics , Year =

    The Market for "Lemons": Qualitative Uncertainty and the Market Mechanism , Author =. Quarterly Journal of Economics , Year =

  172. [184]

    Marketing Science , Year =

    Consumer Learning and Brand Valuation: An Application on Over-The-Counter Drugs , Author =. Marketing Science , Year =

  173. [185]

    Dynamic Matching Market Design , Author =

  174. [186]

    Robust Virtual Implementation with Incomplete Information: Towards a Reinterpretation of the Wilson Doctrine , Author =

  175. [187]

    Albrecht, Brian C , title =

  176. [188]

    Review of Economic Studies , Year =

    Optimal Lending Contracts and Firm Dynamics , Author =. Review of Economic Studies , Year =

  177. [189]

    Econometrica , Year =

    Efficiency, Equilibrium, and Asset Pricing with Risk of Default , Author =. Econometrica , Year =

  178. [190]

    Bayesian Models in Economic Theory , Publisher =

    Equilibria in Which Prices Convey Information , Author =. Bayesian Models in Economic Theory , Publisher =. 1984 , Address =

    1984

  179. [191]

    Albaek and P

    S. Albaek and P. Mollgard and P. Overgaard , title =. Journal of Industrial Economics , year =

  180. [192]

    Review of Economic Studies , Year =

    Dynamic Optimal Taxation with Private Information , Author =. Review of Economic Studies , Year =

  181. [193]

    1985 , Address =

    Advanced Econometrics , Author =. 1985 , Address =

    1985

  182. [194]

    Annals of Mathematical Statistics , Year =

    A Definition of Subjective Probability , Author =. Annals of Mathematical Statistics , Year =

  183. [195]

    Asymmetric Information About Rivals' Types in Standard Auctions: An Experiment , Author =

  184. [196]

    Review of Economic Studies , Year =

    Market Provision of Broadcasting: A Welfare Analysis , Author =. Review of Economic Studies , Year =

  185. [197]

    Idiosyncratic Sentiments and Coordination Failures , Author =

  186. [198]

    Private Monitoring in Repeated Games , Author =

  187. [199]

    2011 , Month = Jul, Number =

    Cycles, Gaps, and the Social Value of Information , Author =. 2011 , Month = Jul, Number =

    2011

  188. [200]

    NBER Macroeconomics Annual , Year =

    Noisy Business Cycles , Author =. NBER Macroeconomics Annual , Year =

  189. [201]

    Decentralization, Communication, and the Origins of Fluctuations , Author =

  190. [202]

    Econometrica , Year =

    Sentiments , Author =. Econometrica , Year =

  191. [203]

    Wall Street and Silicon Valley: A Delicate Interaction , Author =

  192. [204]

    Econometrica , Year =

    Efficient Use of Information and Social Value of Information , Author =. Econometrica , Year =

  193. [205]

    Journal of the European Economic Association , Year =

    Policy with Dispersed Information , Author =. Journal of the European Economic Association , Year =

  194. [206]

    Anton and D.A

    J.J. Anton and D.A. Yao , journal =. Second Sourcing and the Experience Curve: Price Competition in Defense Procurement , year =

  195. [207]

    Apple, Computer Inc , note =

  196. [208]

    Semi-Parametric Estimation of Simultaneous Games with Incomplete Information , Author =

  197. [209]

    Arieli and Y

    I. Arieli and Y. Babichenko , journal =. Private Bayesian Persuasion , year =

  198. [210]

    1992 , Address =

    A First Course in Order Statistics , Author =. 1992 , Address =

    1992

  199. [211]

    On the Optimality of Dominant Strategy Auctions under Severe Information Asymmetry , Author =

  200. [212]

    Journal of Economic Theory , Year =

    Implementation in Principal-Agent Models of Adverse Selection , Author =. Journal of Economic Theory , Year =

  201. [213]

    Journal of Economic Theory , Year =

    Notes on Sequence Economies, Transaction Costs and Uncertainty , Author =. Journal of Economic Theory , Year =

  202. [214]

    Journal of Economic Theory , Year =

    Adverse Selection problems without the Spence-Mirrlees condition , Author =. Journal of Economic Theory , Year =

  203. [215]

    RAND Journal of Economics , Year =

    Competition in Two-Sided Markets , Author =. RAND Journal of Economics , Year =

  204. [216]

    Econometrica , Year =

    Multiproduct Nonlinear Pricing , Author =. Econometrica , Year =

  205. [217]

    Armstrong , journal =

    M. Armstrong , journal =. Price Discrimination by a Many-Product Firm , year =

  206. [218]

    Peer Effects and Social Networks in Education , Author =

  207. [219]

    1951 , Address =

    Social Choice and Individual Values , Author =. 1951 , Address =

    1951

  208. [220]

    Economics and Human Welfare: Essays in Honor of Tibor Scitovsky , Publisher =

    The Property Rights Doctrine and Demand Revelation under Incomplete Information , Author =. Economics and Human Welfare: Essays in Honor of Tibor Scitovsky , Publisher =. 1979 , Address =

    1979

  209. [221]

    European Economic Review , Year =

    Multi-Dimensional Screening: A User's Guide , Author =. European Economic Review , Year =

  210. [222]

    Journal of Business and Economic Statistics , Year =

    The Identification Power of Equilibrium in Simple Games , Author =. Journal of Business and Economic Statistics , Year =

  211. [223]

    Review of Economic Studies , Year =

    Search Deterrence , Author =. Review of Economic Studies , Year =

  212. [224]

    RAND Journal of Economics , Year =

    Properties of Scoring Auctions , Author =. RAND Journal of Economics , Year =

  213. [225]

    1972 , Address =

    Real Analysis and Probability , Author =. 1972 , Address =

    1972

  214. [226]

    IEEE Tansactions on Automatic Control , Year =

    Multi-Armed Bandits with Switching Penalities , Author =. IEEE Tansactions on Automatic Control , Year =

  215. [227]

    Position Auctions with Consumer Search , year =

    Athey, Susan and Ellison, Glenn , journal =. Position Auctions with Consumer Search , year =

  216. [228]

    American Economic Review Papers and Proceedings , Year =

    The Impact of Targeting Technology on Advertising Markets and Media Competition , Author =. American Economic Review Papers and Proceedings , Year =

  217. [229]

    Econometrica , Year =

    Identification of Standard Auction Models , Author =. Econometrica , Year =

  218. [230]

    Handbook of Econometrics , Publisher =

    Nonparametric Approaches to Auctions , Author =. Handbook of Econometrics , Publisher =. 2007 , Address =

    2007

  219. [231]

    Econometrica , Year =

    International Lending with Moral Hazard and Risk of Repudiation , Author =. Econometrica , Year =

  220. [232]

    Review of Economic Studies , Year =

    On the Efficient Distribution with Private Information , Author =. Review of Economic Studies , Year =

  221. [233]

    Journal of Economic Theory , Year =

    Efficiency and Equality in a Simple Model of Efficient Unemployment Insurance , Author =. Journal of Economic Theory , Year =

  222. [234]

    American Economic Review Papers and Proceedings , Year =

    Designing Efficient Mechanisms for Dynamic Bilateral Trading Games , Author =. American Economic Review Papers and Proceedings , Year =

  223. [235]

    Econometrica , Year =

    An Efficient Dynamic Mechanism , Author =. Econometrica , Year =

  224. [236]

    American Political Science Review , Year =

    Information Aggregation, Rationality, and the Condorcet Jury Theorem , Author =. American Political Science Review , Year =

  225. [237]

    Econometrica , Year =

    Epistemic Foundations for Nash Equilibrium , Author =. Econometrica , Year =

  226. [238]

    Ausubel and P

    L. Ausubel and P. Cramton , title =. Economic Theory , year =

  227. [239]

    Ausubel and P

    L. Ausubel and P. Cramton , title =

  228. [240]

    Econometrica , Year =

    Reputation in Bargaining and Durable Goods Monopoly , Author =. Econometrica , Year =

  229. [241]

    American Economic Review , Year =

    Rational Expectations in Games , Author =. American Economic Review , Year =

  230. [242]

    Handbook of Public Economics , Publisher =

    The Theory of Excess Burden and Optimal Taxation , Author =. Handbook of Public Economics , Publisher =. 1986 , Address =

    1986

  231. [243]

    1985 , Address =

    Handbook of Public Economics , Author =. 1985 , Address =

    1985

  232. [244]

    On Robust Constitution Design , Author =

  233. [245]

    1999 , Institution =

    On the Optimal Number of Representatives , Author =. 1999 , Institution =

    1999

  234. [246]

    Contribution to the Theory of Games , Publisher =

    Acceptable Points in General Cooperative N-Person Games , Author =. Contribution to the Theory of Games , Publisher =. 1959 , Address =

    1959

  235. [247]

    Journal of Mathematical Economics , Year =

    Subjectivity and Correlation in Randomized Strategies , Author =. Journal of Mathematical Economics , Year =

  236. [248]

    Econometrica , Year =

    Correlated Equilibrium as an Expression of Bayesian Rationality , Author =. Econometrica , Year =

  237. [249]

    The New Palgrave: A Dictionary of Economics , Publisher =

    Game Theory , Author =. The New Palgrave: A Dictionary of Economics , Publisher =. 1987 , Address =

    1987

  238. [250]

    1995 , Owner =

    Repeated Games with Incomplete Information , Author =. 1995 , Owner =

    1995

  239. [251]

    L. M. Ausubel and Paul Milgrom , booktitle =. The Lovely But Lonely Vickrey Auction , year =

  240. [252]

    American Economic Review , Year =

    An Efficient Ascending-Bid Auction for Multiple Objects , Author =. American Economic Review , Year =

  241. [253]

    1976 , Address =

    Nonlinear Programming , Author =. 1976 , Address =

    1976

  242. [254]

    Avery and P

    C. Avery and P. Resnick and R. Zeckhauser , journal =. The Market for Evaluations , year =

  243. [255]

    Avenhaus and B

    R. Avenhaus and B. Von Stengel and Shmuel Zamir , booktitle =. Inspection Games , year =

  244. [256]

    The Law of Large Demand for Information: A Comment , Author =

  245. [257]

    Economic Theory , Year =

    Collusive Communication Schemes in a First-Price Auction , Author =. Economic Theory , Year =

  246. [258]

    Baron and D

    D. Baron and D. Besanko , journal =. Regulation and Information in a Continuing Relationship , year =

  247. [259]

    Basar and P

    T. Basar and P. Bernhard , Publisher =. H. 1995 , Address =

    1995

  248. [260]

    Journal of Law and Economics , Year =

    Shared Information Goods , Author =. Journal of Law and Economics , Year =

  249. [261]

    Management Science , Year =

    Bundling Information Goods: Pricing, Profits, and Efficiency , Author =. Management Science , Year =

  250. [262]

    Interaction Patterns with Hidden Complementarities , Author =

  251. [263]

    Moderate Interactions in Games with Induced Complementarities , Author =

  252. [264]

    Regional Science and Urban Economics , Year =

    Interactions with Hidden Complementarities , Author =. Regional Science and Urban Economics , Year =

  253. [265]

    American Economic Review , title =

    Bar-Isaac, Heski and Caruana, Guillermo and Cu. American Economic Review , title =. 2012 , number =

    2012

  254. [266]

    Wanted: The Key Player , Author =

    Who's Who in Networks. Wanted: The Key Player , Author =. Econometrica , Year =

  255. [267]

    Journal of Economic Theory , Year =

    Dynamic Psychological Games , Author =. Journal of Economic Theory , Year =

  256. [268]

    Econometrica , Year =

    Existence of Cournot Equilibrium in Large Markets , Author =. Econometrica , Year =

  257. [269]

    Banerjee and Drew Fudenberg , note =

    A. Banerjee and Drew Fudenberg , note =. A Simple Model of Word-of-Mouth Learning , year =

  258. [270]

    Journal of Political Economy , Year =

    Decomposing Learning by Doing in New Plants , Author =. Journal of Political Economy , Year =

  259. [271]

    2007 , Owner =

    Handbook of Industrial Organization , Author =. 2007 , Owner =

    2007

  260. [272]

    Journal of Economic Theory , Year =

    Asymptotic Revenue Equivalence in Auctions , Author =. Journal of Economic Theory , Year =

  261. [273]

    ACM Conference on Electronic Commerce 2012 , Year =

    Optimal Mechanisms for Selling Information , Author =. ACM Conference on Electronic Commerce 2012 , Year =

    2012

  262. [274]

    2014 , Owner =

    Trading and Information Diffusion in Over-the-Counter Markets , Author =. 2014 , Owner =

    2014

  263. [275]

    Battaglini and R

    M. Battaglini and R. Lamba , title =. 2017 , owner =

    2017

  264. [276]

    Quarterly Journal of Economics , Year =

    Procurement Contracting with Time Incentives: Theory and Evidence , Author =. Quarterly Journal of Economics , Year =

  265. [277]

    Journal of the American Statistical Association , Year =

    A Regression Method for Real Estate Price Index Construction , Author =. Journal of the American Statistical Association , Year =

  266. [278]

    Econometrica , Year =

    Regulating a Monopolist with Unknown Costs , Author =. Econometrica , Year =

  267. [279]

    Review of Economic Studies , Year =

    Risk-Bearing and the Theory of Income Distribution , Author =. Review of Economic Studies , Year =

  268. [280]

    Quarterly Journal of Economics , Year =

    A Simple Model of Herd Behavior , Author =. Quarterly Journal of Economics , Year =

  269. [281]

    Proceedings of 3rd Conference on Electronic Commerce , Year =

    Concurrent Auctions Across the Supply Chain , Author =. Proceedings of 3rd Conference on Electronic Commerce , Year =

  270. [282]

    Barrett and S

    J. Barrett and S. Pironio , journal =. Popescu-Rohrlich Correlations as a Unit of Nonlocality , year =

  271. [283]

    Journal of Economic Theory , Year =

    On the Genericity of Full Surplus Extraction in Mechanism Design , Author =. Journal of Economic Theory , Year =

  272. [284]

    American Economic Review , Year =

    High and Declining Prices Signal Product Quality , Author =. American Economic Review , Year =

  273. [285]

    SIAM Journal of Control and Optimization , Year =

    Deterministic Impulse Control Problems , Author =. SIAM Journal of Control and Optimization , Year =

  274. [286]

    American Economic Review , Year =

    Price Regulation, Quality, and Asymmetric Information , Author =. American Economic Review , Year =

  275. [287]

    Journal of Economic Theory , Year =

    Strong Belief and Forward Induction Reasoning , Author =. Journal of Economic Theory , Year =

  276. [288]

    Siniscalchi , title =

    P Battigalli and M. Siniscalchi , title =. BE Press Advances in Theoretical Economics , year =

  277. [289]

    Games and Economic Behavior , Year =

    Rationalizable Bidding in First-Price Auctions , Author =. Games and Economic Behavior , Year =

  278. [290]

    Journal of Economic Theory , Year =

    Hierarchies of Conditional Beliefs and Interactive Epistemology in Dynamic Games , Author =. Journal of Economic Theory , Year =

  279. [291]

    Econometrica , Year =

    Equilibrium Selection in Signalling Games , Author =. Econometrica , Year =

  280. [292]

    A Simple Model of Voice , Author =

  281. [293]

    Econometrica , Year =

    Denumerable-Armed Bandits , Author =. Econometrica , Year =

  282. [294]

    Econometrica , Year =

    Switching Costs and the Gittins Index , Author =. Econometrica , Year =

  283. [295]

    Econometrica , Year =

    Multiple Referrals and Multi-Dimensional Cheap Talk , Author =. Econometrica , Year =

  284. [296]

    Battaglini , journal =

    M. Battaglini , journal =. Long-Term Contracting with Markovian Consumers , year =

  285. [297]

    Games and Economic Behavior , Year =

    Optimality and Renegotiation in Dynamic Contracting , Author =. Games and Economic Behavior , Year =

  286. [298]

    Journal of Economic Theory , Year =

    On Rationalizability in Extensive Games , Author =. Journal of Economic Theory , Year =

  287. [299]

    Rationalizability in Incomplete Information Games , Author =

  288. [300]

    Review of Economic Studies , Year =

    Information Aquisition in Financial Markets , Author =. Review of Economic Studies , Year =

Pith tools

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