Search arXivSearch

arXiv · 2509.24720

Dynamic Pricing of an Expiring Item under Strategic Buyers with Stochastic Arrival

Abstract

We study the optimal dynamic pricing of an expiring ticket or voucher, sold by a time-sensitive seller to strategic buyers who arrive stochastically with private values. The expiring nature creates a conflict: the seller's urgency to sell before expiration drives price reductions, which in turn incentivize buyers to wait. We seek the seller's optimal pricing policy that resolves this tension. The main analytical challenge is that buyer type is two-dimensional (valuation and arrival time), which makes equilibrium intractable under general strategies. To address this, we introduce the Value-Based Threshold (VBT) strategy, a tractable framework that decouples these two dimensions. Using this framework, we prove equilibrium existence via an ordinary differential equation and provide a constructive procedure for its characterization. We then derive near-optimal pricing policies for two stylized regimes: a constant price in thin markets and a linear discount in thick markets. Numerical frontier analysis confirms these benchmarks and shows how optimal policy adapts as the seller's time sensitivity changes. Our findings clarify the conflict between quick sales and strategic waiting. Sellers facing thick markets or high time sensitivity benefit from linear discounts, while in thin markets a constant price neutralizes buyers' incentive to wait. We also show this simple policy remains robust across broad conditions. For patient sellers, a quasi-auction schedule that maintains a high price until a sharp final drop is most effective in aggregating demand.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Suyeon Choi, Changhyun Kwon, Seungki Min. 2025-09-29. Dynamic Pricing of an Expiring Item under Strategic Buyers with Stochastic Arrival. https://arxiv.org/abs/2509.24720

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

KEEP EXPLORING

Related papers

Coverage Games

We introduce and study coverage games - a novel framework for multi-agent planning in settings in which a system operates several agents but does not have full control on them, or interacts with an environment that consists of several agents. The game is played between a coverer, who has a set of objectives, and a disruptor. The coverer operates several agents that interact with the adversarial disruptor. The coverer wins if every objective is satisfied by at least one agent. Otherwise, the disruptor wins. Coverage games thus extend traditional two-player games with multiple objectives by allowing a (possibly dynamic) decomposition of the objectives among the different agents. They have many applications, both in settings where the system is the coverer (e.g., multi-robot surveillance, coverage in multi-threaded systems) and settings where it is the disruptor (e.g., prevention of resource exhaustion, ensuring non-congestion). We first study the theoretical properties of coverage games, including determinacy, and the ability to a priori decompose the objectives among the agents. We then study the problems of deciding whether the coverer or the disruptor wins. Besides a comprehensive analysis of the tight complexity of the problems, we consider interesting special cases, such as the one-player cases and settings with a fixed number of agents or objectives.

cs.GT

Trading Proportionality for Strategic Robustness in Multi-Winner Approval Voting

Classical strategyproofness assumes a manipulator either knows how everyone else votes or is willing to gamble as if they did. Real voters rarely do. The recently introduced RAT-degree measures how many other participants' reports an agent must actually observe before a manipulation becomes strictly safe, interpolating between full truthfulness and immunity to blind manipulation. While previously explored in auctions and single-winner settings, we bring this measure to multi-winner elections. We apply it to Approval-Based Committee (ABC) rules under free-riding: a voter drops approved candidates from their truthful ballot to concentrate weight on marginal ones. We first analyze Proportional Approval Voting (PAV). Knowledge of $\lceil n/k \rceil$ ballots already enables a safe and strictly profitable drop, whereas knowledge of at most $\lfloor n/(k+1) \rfloor - 1$ ballots leaves the rule completely immune; an explicit instance shows the latter bound cannot be raised in general. Since a manipulator informed about roughly a $1/k$ fraction of the electorate therefore suffices, we ask how much proportionality must be surrendered to buy strategic robustness. We introduce $d$-RPAV, a parameterized family of Thiele rules with weights $d/(j+d-1)$ that recovers PAV at $d = 1$ and approaches Approval Voting (AV) as $d$ grows. We prove that $d$-RPAV satisfies $α$-Justified Representation ($α$-JR) for $α= d$, and is immune to safe free-riding given up to $\lfloor dn/(k+2d-1) \rfloor - 1$ known ballots, yielding a clean and tunable trade-off between proportional representation and strategic robustness.

cs.GT

Online Fair Division: Pushing the Frontier of Approximate Proportionality

Online fair division captures allocation problems in which indivisible resources arrive over time and must be assigned before future resources are known. Understanding what fairness remains achievable when allocation decisions are immediate and irrevocable is a fundamental question in this setting. We study deterministic online allocation among $n$ agents with nonnegative additive valuations, where the number of goods is unknown and the adversary can adapt to previous allocation decisions. We focus on proportionality up to one good (PROP1) and examine how advance information affects the achievable guarantees. Without additional future information, we give a deterministic algorithm that guarantees $Ω(\frac{1}{\log(nm)})$-PROP1 after every round, where $m$ is the number of goods at termination. We complement this result by showing that, for every $n$ and sufficiently large $m$, every deterministic algorithm has an adaptive instance with $m$ goods on which its allocation has PROP1 approximation guarantee $O(\frac{\log \log m}{\log m})$. Thus, when the number of agents is fixed, our upper and lower bounds on the competitive ratio differ by at most an $O(\log\log m)$ factor. These results answer an open question proposed by Choo et al. on whether a nontrivial deterministic approximation for PROP1 can be obtained. We also study the setting where the algorithm knows the predictions of the maximum item value for every agent. When the predictions are accurate, we give a deterministic $\frac{1}{2}$-PROP1 algorithm, improving the $\frac{1}{n}$ guarantee of Choo et al. to a constant. We further establish an explicit upper bound below one on the competitive ratio, even for two agents with accurate predictions. Finally, we give a single deterministic algorithm that guarantees $\frac{1}{2}$-PROP1 when predictions are accurate and $Ω(\frac{1}{\log (nm)})$-PROP1 for arbitrary predictions.

cs.GT