Optimal No-regret Learning in Repeated First-price Auctions

22 March 2020

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

10 / 10 papers shown

Title
Dynamic Incentive-aware Learning: Robust Pricing in Contextual Auctions Negin Golrezaei Adel Javanmard Vahab Mirrokni 50 94 0 25 Feb 2020
Online Second Price Auction with Semi-bandit Feedback Under the Non-Stationary Setting Haoyu Zhao Wei Chen 44 13 0 14 Nov 2019
Stochastic One-Sided Full-Information Bandit Haoyu Zhao Wei Chen 34 8 0 20 Jun 2019
Batched Multi-armed Bandits Problem Zijun Gao Yanjun Han Zhimei Ren Zhengqing Zhou 122 141 0 03 Apr 2019
Contextual Bandits with Cross-learning S. Balseiro Negin Golrezaei Mohammad Mahdian Vahab Mirrokni Jon Schneider 100 50 0 25 Sep 2018
Learning Multi-item Auctions with (or without) Samples Yang Cai C. Daskalakis 48 67 0 01 Sep 2017
Learning Theory and Algorithms for Revenue Optimization in Second-Price Auctions with Reserve M. Mohri Andrés Munoz Medina 57 145 0 21 Oct 2013
Thompson Sampling for Contextual Bandits with Linear Payoffs Shipra Agrawal Navin Goyal 168 997 0 15 Sep 2012
Characterizing Truthful Multi-Armed Bandit Mechanisms Moshe Babaioff Yogeshwer Sharma Aleksandrs Slivkins 111 161 0 12 Dec 2008
Exponential inequalities for self-normalized martingales with applications Bernard Bercu A. Touati 136 124 0 25 Jul 2007