mlsanityData to 14 Oct 2026

Online Learning and Profit Maximization from Revealed Preferences

arXiv 1407.7294 ↗First posted 27 Jul 2014cs.DS cs.GT cs.LGcited by 6

Not on the map. Why?

Abstract (arXiv)

We consider the problem of learning from revealed preferences in an online setting. In our framework, each period a consumer buys an optimal bundle of goods from a merchant according to her (linear) utility function and current prices, subject to a budget constraint. The merchant observes only the purchased goods, and seeks to adapt prices to optimize his profits. We give an efficient algorithm for the merchant's problem that consists of a learning phase in which the consumer's utility function is (perhaps partially) inferred, followed by a price optimization step. We also consider an alternative online learning algorithm for the setting where prices are set exogenously, but the merchant would still like to predict the bundle that will be bought by the consumer for purposes of inventory or supply chain management. In contrast with most prior work on the revealed preferences problem, we demonstrate that by making stronger assumptions on the form of utility functions, efficient algorithms for both learning and profit maximization are possible, even in adaptive, online settings.

Key facts. Cited by 6 papers in the map (data through 14 Oct 2026). First posted on arXiv 27 Jul 2014.

Builds on

No reference list yet.

Built on by

Cited by year

Citing papers per year: 2021: 1; 2022: 4; 2023: 1.

6 papers.