arXiv — Machine Learning · · 3 min read

Optimizing ARDL Models for Retail Sales Forecasting and Fair Pricing

Mirrored from arXiv — Machine Learning for archival readability. Support the source by reading on the original site.

Computer Science > Machine Learning

arXiv:2607.09956 (cs)
[Submitted on 10 Jul 2026]

Title:Optimizing ARDL Models for Retail Sales Forecasting and Fair Pricing

View a PDF of the paper titled Optimizing ARDL Models for Retail Sales Forecasting and Fair Pricing, by Sujay Uday Rittikar
View PDF HTML (experimental)
Abstract:Pricing food products to balance profitability with consumer welfare is a central challenge for retailers. Dynamic pricing is widely used to maximize revenue, yet most pricing models optimize business objectives while overlooking consumer fairness. This paper studies the risk of consumer exploitation under dynamic food pricing in Canada and proposes a methodology that embeds fairness constraints directly into retail sales forecasting. We model total retail trade sales with a log--log Autoregressive Distributed Lag (ARDL) specification, in which the coefficient on a product price is a sales elasticity, and pose the pricing problem as maximizing forecast sales subject to price bounds anchored to the Consumer Price Index (CPI). We solve this problem with both Linear Programming (LP) and Simulated Annealing (SA), under single-product and multi-product configurations. A key finding is that the fitted nominal elasticities are positive. As a result, an unconstrained sales-maximizer would push every price to its upper bound, and the CPI ceiling is the safeguard that prevents this. Simulated Annealing instead settles on conservative, interior prices that lower consumer cost while still meeting the sales target. We benchmark forecast accuracy against naive, seasonal-naive, ARIMA, and SARIMA baselines, and a CPI-deflated re-specification shows that the positive nominal elasticities are largely an inflation-driven artifact. The result is a transparent, fairness-aware pricing framework.
Comments: 12 pages, 1 figure
Subjects: Machine Learning (cs.LG); Computational Engineering, Finance, and Science (cs.CE)
Cite as: arXiv:2607.09956 [cs.LG]
  (or arXiv:2607.09956v1 [cs.LG] for this version)
  https://doi.org/10.48550/arXiv.2607.09956
arXiv-issued DOI via DataCite (pending registration)

Submission history

From: Sujay Uday Rittikar [view email]
[v1] Fri, 10 Jul 2026 20:19:38 UTC (312 KB)
Full-text links:

Access Paper:

Current browse context:

cs.LG
< prev   |   next >
Change to browse by:

References & Citations

Loading...

BibTeX formatted citation

loading...
Data provided by:

Bookmark

BibSonomy Reddit
Bibliographic Tools

Bibliographic and Citation Tools

Bibliographic Explorer Toggle
Bibliographic Explorer (What is the Explorer?)
Connected Papers Toggle
Connected Papers (What is Connected Papers?)
Litmaps Toggle
Litmaps (What is Litmaps?)
scite.ai Toggle
scite Smart Citations (What are Smart Citations?)
Code, Data, Media

Code, Data and Media Associated with this Article

alphaXiv Toggle
alphaXiv (What is alphaXiv?)
Links to Code Toggle
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub Toggle
DagsHub (What is DagsHub?)
GotitPub Toggle
Gotit.pub (What is GotitPub?)
Huggingface Toggle
Hugging Face (What is Huggingface?)
ScienceCast Toggle
ScienceCast (What is ScienceCast?)
Demos

Demos

Replicate Toggle
Replicate (What is Replicate?)
Spaces Toggle
Hugging Face Spaces (What is Spaces?)
Spaces Toggle
TXYZ.AI (What is TXYZ.AI?)
Related Papers

Recommenders and Search Tools

Link to Influence Flower
Influence Flower (What are Influence Flowers?)
Core recommender toggle
CORE Recommender (What is CORE?)
IArxiv recommender toggle
IArxiv Recommender (What is IArxiv?)
About arXivLabs

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Discussion (0)

Sign in to join the discussion. Free account, 30 seconds — email code or GitHub.

Sign in →

No comments yet. Sign in and be the first to say something.

More from arXiv — Machine Learning