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. 2011.10124
  4. Cited By
The Best of Many Worlds: Dual Mirror Descent for Online Allocation
  Problems

The Best of Many Worlds: Dual Mirror Descent for Online Allocation Problems

18 November 2020
S. Balseiro
Haihao Lu
Vahab Mirrokni
ArXivPDFHTML

Papers citing "The Best of Many Worlds: Dual Mirror Descent for Online Allocation Problems"

43 / 43 papers shown
Title
Non-Monetary Mechanism Design without Distributional Information: Using Scarce Audits Wisely
Non-Monetary Mechanism Design without Distributional Information: Using Scarce Audits Wisely
Yan Dai
Moise Blanchard
Patrick Jaillet
77
0
0
12 Feb 2025
Decoupling Learning and Decision-Making: Breaking the $\mathcal{O}(\sqrt{T})$ Barrier in Online Resource Allocation with First-Order Methods
Decoupling Learning and Decision-Making: Breaking the O(T)\mathcal{O}(\sqrt{T})O(T​) Barrier in Online Resource Allocation with First-Order Methods
Wenzhi Gao
Chunlin Sun
Chenyu Xue
Dongdong Ge
Yinyu Ye
69
1
0
08 Jan 2025
Beyond O(T)\mathcal{O}(\sqrt{T})O(T​) Regret: Decoupling Learning and Decision-making in Online Linear Programming
Wenzhi Gao
Dongdong Ge
Chenyu Xue
Chunlin Sun
Yinyu Ye
36
0
0
06 Jan 2025
Degeneracy is OK: Logarithmic Regret for Network Revenue Management with Indiscrete Distributions
Degeneracy is OK: Logarithmic Regret for Network Revenue Management with Indiscrete Distributions
Jiashuo Jiang
Will Ma
Jiawei Zhang
31
14
0
03 Jan 2025
Beyond Primal-Dual Methods in Bandits with Stochastic and Adversarial
  Constraints
Beyond Primal-Dual Methods in Bandits with Stochastic and Adversarial Constraints
Martino Bernasconi
Matteo Castiglioni
A. Celli
Federico Fusco
31
2
0
25 May 2024
No-Regret is not enough! Bandits with General Constraints through
  Adaptive Regret Minimization
No-Regret is not enough! Bandits with General Constraints through Adaptive Regret Minimization
Martino Bernasconi
Matteo Castiglioni
A. Celli
44
6
0
10 May 2024
Demand Balancing in Primal-Dual Optimization for Blind Network Revenue
  Management
Demand Balancing in Primal-Dual Optimization for Blind Network Revenue Management
Sentao Miao
Yining Wang
43
0
0
06 Apr 2024
Best of Many in Both Worlds: Online Resource Allocation with Predictions
  under Unknown Arrival Model
Best of Many in Both Worlds: Online Resource Allocation with Predictions under Unknown Arrival Model
Lin An
Andrew A. Li
Benjamin Moseley
Gabriel Visotsky
32
0
0
21 Feb 2024
Constrained Online Two-stage Stochastic Optimization: Algorithm with
  (and without) Predictions
Constrained Online Two-stage Stochastic Optimization: Algorithm with (and without) Predictions
Piao Hu
Jiashuo Jiang
Guodong Lyu
Hao Su
36
1
0
02 Jan 2024
Seller-side Outcome Fairness in Online Marketplaces
Seller-side Outcome Fairness in Online Marketplaces
Zikun Ye
Reza Yousefi Maragheh
Lalitesh Morishetti
Shanu Vashishtha
Jason H. D. Cho
Kaushiki Nag
Sushant Kumar
Kannan Achan
FaML
27
1
0
06 Dec 2023
High-dimensional Linear Bandits with Knapsacks
High-dimensional Linear Bandits with Knapsacks
Wanteng Ma
Dong Xia
Jiashuo Jiang
54
0
0
02 Nov 2023
Online Learning in Contextual Second-Price Pay-Per-Click Auctions
Online Learning in Contextual Second-Price Pay-Per-Click Auctions
Mengxiao Zhang
Haipeng Luo
40
4
0
08 Oct 2023
Online Ad Procurement in Non-stationary Autobidding Worlds
Online Ad Procurement in Non-stationary Autobidding Worlds
Jason Cheuk Nam Liang
Haihao Lu
Baoyu Zhou
23
7
0
10 Jul 2023
Towards Environmentally Equitable AI via Geographical Load Balancing
Towards Environmentally Equitable AI via Geographical Load Balancing
Pengfei Li
Jianyi Yang
Adam Wierman
Shaolei Ren
38
8
0
20 Jun 2023
Bandits with Replenishable Knapsacks: the Best of both Worlds
Bandits with Replenishable Knapsacks: the Best of both Worlds
Martino Bernasconi
Matteo Castiglioni
A. Celli
Federico Fusco
41
4
0
14 Jun 2023
Coordinated Dynamic Bidding in Repeated Second-Price Auctions with
  Budgets
Coordinated Dynamic Bidding in Repeated Second-Price Auctions with Budgets
Yurong Chen
Qian Wang
Zhijian Duan
Haoran Sun
Zhaohua Chen
Xiang Yan
Xiaotie Deng
29
6
0
13 Jun 2023
Interpolating Item and User Fairness in Multi-Sided Recommendations
Interpolating Item and User Fairness in Multi-Sided Recommendations
Qinyi Chen
Jason Cheuk Nam Liang
Negin Golrezaei
Djallel Bouneffouf
FaML
45
3
0
12 Jun 2023
Online Resource Allocation in Episodic Markov Decision Processes
Online Resource Allocation in Episodic Markov Decision Processes
Duksang Lee
William Overman
Dabeen Lee
44
1
0
18 May 2023
Online Learning for Equilibrium Pricing in Markets under Incomplete
  Information
Online Learning for Equilibrium Pricing in Markets under Incomplete Information
Devansh Jalota
Haoyuan Sun
Navid Azizan
29
2
0
21 Mar 2023
An Online Algorithm for Chance Constrained Resource Allocation
An Online Algorithm for Chance Constrained Resource Allocation
Yuwei Chen
Zengde Deng
Yinzhi Zhou
Zaiyi Chen
Yujie Chen
Haoyuan Hu
45
1
0
06 Mar 2023
Robust Budget Pacing with a Single Sample
Robust Budget Pacing with a Single Sample
S. Balseiro
Rachitesh Kumar
Vahab Mirrokni
Balasubramanian Sivan
Di Wang
23
2
0
03 Feb 2023
Multi-channel Autobidding with Budget and ROI Constraints
Multi-channel Autobidding with Budget and ROI Constraints
Yuan Deng
Negin Golrezaei
Patrick Jaillet
Jason Cheuk Nam Liang
Vahab Mirrokni
31
24
0
03 Feb 2023
Constrained Online Two-stage Stochastic Optimization: Near Optimal
  Algorithms via Adversarial Learning
Constrained Online Two-stage Stochastic Optimization: Near Optimal Algorithms via Adversarial Learning
Jiashuo Jiang
26
0
0
02 Feb 2023
Contextual Bandits with Packing and Covering Constraints: A Modular
  Lagrangian Approach via Regression
Contextual Bandits with Packing and Covering Constraints: A Modular Lagrangian Approach via Regression
Aleksandrs Slivkins
Xingyu Zhou
Karthik Abinav Sankararaman
Dylan J. Foster
61
23
0
14 Nov 2022
Optimal Contextual Bandits with Knapsacks under Realizability via
  Regression Oracles
Optimal Contextual Bandits with Knapsacks under Realizability via Regression Oracles
Yuxuan Han
Jialin Zeng
Yang Wang
Yangzhen Xiang
Jiheng Zhang
59
9
0
21 Oct 2022
Online Allocation and Learning in the Presence of Strategic Agents
Online Allocation and Learning in the Presence of Strategic Agents
Steven Yin
Shipra Agrawal
A. Zeevi
30
1
0
25 Sep 2022
Optimal Efficiency-Envy Trade-Off via Optimal Transport
Optimal Efficiency-Envy Trade-Off via Optimal Transport
Steven Yin
Christian Kroer
OT
24
2
0
25 Sep 2022
Online Regenerative Learning
Online Regenerative Learning
Owen Shen
19
1
0
18 Sep 2022
A Unifying Framework for Online Optimization with Long-Term Constraints
A Unifying Framework for Online Optimization with Long-Term Constraints
Matteo Castiglioni
A. Celli
A. Marchesi
Giulia Romano
N. Gatti
25
34
0
15 Sep 2022
Optimal Regularized Online Allocation by Adaptive Re-Solving
Optimal Regularized Online Allocation by Adaptive Re-Solving
Wanteng Ma
Ying Cao
Danny H. K. Tsang
Dong Xia
20
3
0
01 Sep 2022
Enabling Long-term Fairness in Dynamic Resource Allocation
Enabling Long-term Fairness in Dynamic Resource Allocation
T. Si Salem
Georgios Iosifidis
Giovanni Neglia
27
18
0
11 Aug 2022
Network Revenue Management with Demand Learning and Fair
  Resource-Consumption Balancing
Network Revenue Management with Demand Learning and Fair Resource-Consumption Balancing
Xi Chen
Jiameng Lyu
Yining Wang
Yuan Zhou
26
1
0
22 Jul 2022
Dynamic Budget Throttling in Repeated Second-Price Auctions
Dynamic Budget Throttling in Repeated Second-Price Auctions
Zhaohua Chen
Chang Wang
Qian Wang
Yuqi Pan
Z. Shi
Zheng Cai
Yukun Ren
Zhihua Zhu
Xiaotie Deng
25
6
0
11 Jul 2022
Online Resource Allocation under Horizon Uncertainty
Online Resource Allocation under Horizon Uncertainty
S. Balseiro
Christian Kroer
Rachitesh Kumar
31
15
0
27 Jun 2022
Online Contextual Decision-Making with a Smart Predict-then-Optimize
  Method
Online Contextual Decision-Making with a Smart Predict-then-Optimize Method
Heyuan Liu
Paul Grigas
27
8
0
15 Jun 2022
Stochastic Online Fisher Markets: Static Pricing Limits and Adaptive
  Enhancements
Stochastic Online Fisher Markets: Static Pricing Limits and Adaptive Enhancements
Devansh Jalota
Yinyu Ye
24
2
0
27 Apr 2022
Best of Many Worlds Guarantees for Online Learning with Knapsacks
Best of Many Worlds Guarantees for Online Learning with Knapsacks
A. Celli
Matteo Castiglioni
Christian Kroer
26
5
0
28 Feb 2022
Bidding Agent Design in the LinkedIn Ad Marketplace
Bidding Agent Design in the LinkedIn Ad Marketplace
Yuan Gao
Kaiyu Yang
Yuanlong Chen
Min Liu
N. Karoui
26
10
0
25 Feb 2022
Analysis of Dual-Based PID Controllers through Convolutional Mirror
  Descent
Analysis of Dual-Based PID Controllers through Convolutional Mirror Descent
S. Balseiro
Haihao Lu
Vahab Mirrokni
Balasubramanian Sivan
62
4
0
12 Feb 2022
Joint Online Learning and Decision-making via Dual Mirror Descent
Joint Online Learning and Decision-making via Dual Mirror Descent
Alfonso Lobos
Paul Grigas
Zheng Wen
24
11
0
20 Apr 2021
Online Stochastic Optimization with Wasserstein Based Non-stationarity
Online Stochastic Optimization with Wasserstein Based Non-stationarity
Jiashuo Jiang
Xiaocheng Li
Jiawei Zhang
30
28
0
13 Dec 2020
Regularized Online Allocation Problems: Fairness and Beyond
Regularized Online Allocation Problems: Fairness and Beyond
S. Balseiro
Haihao Lu
Vahab Mirrokni
26
51
0
01 Jul 2020
Resourceful Contextual Bandits
Resourceful Contextual Bandits
Ashwinkumar Badanidiyuru
John Langford
Aleksandrs Slivkins
45
117
0
27 Feb 2014
1