Cover Image

Efficient Resource Allocation under Adversary Attacks: A Decomposition-Based Approach

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Davoodi, Mansoor, Maghsudi, Setareh
Format:	Preprint
Published:	2025
Subjects:	Data Structures and Algorithms
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Stochastic Multi-Objective Multi-Armed Bandits: Regret Definition and Algorithm
by: Davoodi, Mansoor, et al.
Published: (2025)

A Black-Box Approach for Exogenous Replenishment in Online Resource Allocation
by: Kang, Suho, et al.
Published: (2025)

Approximating Optimum Online for Capacitated Resource Allocation
by: Braun, Alexander, et al.
Published: (2024)

A Ranking Framework for Network Resource Allocation and Scheduling via Hypergraphs
by: Singh, Rajpreet, et al.
Published: (2025)

Asymptotically Optimal Competitive Ratio for Online Allocation of Reusable Resources
by: Goyal, Vineet, et al.
Published: (2020)

Submodular Max-Min Allocation under Identical Valuations
by: Boehmer, Kimon
Published: (2026)

Randomized Rounding Approaches to Online Allocation, Sequencing, and Matching
by: Ma, Will
Published: (2024)

Maintaining Random Assignments under Adversarial Dynamics
by: Haeupler, Bernhard, et al.
Published: (2026)

Efficient Leverage Score Sampling for Tensor Train Decomposition
by: Bharadwaj, Vivek, et al.
Published: (2024)

Efficient Algorithms for Adversarially Robust Approximate Nearest Neighbor Search
by: Andoni, Alexandr, et al.
Published: (2026)

Predict, Reposition, and Allocate: A Greedy and Flow-Based Architecture for Sustainable Urban Food Delivery
by: Makhdomi, Aqsa Ashraf, et al.
Published: (2025)

Adversarial Attacks on Combinatorial Multi-Armed Bandits
by: Balasubramanian, Rishab, et al.
Published: (2023)

Improved Directed Expander Decompositions
by: Fleischmann, Henry, et al.
Published: (2025)

On the Streaming Complexity of Expander Decomposition
by: Chen, Yu, et al.
Published: (2024)

Individual Fairness in Graph Decomposition
by: Munagala, Kamesh, et al.
Published: (2024)

Breaking the $n^{1.5}$ Additive Error Barrier for Private and Efficient Graph Sparsification via Private Expander Decomposition
by: Aamand, Anders, et al.
Published: (2025)

Clustering under Constraints: Efficient Parameterized Approximation Schemes
by: Bhore, Sujoy, et al.
Published: (2025)

Course Allocation with Credits via Stable Matching
by: Rodríguez, José, et al.
Published: (2025)

Cost Preserving Dependent Rounding for Allocation Problems
by: Rohwedder, Lars, et al.
Published: (2025)

Online Allocation with Concave, Diminishing-Returns Objectives
by: Patton, Kalen
Published: (2025)

Fair and Efficient Ridesharing: A Dynamic Programming-based Relocation Approach
by: Makhdomi, Aqsa Ashraf, et al.
Published: (2024)

Simple Length-Constrained Expander Decompositions
by: Bodwin, Greg, et al.
Published: (2025)

Compressing Suffix Trees by Path Decompositions
by: Becker, Ruben, et al.
Published: (2025)

Expander Decomposition with Almost Optimal Overhead
by: Bansal, Nikhil, et al.
Published: (2026)

Width Parameters for Minimum Flow Decomposition
by: Grigorjew, Andreas, et al.
Published: (2024)

Parallel Higher-order Truss Decomposition
by: Chen, Chen, et al.
Published: (2024)

Unbreakable Decomposition in Close-to-Linear Time
by: Anand, Aditya, et al.
Published: (2024)

Efficient Approximation Algorithms for Fair Influence Maximization under Maximin Constraint
by: Rui, Xiaobin, et al.
Published: (2025)

Efficient Branch-and-Bound for Submodular Function Maximization under Knapsack Constraint
by: Hao, Yimin, et al.
Published: (2025)

Near-Optimal Directed Low-Diameter Decompositions
by: Bringmann, Karl, et al.
Published: (2025)

Expander Decomposition for Non-Uniform Vertex Measures
by: Agassy, Daniel, et al.
Published: (2025)

Simpler and Faster Directed Low-Diameter Decompositions
by: Li, Jason
Published: (2025)

Eulerian Graph Sparsification by Effective Resistance Decomposition
by: Jambulapati, Arun, et al.
Published: (2024)

Near-Optimal Algorithm for Directed Expander Decompositions
by: Sulser, Aurelio L., et al.
Published: (2024)

Faster MPC Algorithms for Approximate Allocation in Uniformly Sparse Graphs
by: Łącki, Jakub, et al.
Published: (2025)

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

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

A Practical Linear Time Algorithm for Optimal Tree Decomposition of Halin Graphs
by: Alejandro-Soto, J. A., et al.
Published: (2025)

Deterministic Padded Decompositions and Negative-Weight Shortest Paths
by: Li, Jason
Published: (2025)

Faster Weak Expander Decompositions and Approximate Max Flow
by: Fleischmann, Henry, et al.
Published: (2025)