SearcharxivSearch

arXiv · 1601.07365

Endogenizing the Cost Parameter in Cournot Oligopoly

Abstract

We study the effects of endogenous cost formation in the classic Cournot oligopoly through an extended two-stage game. The competing Cournot firms produce low-cost but limited quantities of a single homogeneous product. For additional procurements, they may refer to a revenue-maximizing supplier who sets a wholesale price prior to their orders. We express this chain as a two-stage game and study its equilibrium under two different information levels: complete and incomplete information on the side of the supplier about the actual market demand. In the deterministic case, we derive the unique subgame perfect Nash equilibrium for different values of the retailers' capacity levels, supplier's cost and market demand. To study the incomplete information case, we model demand uncertainty via a continuous probability distribution. Under mild assumptions, we characterize the supplier's optimal pricing policy as a fixed point of a proper translation of his expectation about the orders that he will receive from the retailers. If this expectation is decreasing in his price, then such an optimal policy always exists and is unique. Based on this characterization, we are able to proceed with comparative statics and sensitivity analysis, both analytically and numerically. Incomplete information gives rise to market inefficiencies because the supplier may ask for a too high price. Increasing supplier's cost results in increasing wholesale prices, decreasing orders from the retailers and hence decreasing consumer surplus. Increasing retailers' production capacities results in decreasing wholesale prices and increasing consumer surplus. Finally, as the number of second-stage retailers increases, the supplier's profit may initially rise but eventually drops.

Explore related subjects

Keep this discovery

BibTeXRIS

Stefanos Leonardos, Costis Melolidakis. 2016-01-13. Endogenizing the Cost Parameter in Cournot Oligopoly. https://doi.org/10.1142/s0219198920400046

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Deterministic and Random Bipartite Matching on General Networks: Convex Flow Reformulation, Asymptotic Properties, and Fast Algorithms

Minimum-distance bipartite matching on general networks has numerous applications various fields. This paper first focuses on deterministic problems and presents an exact edgewise-separable convex-flow reformulation. By introducing a smooth monotone rearrangement approximation of the edge-wise imbalance profiles, the convex-flow reformulation's can be solved efficiently. If we further conduct a first-order resistance-based approximation of the convex program, a one-step Laplacian-based estimator can be analytically derived in closed forms. The paper also studies random problems where supply and demand points are randomly distributed. We show that the expected optimal matching distance scales with the square root of the number of points if the supply/demand point distributions are identical, or linearly otherwise. In the former case, the optimal flow is proven to be centered, symmetric, and sub-Gaussian. In the latter case, the limiting resistance network characterizes how supply-demand imbalance is redistributed and motivates a fast algorithm that approximate the optimal flow based on the limiting resistance. Numerical experiments show that the proposed estimators closely approximate the exact matching cost while substantially reducing computation time. The proven theoretical properties of the random matching solution are numerically verified by large-scale Monte Carlo simulations.

math.OC

Conformal-DRO: Distributionally Robust Optimization with Conformalized Ambiguity Set

Data-driven distributionally robust optimization (DRO) typically treats the conditional outcome law as fixed and uses ambiguity sets to capture estimation error. This paper studies latent distributional heterogeneity, where each instance has an unobserved law but contributes only one observation, so uncertainty persists even if the mixture law is known. We propose Conformal-DRO, which uses nested conformal regions to construct an ambiguity set for the future latent law. Under exchangeability, the set covers this law with probability at least $1-\alpha$ in finite samples, without estimating underlying latent laws or their mixing mechanism. The conformal path induces a data-driven transport geometry, while $\alpha$ determines the radius. The worst-case problem reduces to a finite linear program over conformal shells and admits sparse adversarial solutions. The resulting robust value provides a finite-sample certificate for the selected decision's expected cost.

math.OC

The best approximation tuple: an extension of the Cheney-Goldstein algorithm and results to the multiple sets case

In this paper we extend the algorithm and several results published in the celebrated 1959 paper of Cheney and Goldstein about the best approximation pair (BAP) problem in two separate directions. One is the consideration of more than two sets. The other is the ability to handle each set as an intersections of a finite family of sets. We call the resulting problem the "Best Approximation Tuple (BAT) problem". The fundamental observation that leads to this generalizations is to recognize and handle one set (the "pivot set") as different from the remaining sets (the "satellite sets") instead of seeking cycles as the minimizers of a target functional. This enable us to overcome a certain theoretical obstacle related to cycles and minimizers of general functionals. We prove the convergence of the algorithm to the unique solution of the problem in the Euclidean case with strictly convex and compact satellite sets. Because of the lack of Fej\'er monotonicity, our convergence analysis is not standard, and is based on almost unknown properties of orthogonal projections regarding equality and inequality in the definition of nonexpansiveness.

math.OC