Fetching the paper…
Reading the bibliography…
We study a pricing problem where a seller has $k$ identical copies of a product, buyers arrive sequentially, and the seller prices the items aiming to maximize social welfare.
On the Distribution of the Number of Successes in Independent Trials
Wassily Hoeffding · 1956
Earlier work this paper cites.
Semiamarts and finite values
Ulrich Krengel and Louis Sucheston · 1977
Earlier work this paper cites.
Comparison of threshold stop rules and maximum for independent nonnegative random variables
Ester Samuel-Cahn · 1984
Earlier work this paper cites.
The smallest uniform upper bound on the distance between the mean and the median of the binomial and poisson distributions
Kais Hamza · 1995
Earlier work this paper cites.
Automated online mechanism design and prophet inequalities
Mohammad Taghi Hajiaghayi, Robert Kleinberg, and Tuomas Sandholm · 2007
Earlier work this paper cites.
Matroid prophet inequalities
Robert Kleinberg and Seth Matthew Weinberg · 2012
Earlier work this paper cites.
Bayesian combinatorial auctions: Expanding single buyer mechanisms to many buyers
Saeed Alaei · 2014
Earlier work this paper cites.
Combinatorial auctions via posted prices
Michal Feldman, Nick Gravin, and Brendan Lucier · 2014
Earlier work this paper cites.
Dynamic pricing with limited supply
Moshe Babaioff, Shaddin Dughmi, Robert D. Kleinberg, and Aleksandrs Slivkins · 2015
Cited alongside, same era.
Polymatroid prophet inequalities
Paul Dütting and Robert Kleinberg · 2015
Cited alongside, same era.
Stability of service under time-of-use pricing
Shuchi Chawla, Nikhil R. Devanur, Alexander E. Holroyd, Anna R. Karlin, James B. Martin, and Balasubramanian Sivan · 2017
Cited alongside, same era.
An economic view of prophet inequalities
Brendan Lucier · 2017
Cited alongside, same era.
Combinatorial prophet inequalities
Aviad Rubinstein and Sahil Singla · 2017
Cited alongside, same era.
Bandits with knapsacks
Ashwinkumar Badanidiyuru, Robert Kleinberg, and Aleksandrs Slivkins · 2018
Cited alongside, same era.
Pricing for online resource allocation: Intervals and paths
Shuchi Chawla, J. Benjamin Miller, and Yifeng Teng · 2019
Later among the works it cites.
Prophet inequalities made easy: Stochastic optimization by pricing nonstochastic inputs
Paul Dütting, Michal Feldman, Thomas Kesselheim, and Brendan Lucier · 2020
Closest in time.
Dynamic pricing of relocating resources in large networks
Santiago R. Balseiro, David B. Brown, and Chen Chen · 2021
Closest in time.
Tight guarantees for static threshold policies in the prophet secretary problem
Nick Arnosti and Will Ma · 2022
Closest in time.
Pricing and optimization in shared vehicle systems: An approximation framework
Siddhartha Banerjee, Daniel Freund, and Thodoris Lykouris · 2022
Closest in time.
Tight guarantees for multi-unit prophet inequalities and online stochastic knapsack
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Shipra Agrawal and Nikhil R. Devanur · 2019
Cited alongside, same era.
Jiashuo Jiang, Will Ma, and Jiawei Zhang · 2022
Closest in time.
Tightness without counterexamples: A new approach and new results for prophet inequalities
Jiashuo Jiang, Will Ma, and Jiawei Zhang · 2022
Closest in time.