Fetching the paper…
Reading the bibliography…
In this paper, we investigate the problem about how to bid in repeated contextual first price auctions.
Incentive-aware Contextual Pricing with Non-parametric Market Noise
Negin Golrezaei, Patrick Jaillet, and Jason Cheuk Nam Liang. 2019 · 1911
Earlier work this paper cites.
On the Schur Complement
E.V. Haynsworth. 1968 · 1968
Earlier work this paper cites.
Log-concave Probability Distributions: Theory and Statistical Testing
Mark Yuying An. 1996 · 1996
Earlier work this paper cites.
Auction Theory
V. Krishna. 2002 · 2002
Earlier work this paper cites.
Optimal No-regret Learning in Repeated First-price Auctions
Yanjun Han, Zhengyuan Zhou, and Tsachy Weissman. 2020a · 2003
Earlier work this paper cites.
Log-Concave Probability and Its Applications
Mark Bagnoli and Ted Bergstrom. 2005 · 2005
Earlier work this paper cites.
Learning to Bid Optimally and Efficiently in Adversarial First-price Auctions
Yanjun Han, Zhengyuan Zhou, Aaron Flores, Erik Ordentlich, and Tsachy Weissman. 2020b · 2007
Earlier work this paper cites.
Maximum likelihood estimation of a log-concave density and its distribution function: Basic properties and uniform consistency
Lutz Dümbgen and Kaspar Rufibach. 2009 · 2009
Earlier work this paper cites.
Statistics for High-Dimensional Data: Methods, Theory and Applications
Peter Bhlmann and Sara van de Geer. 2011 · 2011
Cited alongside, same era.
Regret Minimization for Reserve Prices in Second-Price Auctions
Nicolò Cesa-Bianchi, Claudio Gentile, and Yishay Mansour. 2015 · 2014
Cited alongside, same era.
Online learning in repeated auctions. In 29th Annual Conference on Learning Theory
Jonathan Weed, Vianney Perchet, and Philippe Rigollet. 2016 · 2016
Cited alongside, same era.
Learning to Bid Without Knowing Your Value. In Proceedings of the 2018 ACM Conference on Economics and Computation
Zhe Feng, Chara Podimata, and Vasilis Syrgkanis. 2018 · 2018
Cited alongside, same era.
Contextual Search via Intrinsic Volumes. In 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS)
R. Paes Leme and J. Schneider. 2018 · 2018
Cited alongside, same era.
Credible Auctions: A Trilemma
Mohammad Akbarpour and Shengwu Li. 2020 · 2020
Later among the works it cites.
How SSPs use deceptive price floors to squeeze ad buyers
Ross Benes. 2017 · 2020
Later among the works it cites.
Rolling out first price auctions to Google Ad Manager partners Digiday
Jason Bigler. 2019 · 2020
Later among the works it cites.
Programmatic advertising is preparing for the first-price auction era
Yuyu Chen. 2017 · 2020
Later among the works it cites.
Feature-Based Dynamic Pricing
Maxime C. Cohen, Ilan Lobel, and Renato Paes Leme. 2020 · 2020
Later among the works it cites.
Bayesian Nash Equilibrium in First-Price Auction with Discrete Value Distributions. In Proceedings of the 19th International Conference on Autonomous Agents and MultiAgent Systems
Zihe Wang, Weiran Shen, and Song Zuo. 2020 · 2020
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Contextual Pricing for Lipschitz Buyers. In Advances in Neural Information Processing Systems 31
Jieming Mao, Renato Leme, and Jon Schneider. 2018 · 2018
Cited alongside, same era.
Contextual Bandits with Cross-Learning
Santiago Balseiro, Negin Golrezaei, Mohammad Mahdian, Vahab Mirrokni, and Jon Schneider. 2019 · 2019
Cited alongside, same era.
Dynamic Pricing in High-Dimensions
Adel Javanmard and Hamid Nazerzadeh. 2019 · 2019
Cited alongside, same era.
Later among the works it cites.
Contextual First-Price Auctions with Budgets
Santiago Balseiro, Christian Kroer, and Rachitesh Kumar. 2021 · 2021
Closest in time.
Reserve Price Optimization for First Price Auctions. In Proceedings of the 38th International Conference on Machine Learning (ICML-21), to appear
Zhe Feng, Sébastien Lahaie, Jon Schneider, and Jinchao Ye. 2021 · 2021
Closest in time.