Cover Image

Compatible $k$-Relaxations of Fairness and Non-Wastefulness Under Hereditary Constraints

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Wakasugi, Tenma, Sun, Zhaohong, Kimura, Kei, Yokoo, Makoto
Format:	Preprint
Published:	2026
Subjects:	Computer Science and Game Theory 91B68 F.2; I.2
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Achieving Balanced Representation in School Choice with Diversity Goals
by: Sun, Zhaohong, et al.
Published: (2024)

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

Stable Matchings in Practice: A Constraint Programming Approach
by: Sun, Zhaohong, et al.
Published: (2024)

A Fair and Optimal Approach to Sequential Healthcare Rationing
by: Sun, Zhaohong
Published: (2025)

MenuNet: A Strategy-Proof Mechanism for Matching Markets
by: Sun, Zhaohong, et al.
Published: (2026)

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

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)

On the Edge of Core (Non-)Emptiness: An Automated Reasoning Approach to Approval-Based Multi-Winner Voting
by: Berker, Ratip Emin, 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)

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

EF1 Allocations for Identical Trilean and Separable Single-Peaked Valuations
by: Bhaskar, Umang, et al.
Published: (2024)

Equilibrium Computation in the Hotelling-Downs Model of Spatial Competition
by: Bhaskar, Umang, et al.
Published: (2024)

How Many Votes is a Lie Worth? Measuring Strategyproofness through Resource Augmentation
by: Berker, Ratip Emin, et al.
Published: (2026)

A New Relaxation of Fairness in Two-Sided Matching Respecting Acquaintance Relationships
by: Takeshima, Ryota, et al.
Published: (2025)

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

Multi-Stage Generalized Deferred Acceptance Mechanism: Strategyproof Mechanism for Handling General Hereditary Constraints
by: Kimura, Kei, et al.
Published: (2023)

The Power of Matching for Online Fractional Hedonic Games
by: Bullinger, Martin, et al.
Published: (2025)

Welfare-Optimal Serial Dictatorships have Polynomial Query Complexity
by: Caragiannis, Ioannis, et al.
Published: (2024)

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

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

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

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

Prices, Bids, Values: One ML-Powered Combinatorial Auction to Rule Them All
by: Soumalias, Ermis, et al.
Published: (2024)

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

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

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

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

The Value of Recall in Extensive-Form Games
by: Berker, Ratip Emin, et al.
Published: (2024)

AI Agents for the Dhumbal Card Game: A Comparative Study
by: Malla, Sahaj Raj
Published: (2025)

Social Choice Should Guide AI Alignment in Dealing with Diverse Human Feedback
by: Conitzer, Vincent, et al.
Published: (2024)

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

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

A Characterization of Complexity in Public Goods Games
by: Gilboa, Matan
Published: (2023)

Going with the Flow: Approximating Banzhaf Values via Graph Neural Networks
by: Kempinski, Benjamin, et al.
Published: (2025)

Stable Voting and the Splitting of Cycles
by: Holliday, Wesley H., et al.
Published: (2025)

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

Adversarial Learning in Games with Bandit Feedback: Logarithmic Pure-Strategy Maximin Regret
by: Ito, Shinji, et al.
Published: (2026)

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

Imperfect-Recall Games: Equilibrium Concepts and Their Complexity
by: Tewolde, Emanuel, et al.
Published: (2024)