Work2012

Dynamic pricing with limited supply

Moshe Babaioff · Shaddin Dughmi · Robert Kleinberg · Aleksandrs Slivkins

98 citations0/0 files storedACM Conference on Electronic Commerce (EC)

No readable copy stored yet — this record is metadata only.

Auction Theory and Applications Supply Chain and Inventory Management Optimization and Search Problems

Abstract

We consider the problem of designing revenue maximizing online posted-price mechanisms when the seller has limited supply. A seller has k identical items for sale and is facing n potential buyers ("agents") that are arriving sequentially. Each agent is interested in buying one item. Each agent's value for an item is an independent sample from some fixed (but unknown) distribution with support [0,1]. The seller offers a take-it-or-leave-it price to each arriving agent (possibly different for different agents), and aims to maximize his expected revenue.

Citations in this library

Stored only when both papers are in the corpus — 98 citations exist upstream.

References

2002Finite-time Analysis of the Multiarmed Bandit Problem 1981Optimal Auction Design 2006Prediction, Learning, and Games 2002The Nonstochastic Multiarmed Bandit Problem 1979Bandit Processes and Dynamic Allocation Indices 2012Regret Analysis of Stochastic and Nonstochastic Multi-armed Bandit Problems 1990Multi-Armed Bandit Allocation Indices.2011Multi‐Armed Bandit Allocation Indices

Cited by

2019Bandits and Experts in Metric Spaces 2015Algorithms with Logarithmic or Sublinear Regret for Constrained Contextual Bandits 2016Dynamic Pricing in High-Dimensions 2015An efficient algorithm for contextual bandits with knapsacks, and an extension to concave objectives

Imported from OpenAlex (CC0) — nothing here is generated.