Fetching the paper…
Reading the bibliography…
A line of recent work provides welfare guarantees of simple combinatorial auction formats, such as selling m items via simultaneous second price auctions (SiSPAs) (Christodoulou et al.
Counterspeculation, auctions, and competitive sealed tenders
William Vickrey · 1961
Earlier work this paper cites.
Multipart pricing of public goods
EdwardH. Clarke · 1971
Earlier work this paper cites.
Incentives in teams
Theodore Groves · 1973
Earlier work this paper cites.
Gambling in a rigged casino: The adversarial multi-armed bandit problem
P. Auer, N. Cesa-Bianchi, Y. Freund, and R. E. Schapire · 1995
Earlier work this paper cites.
A threshold of ln n for approximating set cover
Uriel Feige · 1998
Earlier work this paper cites.
Auctions of heterogeneous objects
Sushil Bikhchandani · 1999
Earlier work this paper cites.
Non-approximability results for optimization problems on bounded degree instances
Luca Trevisan · 2001
Earlier work this paper cites.
Efficient algorithms for online decision problems
Adam Kalai and Santosh Vempala · 2003
Earlier work this paper cites.
Online convex programming and generalized infinitesimal gradient ascent
Martin Zinkevich · 2003
Earlier work this paper cites.
Adaptive online prediction by following the perturbed leader
Marcus Hutter and Jan Poland · 2005
Earlier work this paper cites.
The lovely but lonely vickrey auction
Lawrence M Ausubel and Paul Milgrom · 2006
Earlier work this paper cites.
An improved approximation algorithm for combinatorial auctions with submodular bidders
Shahar Dobzinski and Michael Schapira · 2006
Earlier work this paper cites.
On maximizing welfare when utility functions are subadditive
Uriel Feige · 2006
Earlier work this paper cites.
Efficient Algorithms for Online Convex Optimization and Their Applications
Elad Hazan · 2006
Earlier work this paper cites.
Regret minimization and the price of total anarchy
Avrim Blum, MohammadTaghi Hajiaghayi, Katrina Ligett, and Aaron Roth · 2008
Earlier work this paper cites.
Bayesian combinatorial auctions
George Christodoulou, Annamária Kovács, and Michael Schapira · 2008
Cited alongside, same era.
Intrinsic robustness of the price of anarchy
T. Roughgarden · 2009
Cited alongside, same era.
Approximation algorithms for combinatorial auctions with complement-free bidders
Shahar Dobzinski, Noam Nisan, and Michael Schapira · 2010
Cited alongside, same era.
Price of anarchy for greedy auctions
B. Lucier and A. Borodin · 2010
Cited alongside, same era.
Welfare guarantees for combinatorial auctions with item bidding
Kshipra Bhawalkar and Tim Roughgarden · 2011
Cited alongside, same era.
An impossibility result for truthful combinatorial auctions with submodular valuations
Shahar Dobzinski · 2011
Cited alongside, same era.
Simultaneous auctions are (almost) efficient
Michal Feldman, Hu Fu, Nick Gravin, and Brendan Lucier · 2013
Later among the works it cites.
Composable and efficient mechanisms
Vasilis Syrgkanis and Éva Tardos · 2013
Later among the works it cites.
Simultaneous bayesian auctions and computational complexity
Yang Cai and Christos Papadimitriou · 2014
Later among the works it cites.
Price of anarchy for auction revenue
Jason Hartline, Darrell Hoy, and Sam Taggart · 2014
Later among the works it cites.
Commitment without regrets: Online learning in stackelberg security games
Maria-Florina Balcan, Avrim Blum, Nika Haghtalab, and Ariel D. Procaccia · 2015
Closest in time.
On the complexity of computing an equilibrium in combinatorial auctions
Shahar Dobzinski, Hu Fu, and Robert Kleinberg · 2015
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
From convex optimization to randomized mechanisms: Toward optimal combinatorial auctions
Shaddin Dughmi, Tim Roughgarden, and Qiqi Yan · 2011
Cited alongside, same era.
Non-price equilibria in markets of discrete goods
A. Hassidim, Haim Kaplan, Yishay Mansour, and Noam Nisan · 2011
Cited alongside, same era.
Regret analysis of stochastic and nonstochastic multi-armed bandit problems
Sébastien Bubeck and Nicolo Cesa-Bianchi · 2012
Cited alongside, same era.
The computational complexity of truthfulness in combinatorial auctions
Shahar Dobzinski and Jan Vondrak · 2012
Cited alongside, same era.
Conditional equilibrium outcomes via ascending price processes with applications to combinatorial auctions with item bidding
Hu Fu, Robert Kleinberg, and Ron Lavi · 2012
Cited alongside, same era.
Uniform price auctions: Equilibria and efficiency
Evangelos Markakis and Orestis Telelis · 2012
Cited alongside, same era.
Simple auctions with simple strategies
Nikhil Devanur, Jamie Morgenstern, Vasilis Syrgkanis, and S. Matthew Weinberg · 2015
Closest in time.
Limitations of randomized mechanisms for combinatorial auctions
Shaddin Dughmi and Jan Vondrák · 2015
Closest in time.
Combinatorial auctions via posted prices
Michal Feldman, Nick Gravin, and Brendan Lucier · 2015
Closest in time.
The computational power of optimization in online learning
Elad Hazan and Tomer Koren · 2015
Closest in time.
Interpolating between truthful and non-truthful mechanisms for combinatorial auctions
Mark Braverman, Jieming Mao, and S. Matthew Weinberg · 2016
Closest in time.
Breaking the logarithmic barrier for truthful combinatorial auctions with submodular bidders
Shahar Dobzinski · 2016
Closest in time.
Yuqian Li, Vincent Conitzer, and Dmytro Korzhyk · 2016
Closest in time.
Learning and efficiency in games with dynamic population
Thodoris Lykouris, Vasilis Syrgkanis, and Éva Tardos · 2016
Closest in time.