SearcharxivSearch

arXiv · 2603.13599

Dynamic Wholesale Pricing under Censored-Demand Learning

Abstract

This paper studies dynamic wholesale pricing and ordering in a two-tier supply chain where firms share POS data and learn about demand from censored demand data. When stockouts occur, unmet demand is unobserved, so the retailer's order quantity affects not only current profits but also the informativeness of future demand signals. This creates a strategic interaction between pricing, ordering, and learning: the manufacturer can influence the pace of learning through wholesale prices, whereas the retailer internalizes the effect of inventory decisions on future information. We analyze a finite-horizon dynamic game in which a manufacturer sets a wholesale price, the retailer then chooses an order quantity, demand is realized, and both firms observe sales. For Weibull demand with a conjugate prior, we extend a dimensionality-reduction approach from single-agent inventory learning models to a strategic supply-chain setting and use it to establish the existence of a Markov perfect equilibrium. For exponential demand, we further show that the equilibrium is unique and admits a recursive characterization. Our numerical analysis shows that public learning can create conflicting incentives in the supply chain: In order to induce larger orders and reduce future censoring, the manufacturer chooses a wholesale price that is lower than a myopic benchmark. By contrast, because of its forward-looking ordering incentive, the retailer may prefer slower learning to avoid strengthening the manufacturer's future wholesale-pricing position.

Explore related subjects

Keep this discovery

BibTeXRIS

Michalis Deligiannis, Marco Scarsini, Xavier Venel. 2026-03-13. Dynamic Wholesale Pricing under Censored-Demand Learning. https://arxiv.org/abs/2603.13599

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

KEEP EXPLORING

Related papers

MMS Allocation for Chores with Online Agent Arrivals

We study the fair allocation of $m$ indivisible chores to $n$ agents with subadditive cost functions arriving online in an arbitrary order. Upon an agent's arrival, we are informed of her cost function and must irrevocably assign her a set of chores. We focus on the Maximin Share (MMS) fairness notion and aim to compute an allocation in which all items are assigned, and no agent incurs a cost more than $\alpha$ times her MMS. Without any prior information about the instance (other than $n$ and $m$), we design an algorithm with a competitive ratio of $O(\min\{n, k\log^{1+\epsilon}k, \log m\})$ for any constant $\epsilon > 0$, where $k$ denotes the number of cost function types. Our bound matches the best known offline approximation guarantees for MMS under subadditive costs and is nearly optimal with respect to all three parameters: we show that even for binary additive cost functions, no online algorithm can achieve a competitive ratio of $o(\min\{n, k\log k, \log m\})$. We then consider the setting in which the $k$ cost function types are known in advance (though the realized types of arriving agents are not). For additive cost functions, we provide an algorithm with a competitive ratio of $O(\min\{\log k, \log(kn)/\log\log(kn)\})$, and show that constant-competitive algorithms do not exist for general $k$, even for the binary additive setting. For binary additive functions when $k \le n$, we propose a $3$-competitive algorithm and establish a lower bound of $2$.

cs.GT

Truncated Noisy Best-Response Algorithms: Toward Game Theoretic Learning with Safety Guarantees

We consider a game theoretic approach to solve multi-agent coordination problems with submodular maximization objectives. It is known for such problems that the Nash equilibria for the corresponding game are always within 50% of the optimal, but that the equilibria which achieve this worst-case bound are not stable. To exploit this instability, we propose a family of algorithms which we call Truncated Noisy Best-Response (TNBR) Algorithms. These algorithms are flexibly characterized by agents asynchronously and stochastically selecting actions from a neighbourhood of their best response payoffs. We compute bounds on the recurrent classes of TNBR algorithms' associated Markov chains. Our bounds fall into two categories: first, "Performance" bounds ensure that TNBR algorithms always have a high-value recurrent state; second, "Safety" bounds ensure that TNBR algorithms never have arbitrarily-bad recurrent states. Furthermore, these two types of bounds are linked by a waterbed-like effect: every game with a poor Safety guarantee necessarily has a favorable Performance guarantee.

cs.GT

Existence of the Core in Approval-Based Committee Elections

We settle the main open question in the theory of approval-based multi-winner elections: we show that there always exists a committee in the core. The core is a stability and group fairness concept. The proof introduces a new voting rule that optimizes an entropy-like objective function over committees and payment systems. All local optima of this objective function lie in the core, which implies that a core committee can be found in polynomial time.

cs.GT