Cover Image

On MMS, APS and XOS

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Feige, Uriel, Grinberg, Vadim
Format:	Preprint
Published:	2026
Subjects:	Computer Science and Game Theory 68Q25 F.2.2
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Fair allocations with subadditive and XOS valuations
by: Feige, Uriel, et al.
Published: (2025)

Low communication protocols for fair allocation of indivisible goods
by: Feige, Uriel
Published: (2024)

Optimal Portfolio Compression for Priority-Proportional Clearing with Defaulting Costs
by: Csáji, Gergely, et al.
Published: (2026)

Near-Optimal Consistency-Robustness Trade-Offs for Learning-Augmented Online Knapsack Problems
by: Daneshvaramoli, Mohammadreza, et al.
Published: (2024)

Optimal Path Planning in Hostile Environments
by: Kaczmarczyk, Andrzej, et al.
Published: (2026)

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

Improved Approximation Ratio for Strategyproof Facility Location on a Cycle
by: Rogowski, Krzysztof, et al.
Published: (2025)

Two-player Domino games
by: de Menibus, Benjamin Hellouin, et al.
Published: (2023)

Detecting and taking Project Interactions into account in Participatory Budgeting
by: Durand, Martin, et al.
Published: (2024)

Ordering Collective Unit Tasks: from Scheduling to Computational Social Choice
by: Durand, Martin, et al.
Published: (2024)

Collective schedules: axioms and algorithms
by: Durand, Martin, et al.
Published: (2024)

Prediction-Augmented Mechanism Design for Weighted Facility Location
by: Shi, Yangguang, et al.
Published: (2025)

The framework to unify all complexity dichotomy theorems for Boolean tensor networks
by: Xia, Mingji
Published: (2026)

The Word Problem for Products of Symmetric Groups
by: Simon, Hans U.
Published: (2025)

Robust Bichromatic Classification using Two Lines
by: Glazenburg, Erwin, et al.
Published: (2024)

Fair Division in a Variable Setting
by: Chandramouleeswaran, Harish, et al.
Published: (2024)

On the Complexity of Identifying Groups without Abelian Normal Subgroups: Parallel, First Order, and GI-Hardness
by: Grochow, Joshua A., et al.
Published: (2025)

The Computational Complexity of Variational Inequalities and Applications in Game Theory
by: Kapron, Bruce M., et al.
Published: (2024)

Constraint Satisfaction Problems over Finitely Bounded Homogeneous Structures: a Dichotomy between FO and L-hard
by: Dorochko, Leonid, et al.
Published: (2026)

From Independence of Clones to Composition Consistency: A Hierarchy of Barriers to Strategic Nomination
by: Berker, Ratip Emin, et al.
Published: (2025)

Designing Rules to Pick a Rule: Aggregation by Consistency
by: Berker, Ratip Emin, et al.
Published: (2025)

ABox Abduction for Inconsistent Knowledge Bases under Repair Semantics
by: Haak, Anselm, et al.
Published: (2026)

Parallel Algorithms for Group Isomorphism via Code Equivalence
by: Levet, Michael
Published: (2026)

Competitive Query Minimization for Stable Matching with One-Sided Uncertainty
by: Bampis, Evripidis, et al.
Published: (2024)

Simple minimally unsatisfiable subsets of 2-CNFs
by: Kullmann, Oliver, et al.
Published: (2026)

Overlapping Biclustering
by: Bentert, Matthias, et al.
Published: (2025)

Matching Markets with Chores
by: Garg, Jugal, et al.
Published: (2024)

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

Matroid Bayesian Online Selection
by: DeHaan, Ian, et al.
Published: (2024)

Randomized Strategyproof Mechanisms with Best of Both Worlds Fairness and Efficiency
by: Sun, Ankang, et al.
Published: (2024)

A Fair Allocation is Approximately Optimal for Indivisible Chores, or Is It?
by: Li, Bo, et al.
Published: (2024)

On Solving Simple Curved Nonograms
by: Löffler, Maarten, et al.
Published: (2025)

Induced Disjoint Paths Without an Induced Minor
by: Aboulker, Pierre, et al.
Published: (2025)

Maximum Matchings in Geometric Intersection Graphs
by: Bonnet, Édouard, et al.
Published: (2019)

On Identifying Critical Network Edges via Analyzing Changes in Shapes (Curvatures)
by: DasGupta, Bhaskar, et al.
Published: (2026)

Logarithmic Weisfeiler--Leman and Treewidth
by: Levet, Michael, et al.
Published: (2023)

Canonizing Graphs of Bounded Rank-Width in Parallel via Weisfeiler--Leman
by: Levet, Michael, et al.
Published: (2023)

On (In)approximability of MaxMin Independent Set Reconfiguration
by: Hoang, Hung P., et al.
Published: (2026)

A Unified Framework for Weighted Hypergraphic Networks and Fractional Matching
by: Castera, Rémi, et al.
Published: (2026)

An MDL-Style Cost Functional KC, Distribution-Preserving Reductions ($A2^d$), and an $AC^0$+log Lower Bound for 3SAT via Balanced 3XOR
by: Lela, Marko
Published: (2025)