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. 2003.09795
  4. Cited By
Optimal No-regret Learning in Repeated First-price Auctions
v1v2v3v4v5v6v7 (latest)

Optimal No-regret Learning in Repeated First-price Auctions

22 March 2020
Yanjun Han
Zhengyuan Zhou
Tsachy Weissman
ArXiv (abs)PDFHTML

Papers citing "Optimal No-regret Learning in Repeated First-price Auctions"

6 / 6 papers shown
Title
Adversarial Combinatorial Semi-bandits with Graph Feedback
Adversarial Combinatorial Semi-bandits with Graph Feedback
Yuxiao Wen
141
0
0
26 Feb 2025
Learning in Repeated Multi-Unit Pay-As-Bid Auctions
Learning in Repeated Multi-Unit Pay-As-Bid Auctions
Rigel Galgana
Negin Golrezaei
63
2
0
27 Jul 2023
Double Auctions with Two-sided Bandit Feedback
Double Auctions with Two-sided Bandit Feedback
Soumya Basu
Abishek Sankararaman
62
2
0
13 Aug 2022
Learning to Bid in Contextual First Price Auctions
Learning to Bid in Contextual First Price Auctions
Ashwinkumar Badanidiyuru
Zhe Feng
Guru Guruganesh
74
17
0
07 Sep 2021
Learning to Bid Optimally and Efficiently in Adversarial First-price
  Auctions
Learning to Bid Optimally and Efficiently in Adversarial First-price Auctions
Yanjun Han
Zhengyuan Zhou
Aaron Flores
E. Ordentlich
Tsachy Weissman
61
40
0
09 Jul 2020
Reinforcement Learning for Non-Stationary Markov Decision Processes: The
  Blessing of (More) Optimism
Reinforcement Learning for Non-Stationary Markov Decision Processes: The Blessing of (More) Optimism
Wang Chi Cheung
D. Simchi-Levi
Ruihao Zhu
OffRL
95
96
0
24 Jun 2020
1