Cover Image

Online Job Assignment

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Ekbatani, Farbod, Feng, Yiding, Kash, Ian, Niazadeh, Rad
Format:	Preprint
Published:	2025
Subjects:	Data Structures and Algorithms Computer Science and Game Theory
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

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

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

Linear Programming Based Near-Optimal Pricing for Laminar Bayesian Online Selection
by: Anari, Nima, et al.
Published: (2018)

Stationary Online Contention Resolution Schemes
by: Aminian, Mohammad Reza, et al.
Published: (2026)

Non-Exclusive Notifications for Ride-Hailing at Lyft I: Single-Cycle Approximation Algorithms
by: Ekbatani, Farbod, et al.
Published: (2026)

Markovian Search with Ex-Ante Constraints: Theory and Applications to Socially Aware Algorithmic Hiring
by: Aminian, Mohammad Reza, et al.
Published: (2025)

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

How to Balance the Load Online When Jobs and Machines Are Both Selfish?
by: Wang, Wenqian, et al.
Published: (2024)

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

Group Fairness and Multi-criteria Optimization in School Assignment
by: A., Santhini K., et al.
Published: (2024)

Budget-feasible Egalitarian Allocation of Conflicting Jobs
by: Gupta, Sushmita, et al.
Published: (2024)

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

Metric Distortion of Line-up Elections: The Right Person for the Right Job
by: Jerrett, Christopher, et al.
Published: (2024)

Near-Optimal Bayesian Online Assortment of Reusable Resources
by: Feng, Yiding, et al.
Published: (2025)

Online Block Packing
by: Eliezer, Ariel Ben, et al.
Published: (2025)

Online Matroid Embeddings
by: Cristi, Andrés, et al.
Published: (2024)

Stochastic Online Correlated Selection
by: Chen, Ziyun, et al.
Published: (2024)

Stability in Online Coalition Formation
by: Bullinger, Martin, et al.
Published: (2023)

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

Edge-Weighted Online Bipartite Matching
by: Fahrbach, Matthew, et al.
Published: (2020)

Fairness and Efficiency in Online Class Matching
by: Hajiaghayi, MohammadTaghi, et al.
Published: (2024)

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

Risk-Sensitive Online Selection with Bounded Adaptivity
by: Nekouyan, Hossein, et al.
Published: (2025)

Threshold Testing and Semi-Online Prophet Inequalities
by: Hoefer, Martin, et al.
Published: (2023)

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

Prophet Upper Bounds for Online Matching and Auctions
by: Soto, José, et al.
Published: (2024)

Truthful Matching with Online Items and Offline Agents
by: Feldman, Michal, et al.
Published: (2022)

Online Nash Welfare Maximization Without Predictions
by: Huang, Zhiyi, et al.
Published: (2022)

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

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

Online Envy Minimization and Multicolor Discrepancy: Equivalences and Separations
by: Halpern, Daniel, et al.
Published: (2025)

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

Addressing Bias in Online Selection with Limited Budget of Comparisons
by: Benomar, Ziyad, et al.
Published: (2023)

Repeated Descent: A Framework for Online Budget-Feasible Auctions
by: Charalampopoulos, Andreas, et al.
Published: (2026)

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

Optimal Competitive Ratio of Two-sided Online Bipartite Matching
by: Tang, Zhihao Gavin
Published: (2026)

Beyond the Half-Approximation: Fair and Efficient Online Class Matching
by: Borst, Sander, et al.
Published: (2026)

Online Coalition Formation under Random Arrival or Coalition Dissolution
by: Bullinger, Martin, et al.
Published: (2023)

A Competitive Posted-Price Mechanism for Online Budget-Feasible Auctions
by: Charalampopoulos, Andreas, et al.
Published: (2025)