Image de couverture de livre

An $O(\log \log n)$-approximate budget feasible mechanism for subadditive valuations

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Neogi, Rian, Pashkovich, Kanstantsin, Swamy, Chaitanya
Format:	Preprint
Publié:	2025
Sujets:	Computer Science and Game Theory Discrete Mathematics Data Structures and Algorithms F.2.2; G.2; J.4
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Multidimensional Budget-Feasible Mechanism Design
par: Neogi, Rian, et autres
Publié: (2025)

An O(log n)-Approximation Algorithm for (p,q)-Flexible Graph Connectivity via Independent Rounding
par: Ibrahimpur, Sharat, et autres
Publié: (2025)

Approximation Algorithms for Correlated Knapsack Orienteering
par: Espinosa, David Aleman, et autres
Publié: (2024)

Deterministic Minimum Steiner Cut in Maximum Flow Time
par: Ding, Matthew, et autres
Publié: (2023)

Highly Connected Steiner Subgraph -- Parameterized Algorithms and Applications to Hitting Set Problems
par: Eiben, Eduard, et autres
Publié: (2023)

Forward-backward Contention Resolution Schemes for Fair Rationing
par: Ma, Will, et autres
Publié: (2025)

A polynomial-time algorithm for recognizing high-bandwidth graphs
par: Varona, Luis M. B.
Publié: (2026)

Dynamic Necklace Splitting
par: Advani, Rishi, et autres
Publié: (2025)

Online Bipartite Matching in the Probe-Commit Model
par: Borodin, Allan, et autres
Publié: (2023)

Online Matching and Contention Resolution for Edge Arrivals with Vanishing Probabilities
par: Ma, Will, et autres
Publié: (2024)

On (Random-order) Online Contention Resolution Schemes for the Matching Polytope of (Bipartite) Graphs
par: MacRury, Calum, et autres
Publié: (2022)

Constant-Factor Distortion Mechanisms for $k$-Committee Election
par: Pulyassary, Haripriya, et autres
Publié: (2025)

Approximation Algorithms for Capacitated Vehicle Routing Problems: A Comprehensive Survey
par: Chen, Yongyu
Publié: (2023)

NP-Completeness of the Combinatorial Distance Matrix Realisation Problem
par: Fairbairn, David L., et autres
Publié: (2024)

Almost Tight Additive Guarantees for $k$-Edge-Connectivity
par: Kumar, Nikhil, et autres
Publié: (2025)

Faster algorithms on linear delta-matroids
par: Koana, Tomohiro, et autres
Publié: (2024)

A Polynomial Kernel for Vertex Deletion to the Scattered Class of Proper Interval Graph and Trees
par: Jacob, Ashwin, et autres
Publié: (2026)

Better Approximation for Weighted $k$-Matroid Intersection
par: Singer, Neta, et autres
Publié: (2024)

Enumeration of Bases in Matroid with Exponentially Large Ground Set
par: Nishimura, Yuki, et autres
Publié: (2025)

Partial Implementation of Max Flow and Min Cost Flow in Almost-Linear Time
par: Kavi, Nithin
Publié: (2024)

On the Parameterized Tractability of Packing Vertex-Disjoint A-Paths with Length Constraints
par: Bandopadhyay, Susobhan, et autres
Publié: (2026)

Searching in trees with $k$-up-modular cost functions
par: Szyfelbein, Michał
Publié: (2025)

A Polynomial Kernel for Deletion to the Scattered Class of Cliques and Trees
par: Jacob, Ashwin, et autres
Publié: (2024)

Efficient Uniform Sampling of Surjections via their Profiles
par: Carayol, Arnaud, et autres
Publié: (2026)

The Secretary Problem with Predictions and a Chosen Order
par: Karisani, Helia, et autres
Publié: (2026)

Loop unrolling of UCA models: distance labeling
par: Soulignac, Francisco J, et autres
Publié: (2022)

Tight Guarantees for Cut-Relative Survivable Network Design via a Decomposition Technique
par: Kumar, Nikhil, et autres
Publié: (2025)

Efficient Approximation of Fractional Hypertree Width
par: Korchemna, Viktoriia, et autres
Publié: (2024)

Computing parameters that generalize interval graphs using restricted modular partitions
par: Bonomo-Braberman, Flavia, et autres
Publié: (2025)

Weisfeiler-Leman on graphs of small twin-width
par: Heinrich, Irene, et autres
Publié: (2026)

Lower Bounds for Leaf Rank of Leaf Powers
par: Høgemo, Svein
Publié: (2024)

Graphs with no long claws: An improved bound for the analog of the Gyárfás' path argument
par: Bourneuf, Romain, et autres
Publié: (2025)

Optimal distance query reconstruction for graphs without long induced cycles
par: Bastide, Paul, et autres
Publié: (2023)

Beyond Worst-Case Subset Sum: An Adaptive, Structure-Aware Solver with Sub-$2^{n/2}$ Enumeration
par: Salas, Jesus
Publié: (2025)

Scheduling with Time Dependent Utilities: Fairness and Efficiency
par: Nicosia, Gaia, et autres
Publié: (2026)

Prophet Inequalities: Separating Random Order from Order Selection
par: Giambartolomei, Giordano, et autres
Publié: (2023)

IID Prophet Inequality with Random Horizon: Going Beyond Increasing Hazard Rates
par: Giambartolomei, Giordano, et autres
Publié: (2024)

A Decomposition Approach to the Weighted $k$-server Problem
par: Ayyadevara, Nikhil, et autres
Publié: (2024)

A Deterministic Bicriteria Approximation Algorithm for the Art Gallery Problem
par: Elbassioni, Khaled
Publié: (2025)

Arborescences and Shortest Path Trees when Colors Matter
par: Ardra, P. S., et autres
Publié: (2024)