Cover Image

Single-Sample and Robust Online Resource Allocation

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Ghuge, Rohan, Singla, Sahil, Wang, Yifan
Format:	Preprint
Published:	2025
Subjects:	Data Structures and Algorithms Computer Science and Game Theory Machine Learning
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Online Combinatorial Allocations and Auctions with Few Samples
by: Dütting, Paul, et al.
Published: (2024)

Bandit Sequential Posted Pricing via Half-Concavity
by: Singla, Sahil, et al.
Published: (2023)

Sample Complexity of Posted Pricing for a Single Item
by: Jin, Billy, et al.
Published: (2024)

Efficient Approximation Schemes for Stochastic Probing and Selection-Stopping Problems
by: Segev, Danny, et al.
Published: (2020)

Secretary, Prophet, and Stochastic Probing via Big-Decisions-First
by: Rubinstein, Aviad, et al.
Published: (2026)

Improved and Oracle-Efficient Online $\ell_1$-Multicalibration
by: Ghuge, Rohan, et al.
Published: (2025)

Online Resource Allocation with Cancellations
by: Ekbatani, Farbod, et al.
Published: (2022)

Sequential Selection with Expirations
by: Xu, Yihua, et al.
Published: (2024)

Learning Optimal Posted Prices for a Unit-Demand Buyer
by: Teng, Yifeng, et al.
Published: (2025)

Regret Bounds for Competitive Resource Allocation with Endogenous Costs
by: Chai, Rui
Published: (2026)

Conflict and Fairness in Resource Allocation
by: Bandopadhyay, Susobhan, et al.
Published: (2024)

Online Combinatorial Allocation with Interdependent Values
by: Feldman, Michal, et al.
Published: (2025)

Primal-Dual Algorithms with Predictions for Online Bounded Allocation and Ad-Auctions Problems
by: Kevi, Eniko, et al.
Published: (2024)

Online Bidding Algorithms with Strict Return on Spend (ROS) Constraint
by: Vaze, Rahul, et al.
Published: (2025)

The Long Arm of Nashian Allocation in Online $p$-Mean Welfare Maximization
by: Huang, Zhiyi, et al.
Published: (2025)

Posted Price Mechanisms for Online Allocation with Diseconomies of Scale
by: Jazi, Hossein Nekouyan, et al.
Published: (2025)

Roping in Uncertainty: Robustness and Regularization in Markov Games
by: McMahan, Jeremy, et al.
Published: (2024)

Online Allocation with Multi-Class Arrivals: Group Fairness vs Individual Welfare
by: Zargari, Faraz, et al.
Published: (2025)

Improved Mechanisms and Prophet Inequalities for Graphical Dependencies
by: Livanos, Vasilis, et al.
Published: (2024)

Optimal Single-Choice Prophet Inequalities from Samples
by: Rubinstein, Aviad, et al.
Published: (2019)

Online Matching Meets Sampling Without Replacement
by: Huang, Zhiyi, et al.
Published: (2024)

Robustness of Online Inventory Balancing to Inventory Shocks
by: Feng, Yiding, et al.
Published: (2025)

Computing Optimal Regularizers for Online Linear Optimization
by: Gatmiry, Khashayar, et al.
Published: (2024)

The Average-Value Allocation Problem
by: Bhawalkar, Kshipra, et al.
Published: (2024)

Single-Sample Prophet Inequalities via Greedy-Ordered Selection
by: Caramanis, Constantine, et al.
Published: (2021)

Static Pricing for Single Sample Multi-unit Prophet Inequalities
by: Nuti, Pranav, et al.
Published: (2024)

Improved Regret and Contextual Linear Extension for Pandora's Box and Prophet Inequality
by: Liu, Junyan, et al.
Published: (2025)

The Landscape of Almost Equitable Allocations
by: Hosseini, Hadi, et al.
Published: (2025)

Lipschitz Continuous Allocations for Optimization Games
by: Kumabe, Soh, et al.
Published: (2024)

On Interim Envy-Free Allocation Lotteries
by: Caragiannis, Ioannis, et al.
Published: (2021)

Nash Incentive-compatible Online Mechanism Learning via Weakly Differentially Private Online Learning
by: Huh, Joon Suk, et al.
Published: (2024)

High dimensional online calibration in polynomial time
by: Peng, Binghui
Published: (2025)

High-Dimensional Calibration from Swap Regret
by: Fishelson, Maxwell, et al.
Published: (2025)

Fixed Point Computation: Beating Brute Force with Smoothed Analysis
by: Attias, Idan, et al.
Published: (2025)

Simultaneous Swap Regret Minimization via KL-Calibration
by: Luo, Haipeng, et al.
Published: (2025)

Collaborative Prediction: Tractable Information Aggregation via Agreement
by: Collina, Natalie, et al.
Published: (2025)

Contextual Learning for Stochastic Optimization
by: Heuser, Anna, et al.
Published: (2025)

Repeated Bilateral Trade Against a Smoothed Adversary
by: Cesa-Bianchi, Nicolò, et al.
Published: (2023)

Repeated Contracting with Multiple Non-Myopic Agents: Policy Regret and Limited Liability
by: Collina, Natalie, et al.
Published: (2024)

On the Learning Curves of Revenue Maximization
by: Hanneke, Steve, et al.
Published: (2026)