ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 1705.09700
  4. Cited By
Multi-scale Online Learning and its Applications to Online Auctions

Multi-scale Online Learning and its Applications to Online Auctions

26 May 2017
Sébastien Bubeck
Nikhil R. Devanur
Zhiyi Huang
Rad Niazadeh
ArXivPDFHTML

Papers citing "Multi-scale Online Learning and its Applications to Online Auctions"

5 / 5 papers shown
Title
A Sample Complexity Measure with Applications to Learning Optimal
  Auctions
A Sample Complexity Measure with Applications to Learning Optimal Auctions
Vasilis Syrgkanis
39
48
0
09 Apr 2017
Bandits with concave rewards and convex knapsacks
Bandits with concave rewards and convex knapsacks
Shipra Agrawal
Nikhil R. Devanur
133
200
0
24 Feb 2014
Learning Prices for Repeated Auctions with Strategic Buyers
Learning Prices for Repeated Auctions with Strategic Buyers
Kareem Amin
Afshin Rostamizadeh
Umar Syed
92
151
0
26 Nov 2013
Bandits with Knapsacks
Bandits with Knapsacks
Ashwinkumar Badanidiyuru
Robert D. Kleinberg
Aleksandrs Slivkins
88
432
0
11 May 2013
Dynamic Pricing with Limited Supply
Dynamic Pricing with Limited Supply
Moshe Babaioff
S. Dughmi
Robert D. Kleinberg
Aleksandrs Slivkins
114
163
0
20 Aug 2011
1