Fetching the paper…
Reading the bibliography…
We present a general framework for stochastic online maximization problems with combinatorial feasibility constraints.
Fast approximation algorithms for the knapsack and sum of subset problems
O. H. Ibarra and C. E. Kim · 1975
Earlier work this paper cites.
Semiamarts and finite values
U. Krengel and L. Sucheston · 1977
Earlier work this paper cites.
On semiamarts, amarts, and processes with finite value
U. Krengel and L. Sucheston · 1978
Earlier work this paper cites.
Comparison of threshold stop rules and maximum for independent nonnegative random variables
E. Samuel-Cahn · 1984
Earlier work this paper cites.
Combinatorial auctions with decreasing marginal utilities
B. Lehmann, D. Lehmann, and N. Nisan · 2001
Earlier work this paper cites.
Non-approximability results for optimization problems on bounded degree instances
L. Trevisan · 2001
Earlier work this paper cites.
Truthful randomized mechanisms for combinatorial auctions
S. Dobzinski, N. Nisan, and M. Schapira · 2006
Earlier work this paper cites.
Algorithmic pricing via virtual valuations
S. Chawla, J. D. Hartline, and R. D. Kleinberg · 2007
Earlier work this paper cites.
Two randomized mechanisms for combinatorial auctions
S. Dobzinski · 2007
Earlier work this paper cites.
Automated mechanism design and prophet inequalities
M. Hajiaghayi, R. Kleinberg, and T. W. Sandholm · 2007
Earlier work this paper cites.
Item pricing for revenue maximization
M. Balcan, A. Blum, and Y. Mansour · 2008
Earlier work this paper cites.
Dynamic and non-uniform pricing strategies for revenue maximization
T. Chakraborty, Z. Huang, and S. Khanna · 2009
Earlier work this paper cites.
Multi-parameter mechanism design and sequential posted pricing
S. Chawla, J. D. Hartline, D. L. Malec, and B. Sivan · 2010
Earlier work this paper cites.
Submodular maximization over multiple matroids via generalized exchange properties
J. Lee, M. Sviridenko, and J. Vondrak · 2010
Earlier work this paper cites.
Price of anarchy for greedy auctions
B. Lucier and A. Borodin · 2010
Cited alongside, same era.
Welfare guarantees for combinatorial auctions with item bidding
K. Bhawalkar and T. Roughgarden · 2011
Cited alongside, same era.
Combinatorial auctions with restricted complements
I. Abraham, M. Babaioff, S. Dughmi, and T. Roughgarden · 2012
Cited alongside, same era.
Online prophet-inequality matching with applications to ad allocation
S. Alaei, M. Hajiaghayi, and V. Liaghat · 2012
Cited alongside, same era.
The online stochastic generalized assignment problem
S. Alaei, M. Hajiaghayi, and V. Liaghat · 2013
Cited alongside, same era.
Simultaneous auctions are (almost) efficient
M. Feldman, H. Fu, N. Gravin, and B. Lucier · 2013
Cited alongside, same era.
Polymatroid prophet inequalities
P. Dütting and R. Kleinberg · 2015
Later among the works it cites.
A unifying hierarchy of valuations with complements and substitutes
U. Feige, M. Feldman, N. Immorlica, R. Izsak, B. Lucier, and V. Syrgkanis · 2015
Later among the works it cites.
Greedy algorithms make efficient mechanisms
B. Lucier and V. Syrgkanis · 2015
Later among the works it cites.
Intrinsic robustness of the price of anarchy
T. Roughgarden · 2015
Later among the works it cites.
The invisible hand of dynamic market pricing
V. Cohen-Addad, A. Eden, M. Feldman, and A. Fiat · 2016
Closest in time.
Learning in auctions: Regret is hard, envy is easy
C. Daskalakis and V. Syrgkanis · 2016
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Composable and efficient mechanisms
V. Syrgkanis and É. Tardos · 2013
Cited alongside, same era.
Bayesian combinatorial auctions: Expanding single buyer mechanisms to many buyers
S. Alaei · 2014
Cited alongside, same era.
Prophet inequalities with limited information
P. D. Azar, R. Kleinberg, and S. M. Weinberg · 2014
Cited alongside, same era.
Price of anarchy for auction revenue
J. D. Hartline, D. Hoy, and S. Taggart · 2014
Cited alongside, same era.
Optimal auctions vs. anonymous pricing
S. Alaei, J. D. Hartline, R. Niazadeh, E. Pountourakis, and Y. Yuan · 2015
Cited alongside, same era.
Pricing online decisions: Beyond auctions
I. R. Cohen, A. Eden, A. Fiat, and L. Jez · 2015
Cited alongside, same era.
M. Hardt, B. Recht, and Y. Singer · 2016
Closest in time.
Learning and efficiency in games with dynamic population
T. Lykouris, V. Syrgkanis, and É. Tardos · 2016
Closest in time.
Beyond matroids: Secretary problem and prophet inequality with general constraints
A. Rubinstein · 2016
Closest in time.
Beating 1-1/e for ordered prophets
M. Abolhassani, S. Ehsani, H. Esfandiari, M. T. Hajiaghayi, R. Kleinberg, and B. Lucier · 2017
Closest in time.
Simple mechanisms for subadditive buyers via duality
Y. Cai and M. Zhao · 2017
Closest in time.
Makespan minimization via posted prices
M. Feldman, A. Fiat, and A. Roytman · 2017
Closest in time.
Combinatorial prophet inequalities
A. Rubinstein and S. Singla · 2017
Closest in time.