Search NASA⌕ Search

DOE OSTI · 21480246

Dynamic Bertrand Oligopoly

Abstract

We study continuous time Bertrand oligopolies in which a small number of firms producing similar goods compete with one another by setting prices. We first analyze a static version of this game in order to better understand the strategies played in the dynamic setting. Within the static game, we characterize the Nash equilibrium when there are N players with heterogeneous costs. In the dynamic game with uncertain market demand, firms of different sizes have different lifetime capacities which deplete over time according to the market demand for their good. We setup the nonzero-sum stochastic differential game and its associated system of HJB partial differential equations in the case of linear demand functions. We characterize certain qualitative features of the game using an asymptotic approximation in the limit of small competition. The equilibrium of the game is further studied using numerical solutions. We find that consumers benefit the most when a market is structured with many firms of the same relative size producing highly substitutable goods. However, a large degree of substitutability does not always lead to large drops in price, for example when two firms have a large difference in their size.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Ledvina, Andrew, Sircar, Ronnie. 2011-02-15. Dynamic Bertrand Oligopoly. https://doi.org/10.1007/s00245-010-9110-0. https://searchnasa.com/record/osti%3A21480246/dynamic-bertrand-oligopoly

Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Search NASA by Indiciae: BibTeX · RIS.

KEEP EXPLORING

Related reports

TANTE: Time-adaptive operator learning via neural Taylor expansion

Operator learning for time-dependent partial differential equations (PDEs) has seen rapid progress in recent years, enabling efficient approximation of complex spatiotemporal dynamics. However, most existing methods rely on fixed time step sizes during rollout, which limits their ability to adapt to varying temporal complexity and often leads to error accumulation. In this work, we propose the Time-Adaptive Transformer with Neural Taylor Expansion (TANTE), a novel operator-learning framework that produces continuous-time predictions with adaptive step sizes. TANTE predicts future states by performing a Taylor expansion at the current state, where neural networks learn both the higher-order temporal derivatives and the local radius of convergence. This allows the model to dynamically adjust its rollout based on the local behavior of the solution, thereby reducing cumulative error and improving computational efficiency. We demonstrate the effectiveness of TANTE across a wide range of PDE benchmarks, achieving superior accuracy and adaptability compared to fixed-step baselines, delivering accuracy gains of 60-80 % and speed-ups of 30-40 % at inference time.

97 MATHEMATICS AND COMPUTING↗

Structured illumination for surface-resolved grazing-incidence X-ray scattering

Grazing-incidence (GI) scattering techniques are widely used to characterize thin films, offering high surface sensitivity and insight into morphology and structure. However, these approaches typically provide statistical averaged information due to elongated footprint or limited spatial resolution due to beam size. Here we introduce a method that combines structured illumination with GI X-ray scattering and leverages our computational imaging approach to resolve local structural details. We demonstrate that our method captures local features of an organic semiconductor thin film without the need for sample rotation as in tomography. The method expands GI techniques from statistical averaging to high-resolution imaging, thereby providing the capability for detailed analysis of local material properties, such as domain shape, orientation and polymorphism, which are critical for advancing material design towards more efficient and tailored materials.

97 MATHEMATICS AND COMPUTING↗