Cover Image

Scheduling with Uncertain Holding Costs and its Application to Content Moderation

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Gocmen, Caner, Lykouris, Thodoris, Sinha, Deeksha, Weng, Wentao
Format:	Preprint
Published:	2025
Subjects:	Data Structures and Algorithms Computer Science and Game Theory Machine Learning Performance Probability
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

The Transient Cost of Learning in Queueing Systems
by: Freund, Daniel, et al.
Published: (2023)

Learning in Stackelberg Games with Non-myopic Agents
by: Haghtalab, Nika, et al.
Published: (2022)

Learning to Defer in Congested Systems: The AI-Human Interplay
by: Lykouris, Thodoris, et al.
Published: (2024)

Pandora's Box Problem With Time Constraints
by: Amanatidis, Georgios, et al.
Published: (2024)

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

Fair Repetitive Interval Scheduling
by: Heeger, Klaus, et al.
Published: (2024)

Selfish, Local and Online Scheduling via Vector Fitting
by: Kashaev, Danish
Published: (2025)

A Reduction from Chores Allocation to Job Scheduling
by: Huang, Xin, et al.
Published: (2023)

An Exercise in Tournament Design: When Some Matches Must Be Scheduled
by: Gupta, Sushmita, et al.
Published: (2024)

Pandora's Problem with Combinatorial Cost
by: Berger, Ben, et al.
Published: (2023)

Prophet Inequalities with Cancellation Costs
by: Ekbatani, Farbod, et al.
Published: (2024)

Universal Online Contention Resolution with Preselected Order
by: Zhao, Junyao
Published: (2025)

Threshold Policies with Tight Guarantees for Online Selection with Convex Costs
by: Tan, Xiaoqi, et al.
Published: (2023)

Static Pricing for Online Selection Problem and its Variants
by: Sun, Bo, et al.
Published: (2024)

Combinatorial Bernoulli Factories
by: Niazadeh, Rad, et al.
Published: (2020)

Dynamic Matching with Post-allocation Service and its Application to Refugee Resettlement
by: Bansak, Kirk, et al.
Published: (2024)

Cycle Cancellation for Submodular Fractional Allocations and Applications
by: Chekuri, Chandra, et al.
Published: (2025)

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

Delegation with Costly Inspection
by: Hajiaghayi, Mohammad T., et al.
Published: (2025)

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

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

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

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

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

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

An $α$-regret analysis of Adversarial Bilateral Trade
by: Azar, Yossi, et al.
Published: (2022)

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

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

Strategizing against No-Regret Learners in First-Price Auctions
by: Rubinstein, Aviad, et al.
Published: (2024)

The Role of Transparency in Repeated First-Price Auctions with Unknown Valuations
by: Cesa-Bianchi, Nicolò, et al.
Published: (2023)

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)

Learning Safe Strategies for Value Maximizing Buyers in Uniform Price Auctions
by: Golrezaei, Negin, et al.
Published: (2024)

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

Bandit Social Learning: Exploration under Myopic Behavior
by: Banihashem, Kiarash, et al.
Published: (2023)

Smooth Nash Equilibria: Algorithms and Complexity
by: Daskalakis, Constantinos, et al.
Published: (2023)

Water-Filling is Universally Minimax Optimal
by: Banerjee, Siddhartha, et al.
Published: (2026)

Incentivizing Exploration with Selective Data Disclosure
by: Immorlica, Nicole, et al.
Published: (2018)

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

Adaptive Discretization against an Adversary: Lipschitz bandits, Dynamic Pricing, and Auction Tuning
by: Podimata, Chara, et al.
Published: (2020)