Cover Image

A Unified Framework for Weighted Hypergraphic Networks and Fractional Matching

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Castera, Rémi, Fixary, Julien, Laraki, Rida
Format:	Preprint
Published:	2026
Subjects:	Computer Science and Game Theory F.2.2; G.2.2
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Selling Privacy in Blockchain Transactions
by: Chionas, Georgios, et al.
Published: (2025)

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

Multidimensional Budget-Feasible Mechanism Design
by: Neogi, Rian, et al.
Published: (2025)

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

On Robust Popular Matchings with Tie-Bounded Preferences and Stable Matchings with Two-Sided Ties
by: De, Koustav
Published: (2025)

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)

Fair Division Among Couples and Small Groups
by: Gölz, Paul, et al.
Published: (2025)

A Framework for Graph-Conditioned Hierarchical Shapley Attribution in Patent Valuation
by: Bose, Joy
Published: (2026)

The Complexity of Graph Exploration Games
by: Fuchs, Janosch, et al.
Published: (2023)

Simplified Algorithmic Metatheorems Beyond MSO: Treewidth and Neighborhood Diversity
by: Knop, Dušan, et al.
Published: (2017)

Robustness of Approval-Based Multiwinner Voting Rules
by: Faliszewski, Piotr, et al.
Published: (2026)

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

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

Dynamic Necklace Splitting
by: Advani, Rishi, et al.
Published: (2025)

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

On MMS, APS and XOS
by: Feige, Uriel, et al.
Published: (2026)

High-Multiplicity Fair Allocation Using Parametric Integer Linear Programming
by: Bredereck, Robert, et al.
Published: (2020)

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

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

On Dynamic Programming Theory for Leader-Follower Stochastic Games
by: Dibangoye, Jilles Steeve, et al.
Published: (2025)

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

The characteristic polynomials of $r$-uniform hypercycles with length $l$
by: Bo, Dong, et al.
Published: (2025)

Maximizing Index Diversity in Committee Elections
by: Böhm, Paula, et al.
Published: (2026)

Learning Real-Life Approval Elections
by: Faliszewski, Piotr, et al.
Published: (2026)

Constant-Factor Distortion Mechanisms for $k$-Committee Election
by: Pulyassary, Haripriya, et al.
Published: (2025)

Maps of Tournaments: Distances, Experiments, and Data
by: Nikolow, Filip, et al.
Published: (2026)

Computational Intractability of Strategizing against Online Learners
by: Assos, Angelos, et al.
Published: (2025)

A Protocol for Trustless Verification Under Uncertainty
by: Shi, David, et al.
Published: (2025)

On Minimum Maximal Distance-k Matchings
by: Kartynnik, Yury, et al.
Published: (2016)

Drawing Reeb Graphs
by: Chambers, Erin, et al.
Published: (2025)

Thin Tree Verification is coNP-Complete
by: Moayyedi, Alice
Published: (2025)

Map-Matching Queries under Fréchet Distance on Low-Density Spanners
by: Buchin, Kevin, et al.
Published: (2024)

Heterogeneous Mean Field Game Framework for LEO Satellite-Assisted V2X Networks
by: Sun, Kangkang, et al.
Published: (2026)

Approximation Algorithms for Action-Reward Query-Commit Matching
by: Derakhshan, Mahsa, et al.
Published: (2026)

Search versus Search for Collapsing Electoral Control Types
by: Carleton, Benjamin, et al.
Published: (2022)

Anyone but Him: The Complexity of Precluding an Alternative
by: Hemaspaandra, Edith, et al.
Published: (2005)

Fair distribution of bundles
by: Soberón, Pablo
Published: (2025)

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