Cover Image

The Power of Matching for Online Fractional Hedonic Games

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Bullinger, Martin, Romen, René, Schlenga, Alexander
Format:	Preprint
Published:	2025
Subjects:	Computer Science and Game Theory Data Structures and Algorithms 68W27 (Primary) 91B68, 05C70, 91A12 (Secondary) F.2.2; G.2; I.2.11
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Nash Welfare in Additively Separable Hedonic Games
by: Pagano, Marta, et al.
Published: (2026)

Polynomial-Time Algorithm for Thiele Voting Rules with Voter Interval Preferences
by: Manurangsi, Pasin, et al.
Published: (2026)

Nearly Tight Sample Complexity for Matroid Online Contention Resolution
by: Feldman, Moran, et al.
Published: (2025)

The Exchange Problem
by: Garg, Mohit, et al.
Published: (2024)

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

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

Majoritarian Assignment Rules
by: Brandt, Felix, et al.
Published: (2026)

Bayesian Recovery for Probabilistic Coalition Structures
by: Majumdar, Angshul
Published: (2025)

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

NP-membership for the boundary-boundary art-gallery problem
by: Stade, Jack
Published: (2025)

Independent Distributions on a Multi-Branching AND-OR Tree of Height 2
by: Shigemizu, Mika, et al.
Published: (2018)

Fairness in the k-Server Problem
by: Daneshvaramoli, Mohammadreza, et al.
Published: (2025)

Temporal Fair Division in Multi-Agent Systems: From Precise Alternation Metrics to Scalable Coordination Proxies
by: Papadopoulos, Nikolaos Al.
Published: (2026)

The Axiom of Consent: Friction Dynamics in Multi-Agent Coordination
by: Farzulla, Murad
Published: (2026)

Deterministic Algorithm and Faster Algorithm for Submodular Maximization subject to a Matroid Constraint
by: Buchbinder, Niv, et al.
Published: (2024)

ARRIVAL: Recursive Framework & $\ell_1$-Contraction
by: Haslebacher, Sebastian
Published: (2025)

Instance-Dependent Regret Bounds for Learning Two-Player Zero-Sum Games with Bandit Feedback
by: Ito, Shinji, et al.
Published: (2025)

On Computing the Shapley Value in Bankruptcy Games -llustrated by Rectified Linear Function Game-
by: Yamazaki, Shunta, et al.
Published: (2025)

Learning to Manipulate under Limited Information
by: Holliday, Wesley H., et al.
Published: (2024)

How to Compute a Moving Sum
by: Maslen, David K., et al.
Published: (2025)

Latent Objective Induction and Diversity-Constrained Selection: Algorithms for Multi-Locale Retrieval Pipelines
by: Alpay, Faruk, et al.
Published: (2026)

Approximating the Shapley Value of Minimum Cost Spanning Tree Games: An FPRAS for Saving Games
by: Jimbo, Takumi, et al.
Published: (2026)

Submodular Maximization over a Matroid $k$-Intersection: Multiplicative Improvement over Greedy
by: Feldman, Moran, et al.
Published: (2026)

Extending Exact Integrality Gap Computations for the Metric TSP
by: Cook, William, et al.
Published: (2026)

On the PLS-Completeness of $k$-Opt Local Search for the Traveling Salesman Problem
by: Heimann, Sophia, et al.
Published: (2026)

Computing and Enumerating Minimal Common Supersequences Between Two Strings
by: Sopp, Braeden, et al.
Published: (2026)

Unattainability of Common Knowledge in Asymmetric Games with Imperfect Information
by: Farestam, Fabian, et al.
Published: (2025)

A near-complete resolution of the exponential-time complexity of k-opt for the traveling salesman problem
by: Heimann, Sophia, et al.
Published: (2025)

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

Game Intelligence: Theory and Computation
by: Seven, Mehmet Mars
Published: (2023)

The Coordination Gap: Multi-Agent Alternation Metrics for Temporal Fairness in Repeated Games
by: Papadopoulos, Nikolaos Al., et al.
Published: (2026)

Predicting Memory Demands of BDD Operations using Maximum Graph Cuts (Extended Paper)
by: Sølvsten, Steffan Christ, et al.
Published: (2023)

Strategic Coercion Within Alliances: The Greenland Sovereignty Game as an AI Stress Test
by: Adl, Rommin, et al.
Published: (2026)

Separating Coverage and Submodular: Maximization Subject to a Cardinality Constraint
by: Filmus, Yuval, et al.
Published: (2024)

Revisiting Chazelle's Implementation of the Bottom-Left Heuristic: A Corrected and Rigorous Analysis
by: Michel, Stefan
Published: (2025)

Multi-variable Quantification of BDDs in External Memory using Nested Sweeping (Extended Paper)
by: Sølvsten, Steffan Christ, et al.
Published: (2024)

The $k$-Opt algorithm for the Traveling Salesman Problem has exponential running time for $k \ge 5$
by: Heimann, Sophia, et al.
Published: (2024)

The Bottom-Left Algorithm for the Strip Packing Problem
by: Hougardy, Stefan, et al.
Published: (2024)

The Power of Filling in Balanced Allocations
by: Los, Dimitrios, et al.
Published: (2022)

Probabilistic Analysis of Stable Matching in Large Markets with Siblings
by: Sun, Zhaohong, et al.
Published: (2025)