Image de couverture de livre

How to Balance the Load Online When Jobs and Machines Are Both Selfish?

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Wang, Wenqian, Xu, Chenyang, Zhang, Yuhao
Format:	Preprint
Publié:	2024
Sujets:	Data Structures and Algorithms Computer Science and Game Theory
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Selfish, Local and Online Scheduling via Vector Fitting
par: Kashaev, Danish
Publié: (2025)

Online Job Assignment
par: Ekbatani, Farbod, et autres
Publié: (2025)

Robustness of Online Inventory Balancing to Inventory Shocks
par: Feng, Yiding, et autres
Publié: (2025)

Best of Both Worlds Guarantees for Equitable Allocations
par: Bhaskar, Umang, et autres
Publié: (2025)

Best-of-Both-Worlds Guarantees with Fairer Endings
par: Kavitha, Telikepalli, et autres
Publié: (2025)

How Hard Is It to Rig a Tournament When Few Players Can Beat or Be Beaten by the Favorite?
par: Wang, Zhonghao, et autres
Publié: (2026)

Budget-feasible Egalitarian Allocation of Conflicting Jobs
par: Gupta, Sushmita, et autres
Publié: (2024)

A Reduction from Chores Allocation to Job Scheduling
par: Huang, Xin, et autres
Publié: (2023)

Metric Distortion of Line-up Elections: The Right Person for the Right Job
par: Jerrett, Christopher, et autres
Publié: (2024)

Data Exchange Markets via Utility Balancing
par: Bhaskara, Aditya, et autres
Publié: (2024)

Online Matroid Embeddings
par: Cristi, Andrés, et autres
Publié: (2024)

Online Block Packing
par: Eliezer, Ariel Ben, et autres
Publié: (2025)

Undetectable Selfish Mining
par: Bahrani, Maryam, et autres
Publié: (2023)

Stochastic Online Correlated Selection
par: Chen, Ziyun, et autres
Publié: (2024)

Online Resource Allocation with Cancellations
par: Ekbatani, Farbod, et autres
Publié: (2022)

Stability in Online Coalition Formation
par: Bullinger, Martin, et autres
Publié: (2023)

The Long Arm of Nashian Allocation in Online $p$-Mean Welfare Maximization
par: Huang, Zhiyi, et autres
Publié: (2025)

An Exercise in Tournament Design: When Some Matches Must Be Scheduled
par: Gupta, Sushmita, et autres
Publié: (2024)

When agents choose bundles autonomously: guarantees beyond discrepancy
par: Gupta, Sushmita, et autres
Publié: (2026)

Computing Balanced Solutions for Large International Kidney Exchange Schemes When Cycle Length Is Unbounded
par: Benedek, Márton, et autres
Publié: (2023)

Fairness and Efficiency in Online Class Matching
par: Hajiaghayi, MohammadTaghi, et autres
Publié: (2024)

Edge-Weighted Online Bipartite Matching
par: Fahrbach, Matthew, et autres
Publié: (2020)

Online Combinatorial Allocation with Interdependent Values
par: Feldman, Michal, et autres
Publié: (2025)

When far is better: The Chamberlin-Courant approach to obnoxious committee selection
par: Gupta, Sushmita, et autres
Publié: (2024)

Online Matching Meets Sampling Without Replacement
par: Huang, Zhiyi, et autres
Publié: (2024)

Prophet Upper Bounds for Online Matching and Auctions
par: Soto, José, et autres
Publié: (2024)

Universal Online Contention Resolution with Preselected Order
par: Zhao, Junyao
Publié: (2025)

Threshold Testing and Semi-Online Prophet Inequalities
par: Hoefer, Martin, et autres
Publié: (2023)

Truthful Matching with Online Items and Offline Agents
par: Feldman, Michal, et autres
Publié: (2022)

Online Nash Welfare Maximization Without Predictions
par: Huang, Zhiyi, et autres
Publié: (2022)

Risk-Sensitive Online Selection with Bounded Adaptivity
par: Nekouyan, Hossein, et autres
Publié: (2025)

Static Pricing for Online Selection Problem and its Variants
par: Sun, Bo, et autres
Publié: (2024)

Posted Price Mechanisms for Online Allocation with Diseconomies of Scale
par: Jazi, Hossein Nekouyan, et autres
Publié: (2025)

Addressing Bias in Online Selection with Limited Budget of Comparisons
par: Benomar, Ziyad, et autres
Publié: (2023)

Online Envy Minimization and Multicolor Discrepancy: Equivalences and Separations
par: Halpern, Daniel, et autres
Publié: (2025)

Repeated Descent: A Framework for Online Budget-Feasible Auctions
par: Charalampopoulos, Andreas, et autres
Publié: (2026)

Threshold Policies with Tight Guarantees for Online Selection with Convex Costs
par: Tan, Xiaoqi, et autres
Publié: (2023)

Optimal Competitive Ratio of Two-sided Online Bipartite Matching
par: Tang, Zhihao Gavin
Publié: (2026)

Beyond the Half-Approximation: Fair and Efficient Online Class Matching
par: Borst, Sander, et autres
Publié: (2026)

Online Coalition Formation under Random Arrival or Coalition Dissolution
par: Bullinger, Martin, et autres
Publié: (2023)