Proceedings of the 27th ACM SIGKDD Conference on Knowledge Discovery &Amp; Data Mining 2021
DOI: 10.1145/3447548.3467113
|View full text |Cite
|
Sign up to set email alerts
|

MEOW: A Space-Efficient Nonparametric Bid Shading Algorithm

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
6
0

Year Published

2023
2023
2024
2024

Publication Types

Select...
3
3

Relationship

0
6

Authors

Journals

citations
Cited by 8 publications
(6 citation statements)
references
References 13 publications
0
6
0
Order By: Relevance
“…For example, Gligorijevic et al (2020) uses models based on Factorization Machines to estimate the bid shading factor (i.e., the ratio of the minimum winning price to the original bid price). Secondly, distribution estimators are built using bid landscape forecasting to predict the winning probability distribution (Cui et al 2011;Ren et al 2019;Wu, Yeh, and Chen 2018;Ghosh et al 2019), and then the optimal bid is determined by searching for maximum expected surplus (Pan et al 2020;Zhou et al 2021). These estimators all admit an efficient search for optimal bid but differ in the assumption of the distribution families, such as gamma and lognormal distribution.…”
Section: Additional Related Workmentioning
confidence: 99%
See 3 more Smart Citations
“…For example, Gligorijevic et al (2020) uses models based on Factorization Machines to estimate the bid shading factor (i.e., the ratio of the minimum winning price to the original bid price). Secondly, distribution estimators are built using bid landscape forecasting to predict the winning probability distribution (Cui et al 2011;Ren et al 2019;Wu, Yeh, and Chen 2018;Ghosh et al 2019), and then the optimal bid is determined by searching for maximum expected surplus (Pan et al 2020;Zhou et al 2021). These estimators all admit an efficient search for optimal bid but differ in the assumption of the distribution families, such as gamma and lognormal distribution.…”
Section: Additional Related Workmentioning
confidence: 99%
“…These estimators all admit an efficient search for optimal bid but differ in the assumption of the distribution families, such as gamma and lognormal distribution. Thirdly, instead of point and distribution estimations, Zhang et al (2021) uses online learning to design nonparametric bid shading algorithms. Outside of bid shading in first-price auction, our work is also related to the work by Nedelec, El Karoui, and Perchet (2019), which designs learning-based shading strategies to do manipulation in incentive compatible though prior-dependent revenue-maximizing auctions.…”
Section: Additional Related Workmentioning
confidence: 99%
See 2 more Smart Citations
“…For example, Zhou et al in [19] introduced a novel deep distribution network for optimal bidding in both open and closed online first-price auctions. Zhang et al in [20] proposed a succinct and effective bid shading algorithm without parametric assumptions for the win distribution. Ren et al in [21] proposed a comprehensive framework to jointly optimize user response prediction and bid landscape forecasting.…”
Section: Related Workmentioning
confidence: 99%