Rashmi Ranjan Bhuyan

dblp:344/1869 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
1since 2021 · last 2024
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 1 · 1 first-author · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
1 paper
Algorithmic game theory and mechanism design · 67% Mathematical optimization · 33%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Algorithmic game theory and mechanism design
dynamic pricing
0.812024
Structured Dynamic Pricing: Optimal Regret in a Global Shrinkage Model · J. Mach. Learn. Res. 2024
Algorithmic game theory and mechanism design
regret minimization
0.812024
Structured Dynamic Pricing: Optimal Regret in a Global Shrinkage Model · J. Mach. Learn. Res. 2024
Mathematical optimization › stochastic optimization › stochastic gradient methods
stochastic gradient descent
0.812024
Structured Dynamic Pricing: Optimal Regret in a Global Shrinkage Model · J. Mach. Learn. Res. 2024

Methods — techniques the papers use, named apart from their topics

spatial autoregressive model · 0.8regret analysis · 0.8penalized stochastic gradient descent · 0.8
YearPublicationVenuePosition
2024 Structured Dynamic Pricing: Optimal Regret in a Global Shrinkage Model
abstract
We consider dynamic pricing strategies in a streamed longitudinal data set-up where the objective is to maximize, over time, the cumulative profit across a large number of customer segments. We consider a dynamic model with the consumers’ preferences as well as price sensitivity varying over time. Building on the well-known finding that consumers sharing similar characteristics act in similar ways, we consider a global shrinkage structure, which assumes that the consumers’ preferences across the different segments can be well approximated by a spatial autoregressive (SAR) model. In such a streamed longitudinal setup, we measure the performance of a dynamic pricing policy via regret, which is the expected revenue loss compared to a clairvoyant that knows the sequence of model parameters in advance. We propose a pricing policy based on penalized stochastic gradient descent (PSGD) and explicitly characterize its regret as functions of time, the temporal variability in the model parameters as well as the strength of the auto-correlation network structure spanning the varied customer segments. Our regret analysis results not only demonstrate asymptotic optimality of the proposed policy but also show that for policy planning it is essential to incorporate available structural information as policies based on unshrunken models are highly sub-optimal in the aforementioned set-up. We conduct simulation experiments across a wide range of regimes as well as real-world networks based studies and report encouraging performance for our proposed method.
Rashmi Ranjan Bhuyan, Adel Javanmard, Sungchul Kim, Gourab Mukherjee, Ryan Rossi, Tong Yu 0001, Handong Zhao
J. Mach. Learn. Res.1