Online learning in online auctions

DOI10.1016/j.tcs.2004.05.012zbMath1091.91028OpenAlexW2005311763MaRDI QIDQ1887078

Yanyan Li

Publication date: 23 November 2004

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2004.05.012

zbMATH Keywords

auctionsOnline algorithmsLearning theory

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Auctions, bargaining, bidding and selling, and other market models (91B26)

Related Items (8)

Deals or No Deals: Contract Design for Online Advertising ⋮ Improving multi-armed bandit algorithms in online pricing settings ⋮ Sequential Posted Price Mechanisms with Correlated Valuations ⋮ Diffusive limit approximation of pure-jump optimal stochastic control problems ⋮ Frequency capping in online advertising ⋮ Reducing mechanism design to algorithm design via machine learning ⋮ Unnamed Item ⋮ Learning in Repeated Auctions

Uses Software

• AdaBoost.MH

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The weighted majority algorithm
• A decision-theoretic generalization of on-line learning and an application to boosting
• Competitive analysis of incentive compatible on-line auctions
• Competitive generalized auctions
• How to use expert advice
• The Nonstochastic Multiarmed Bandit Problem

This page was built for publication: Online learning in online auctions