Learning to Price under Unknown Demand

This direction is split into other directions: exploration-exploitation tradeoff (exploration-exploitation trade-off). Its last version stays readable and citable here.

Version 1 of 174 papers82 conceptsfrozen 2026-10-04

In a perfect market, a seller knows exactly how much every customer is willing to pay. In the real world, this "demand curve" is a mystery. To find the optimal price, a seller must experiment—but every experiment has a cost. If you price too high, you lose a sale; if you price too low, you leave money on the table.

This research direction explores how algorithms can navigate the fundamental tension between exploration (testing prices to learn the demand curve) and exploitation (using current knowledge to maximize revenue).

The Price of Information

The core challenge in dynamic pricing is that information is not free. As Sanmay Das and Malik Magdon-Ismail discovered in Adapting to a Market Shock: Optimal Sequential Market-Making, a profit-maximizing agent may intentionally take short-term losses to "buy" information. By narrowing spreads during periods of high uncertainty, a market-maker can solicit more trades, which in turn reveals the true market value faster.

This "regret"—the difference between the revenue earned and the revenue an omniscient seller would have made—is the primary metric of success. Researchers like Cong Shi and Siqian Shen have developed algorithms like BLinUCB to prove that even in complex systems with reusable resources (like cloud VMs), it is possible to achieve sublinear regret, meaning the cost of learning diminishes over time (Online Learning and Pricing with Reusable Resources).

Context and the Catalyst of Noise

Modern pricing rarely happens in a vacuum; it depends on "context" like weather, user location, or product features. While adding more features usually makes learning harder (the "curse of dimensionality"), Sheng Qiang revealed a counterintuitive phenomenon in Dynamic Pricing with Demand Covariates: including even irrelevant noise in a model can actually improve performance. The noise forces the algorithm to vary prices just enough to prevent it from getting stuck at a suboptimal "greedy" price, effectively automating the exploration process.

However, not all price points are equally informative. Simeng Shao and Hamid Nazerzadeh point out that certain price levels yield zero new information about consumer preferences, even if they are potentially optimal for revenue (Multi-Product Dynamic Pricing in High-Dimensions with Heterogenous Price Sensitivity). This creates a "learning floor" where a seller must decide whether to stay at a profitable but uninformative price or move to a less profitable one to refine their model.

Learning Under Constraints

In many industries, the seller's hands are tied by physical or policy constraints.

Strategic Agents and Market Discovery

The problem becomes even more complex when the "demand" is actually a strategic human or another algorithm. In repeated auctions, a buyer might intentionally refuse to buy at a certain price today to trick the seller's learning algorithm into lowering prices tomorrow. Anton Zhiyanov and Alexey Drutsa developed bisection-based pricing to counter this, using "penalization" phases to force strategic buyers to reveal their true valuations (Bisection-Based Pricing for Repeated Contextual Auctions against Strategic Buyer).

Finally, this research extends to two-sided markets. Soumya Basu and Abishek Sankararaman demonstrated that in double auctions where neither buyers nor sellers know their own valuations, a "domination of information flow" strategy—where buyers overbid and sellers underbid—can lead to efficient price discovery (Double Auctions with Two-sided Bandit Feedback).

By treating price as a tool for both revenue and communication, this field provides the mathematical foundation for markets that learn as they trade.

Papers in this version

Showing 60 of 74 papers.

History & citationVersion 1 · 2026-10-04

Split into other directions · Permanent link

View frozen version 1

Cite this direction

Latest version (a living page):

@misc{lacuna_learning_to_price_under_unknown_demand_2160cdf7,
  title = {Learning to Price under Unknown Demand},
  author = {{Lacuna}},
  howpublished = {Lacuna research direction},
  year = {2026},
  url = {https://lacuna.tiptreesystems.com/direction/learning-to-price-under-unknown-demand/rdr_2160cdf722ab417d8205ec5132e851e0},
  note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-22},
}

This exact version (version 1, frozen text):

@misc{lacuna_learning_to_price_under_unknown_demand_2160cdf7_v1,
  title = {Learning to Price under Unknown Demand},
  author = {{Lacuna}},
  howpublished = {Lacuna research direction},
  year = {2026},
  url = {https://lacuna.tiptreesystems.com/direction/learning-to-price-under-unknown-demand/rdr_2160cdf722ab417d8205ec5132e851e0/v/1},
  note = {Version 1, frozen 2026-10-04. Accessed 2026-11-22},
}