Online assortment and market segmentation under Bertrand competition with set-dependent revenues

DOI10.1137/21M1400134zbMATH Open1493.91082arXiv2003.07695OpenAlexW3016976599MaRDI QIDQ5084101FDOQ5084101

Authors: S. Rasoul Etesami 

Publication date: 23 June 2022

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Abstract: We consider an online assortment problem with $[n]:=1,2,ldots,n$ sellers, each holding exactly one item $iin[n]$ with initial inventory $c_{i}inmathbb{Z}_{+}$, and a sequence of homogeneous buyers arriving over a finite time horizon $t=1,2,ldots,m$. There is an online platform whose goal is to offer a subset $S_{t}subseteq[n]$ of sellers to the arriving buyer at time $t$ to maximize the expected revenue derived over the entire horizon while respecting the inventory constraints. Given an assortment $S_t$ at time $t$, it is assumed that the buyer will select an item from $S_t$ based on the well-known multinomial logit model, a well-justified choice model from the economic literature. In this model, the revenue obtained from selling an item $i$ at a given time $t$ critically depends on the assortment $S_t$ offered at that time and is given by the Nash equilibrium of a Bertrand game among the sellers in $S_t$. This imposes a strong dependence/externality among the offered assortments, sellers' revenues, and inventory levels. Despite that challenge, we devise a constant competitive algorithm for the online assortment problem with homogeneous buyers. We also show that the online assortment problem with heterogeneous buyers does not admit a constant competitive algorithm. To compensate for that issue, we then consider the assortment problem under an offline setting with heterogeneous buyers. Under a mild market consistency assumption, we show that the generalized Bertrand game admits a pure Nash equilibrium over general buyer-seller bipartite graphs. Finally, we develop an $O(lnm)$-approximation algorithm for optimal market segmentation of the generalized Bertrand game which allows the platform to derive higher revenues by partitioning the market into smaller pools.

Full work available at URL: https://arxiv.org/abs/2003.07695

Recommendations

• Algorithms for Online Matching, Assortment, and Pricing with Tight Weight-Dependent Competitive Ratios
• Assortment optimisation under a general discrete choice model: a tight analysis of revenue-ordered assortments
• A branch-and-cut algorithm for the latent-class logit assortment problem
• Approximation algorithms for dynamic assortment optimization models
• Assortment optimization under the paired combinatorial logit model

zbMATH Keywords

inventory managementrevenue managementpure Nash equilibriummultinomial logit modelBertrand gameonline assortmentoptimal market segmentation

Mathematics Subject Classification ID

Applications of game theory (91A80) Inventory, storage, reservoirs (90B05) Special types of economic markets (including Cournot, Bertrand) (91B54)

Cites Work

• Title not available (Why is that?)
• Potential games
• Dynamic assortment optimization with a multinomial logit choice model and capacity constraint
• Revenue Management Under a General Discrete Choice Model of Consumer Behavior
• Existence and Uniqueness of Equilibrium Points for Concave N-Person Games
• Equilibrium Points in Nonzero-Sum n-Person Submodular Games
• Characterizations of the Existence of Equilibria in Games with Discontinuous and Non-quasiconcave Payoffs
• How experts can solve LPs online
• On the efficiency of Bertrand and Cournot equilibria with product differentiation
• Network Cournot competition
• Coordinating Inventory Control and Pricing Strategies with Random Demand and Fixed Ordering Cost: The Finite Horizon Case
• On the convergence of regret minimization dynamics in concave games
• Near Optimal Online Algorithms and Fast Approximation Algorithms for Resource Allocation Problems
• Optimal search segmentation mechanisms for online platform markets
• Optimal Pricing for a Multinomial Logit Choice Model with Network Effects
• Asymptotic optimality of constant-order policies for lost sales inventory models with large lead times
• Bandits with Knapsacks
• Technical Note—Capacitated Assortment Optimization Under the Multinomial Logit Model with Nested Consideration Sets

This page was built for publication: Online assortment and market segmentation under Bertrand competition with set-dependent revenues

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5084101)