Online learning via offline greedy algorithms : applications in market design and optimization
Year of publication: |
2023
|
---|---|
Authors: | Niazadeh, Rad ; Golrezaei, Negin ; Wang, Joshua ; Susan, Fransisca ; Badanidiyuru, Ashwinkumar |
Published in: |
Management science : journal of the Institute for Operations Research and the Management Sciences. - Hanover, Md. : INFORMS, ISSN 1526-5501, ZDB-ID 2023019-9. - Vol. 69.2023, 7, p. 3797-3817
|
Subject: | Blackwell approachability | no regret | offline-to-online | product ranking | reserve price optimization | submodular maximization | Theorie | Theory | Mathematische Optimierung | Mathematical programming |
-
Sequential submodular maximization and applications to ranking an assortment of products
Asadpour, Arash, (2023)
-
Solving optimization problems with Blackwell approachability
Grand-Clément, Julien, (2024)
-
Submodular stochastic probing on matroids
Adamczyk, Marek, (2016)
- More ...
-
Online Learning via Offline Greedy Algorithms : Applications in Market Design and Optimization
Niazadeh, Rad, (2022)
-
Active Learning for Non-Parametric Choice Models
Susan, Fransisca, (2022)
-
Multi-Platform Budget Management in Ad Markets with Non-IC Auctions
Susan, Fransisca, (2023)
- More ...