Efficient algorithms for stochastic repeated second-price auctions

MaRDI QIDQ7028653zbMATH OpenFDO

Authors Juliette Achddou, Olivier Cappé, Aurélien Garivier

Publication date 11 February 2025

Full work available at URL https://proceedings.mlr.press/v132/achddou21a.html

zbMATH Keywords

auctionsbanditsonline learning

Mathematics Subject Classification ID

Auctions, bargaining, bidding and selling, and other market models (91B26)

Cites work

• Asymptotically efficient adaptive allocation rules
• Bandits with knapsacks
• Exploration-exploitation tradeoff using variance estimates in multi-armed bandits
• Explore first, exploit next: the true shape of regret in bandit problems
• Finite-time analysis of the multiarmed bandit problem
• scientific article; zbMATH DE number 67638 (Why is no real title available?)
• Kullback-Leibler upper confidence bounds for optimal sequential allocation
• Online learning in online auctions
• Regret Minimization for Reserve Prices in Second-Price Auctions

Cited in

(1)

• Repeated bidding with dynamic value

This page was built for publication: Efficient algorithms for stochastic repeated second-price auctions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7028653)