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. 2305.17402
  4. Cited By
Learning and Collusion in Multi-unit Auctions
v1v2 (latest)

Learning and Collusion in Multi-unit Auctions

27 May 2023
Simina Brânzei
Mahsa Derakhshan
Negin Golrezaei
Yanjun Han
ArXiv (abs)PDFHTML

Papers citing "Learning and Collusion in Multi-unit Auctions"

10 / 10 papers shown
Title
Oh the Prices You'll See: Designing a Fair Exchange System to Mitigate Personalized Pricing
Oh the Prices You'll See: Designing a Fair Exchange System to Mitigate Personalized Pricing
Aditya Karan
Naina Balepur
Hari Sundaram
81
0
0
04 Sep 2024
Online Learning via Offline Greedy Algorithms: Applications in Market
  Design and Optimization
Online Learning via Offline Greedy Algorithms: Applications in Market Design and Optimization
Rad Niazadeh
Negin Golrezaei
Joshua R. Wang
Fransisca Susan
Ashwinkumar Badanidiyuru
47
43
0
18 Feb 2021
Optimal Learning for Structured Bandits
Optimal Learning for Structured Bandits
Bart P. G. Van Parys
Negin Golrezaei
393
15
0
14 Jul 2020
Dynamic Incentive-aware Learning: Robust Pricing in Contextual Auctions
Dynamic Incentive-aware Learning: Robust Pricing in Contextual Auctions
Negin Golrezaei
Adel Javanmard
Vahab Mirrokni
79
94
0
25 Feb 2020
Beating Stochastic and Adversarial Semi-bandits Optimally and
  Simultaneously
Beating Stochastic and Adversarial Semi-bandits Optimally and Simultaneously
Julian Zimmert
Haipeng Luo
Chen-Yu Wei
203
82
0
25 Jan 2019
Contextual Bandits with Cross-learning
Contextual Bandits with Cross-learning
S. Balseiro
Negin Golrezaei
Mohammad Mahdian
Vahab Mirrokni
Jon Schneider
132
51
0
25 Sep 2018
Learning Multi-item Auctions with (or without) Samples
Learning Multi-item Auctions with (or without) Samples
Yang Cai
C. Daskalakis
59
68
0
01 Sep 2017
Learning Simple Auctions
Learning Simple Auctions
Jamie Morgenstern
Tim Roughgarden
57
127
0
11 Apr 2016
Regret in Online Combinatorial Optimization
Regret in Online Combinatorial Optimization
Jean-Yves Audibert
Sébastien Bubeck
Gábor Lugosi
OffRL
83
258
0
20 Apr 2012
The on-line shortest path problem under partial monitoring
The on-line shortest path problem under partial monitoring
Pál Benkö
T. Várady
L. Andor
Ralph Robert Martin
593
356
0
08 Apr 2007
1