Copertina

High-Multiplicity Fair Allocation Using Parametric Integer Linear Programming

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Bredereck, Robert, Kaczmarczyk, Andrzej, Knop, Dušan, Niedermeier, Rolf
Natura:	Preprint
Pubblicazione:	2020
Soggetti:	Computer Science and Game Theory Data Structures and Algorithms F.2.2
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Bribery Can Get Harder in Structured Multiwinner Approval Election
di: Kusek, Bartosz, et al.
Pubblicazione: (2022)

When Votes Change and Committees Should (Not)
di: Bredereck, Robert, et al.
Pubblicazione: (2020)

The Complexity of Extending Fair Allocations of Indivisible Goods
di: Deligkas, Argyrios, et al.
Pubblicazione: (2025)

A Counterexample to EFX $n \ge 3$ Agents, $m \ge n + 5$ Items, Submodular Valuations via SAT-Solving
di: Akrami, Hannaneh, et al.
Pubblicazione: (2026)

Improved Mechanisms and Prophet Inequalities for Graphical Dependencies
di: Livanos, Vasilis, et al.
Pubblicazione: (2024)

The Degree of Fairness in Efficient House Allocation
di: Hosseini, Hadi, et al.
Pubblicazione: (2024)

Multiplication of 0-1 matrices via clustering
di: Jansson, Jesper, et al.
Pubblicazione: (2025)

Boolean Matrix Multiplication for Highly Clustered Data on the Congested Clique
di: Lingas, Andrzej
Pubblicazione: (2024)

Parameterized Algorithms on Integer Sets with Small Doubling: Integer Programming, Subset Sum and k-SUM
di: Randolph, Tim, et al.
Pubblicazione: (2024)

Fast approximate $\ell$-center clustering in high dimensional spaces
di: Kowaluk, Mirosław, et al.
Pubblicazione: (2025)

Parameterized Approximation Schemes for Steiner Trees with Small Number of Steiner Vertices
di: Dvořák, Pavel, et al.
Pubblicazione: (2017)

Impact of Knowledge on the Cost of Treasure Hunt in Trees
di: Bouchard, Sébastien, et al.
Pubblicazione: (2025)

The Secretary Problem with Predictions and a Chosen Order
di: Karisani, Helia, et al.
Pubblicazione: (2026)

Properties of Egalitarian Sequences of Committees: Theory and Experiments
di: Böhm, Paula, et al.
Pubblicazione: (2025)

Dynamic Necklace Splitting
di: Advani, Rishi, et al.
Pubblicazione: (2025)

Approximate all-pairs Hamming distances and 0-1 matrix multiplication
di: Kowaluk, Miroslaw, et al.
Pubblicazione: (2025)

The Voronoi Diagram of Weakly Smooth Planar Point Sets in $O(\log n)$ Deterministic Rounds on the Congested Clique
di: Jansson, Jesper, et al.
Pubblicazione: (2024)

Connected Components in Linear Work and Near-Optimal Time
di: Farhadi, Alireza, et al.
Pubblicazione: (2023)

Near-Linear Time Computation of Welzl Orders on Graphs with Linear Neighborhood Complexity
di: Dreier, Jan, et al.
Pubblicazione: (2026)

An $O(\log \log n)$-approximate budget feasible mechanism for subadditive valuations
di: Neogi, Rian, et al.
Pubblicazione: (2025)

Fast and Simple Sorting Using Partial Information
di: Haeupler, Bernhard, et al.
Pubblicazione: (2024)

Minimum Riesz s-Energy Subset Selection in Ordered Point Sets via Dynamic Programming
di: Emmerich, Michael
Pubblicazione: (2025)

Approximating Multiplicatively Weighted Voronoi Diagrams: Efficient Construction with Linear Size
di: Gudmundsson, Joachim, et al.
Pubblicazione: (2021)

Host Community Respecting Refugee Housing
di: Knop, Dušan, et al.
Pubblicazione: (2023)

Efficiency of Self-Adjusting Heaps
di: Sinnamon, Corwin, et al.
Pubblicazione: (2023)

Individual Rationality in Topological Distance Games is Surprisingly Hard
di: Deligkas, Argyrios, et al.
Pubblicazione: (2024)

An Algorithmic Bridge Between Hamming and Levenshtein Distances
di: Goldenberg, Elazar, et al.
Pubblicazione: (2022)

Approximation Algorithms for Steiner Tree Based on Star Contractions: A Unified View
di: Hušek, Radek, et al.
Pubblicazione: (2020)

Scheduling with Time Dependent Utilities: Fairness and Efficiency
di: Nicosia, Gaia, et al.
Pubblicazione: (2026)

Universal Optimality of Dijkstra via Beyond-Worst-Case Heaps
di: Haeupler, Bernhard, et al.
Pubblicazione: (2023)

Bidirectional Dijkstra's Algorithm is Instance-Optimal
di: Haeupler, Bernhard, et al.
Pubblicazione: (2024)

Forward-backward Contention Resolution Schemes for Fair Rationing
di: Ma, Will, et al.
Pubblicazione: (2025)

On Solving Problems of Substantially Super-linear Complexity in $N^{o(1)}$ Rounds in the MPC Model
di: Lingas, Andrzej
Pubblicazione: (2026)

Towards a Parameterized Approximation Dichotomy of MinCSP for Linear Equations over Finite Commutative Rings
di: Dabrowski, Konrad K., et al.
Pubblicazione: (2024)

Online Combinatorial Optimization with Graphical Dependencies
di: Gao, Zhimeng, et al.
Pubblicazione: (2025)

Offline green bin packing and its constrained variant
di: Gong, Mingyang, et al.
Pubblicazione: (2026)

Exploiting Low Scanwidth to Resolve Soft Polytomies
di: Bruchhold, Sebastian, et al.
Pubblicazione: (2025)

A sufficient condition for characterizing the one-sided testable properties of families of graphs in the Random Neighbour Oracle Model
di: Awofeso, Christine, et al.
Pubblicazione: (2025)

Online computation of normalized substring complexity
di: Kucherov, Gregory, et al.
Pubblicazione: (2025)

Approximation algorithms for scheduling with rejection in green manufacturing
di: Gong, Mingyang, et al.
Pubblicazione: (2025)