Cover Image

Dividing Conflicting Items Fairly

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Igarashi, Ayumi, Manurangsi, Pasin, Yoneda, Hirotaka
Format:	Preprint
Published:	2025
Subjects:	Computer Science and Game Theory
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Fair Allocation under Conflict Constraints
by: Equbal, Sarfaraz, et al.
Published: (2026)

Fair Division with Soft Conflicts
by: Yoneda, Hirotaka, et al.
Published: (2026)

Fair Allocation of Indivisible Goods with Variable Groups
by: Gölz, Paul, et al.
Published: (2025)

Ordinal Maximin Guarantees for Group Fair Division
by: Manurangsi, Pasin, et al.
Published: (2024)

Asymptotic Fair Division: Chores Are Easier Than Goods
by: Manurangsi, Pasin, et al.
Published: (2025)

Differentially Private Fair Division
by: Manurangsi, Pasin, et al.
Published: (2022)

Fair and efficient allocation of indivisible items under category constraints
by: Igarashi, Ayumi, et al.
Published: (2025)

Asymptotic Analysis of Weighted Fair Division
by: Manurangsi, Pasin, et al.
Published: (2025)

Fair and Efficient Completion of Indivisible Goods
by: HV, Vishwa Prakash, et al.
Published: (2024)

The Price of Justified Representation
by: Elkind, Edith, et al.
Published: (2021)

Tight Lower Bound for Multicolor Discrepancy
by: Manurangsi, Pasin, et al.
Published: (2025)

Discrepancy Beyond Additive Functions with Applications to Fair Division
by: Hollender, Alexandros, et al.
Published: (2025)

Fair Division of Chores with Budget Constraints
by: Elkind, Edith, et al.
Published: (2024)

Asymptotic Existence of Class Envy-free Matchings
by: Yokoyama, Tomohiko, et al.
Published: (2025)

Maximin Shares with Lower Quotas
by: Kinoshita, Hirota, et al.
Published: (2026)

Fairly Dividing Non-identical Random Items: Just Sample or Match
by: Kale, Aprup, et al.
Published: (2025)

Dividing Indivisible Items for the Benefit of All: It is Hard to Be Fair Without Social Awareness
by: Deligkas, Argyris, et al.
Published: (2025)

Reachability of Fair Allocations via Sequential Exchanges
by: Igarashi, Ayumi, et al.
Published: (2023)

Fair Division with Two-Sided Preferences
by: Igarashi, Ayumi, et al.
Published: (2022)

Algorithmic Persuasion with Evidence
by: Hoefer, Martin, et al.
Published: (2020)

Keeping the Harmony Between Neighbors: Local Fairness in Graph Fair Division
by: Hummel, Halvard, et al.
Published: (2024)

Complexity of Round-Robin Allocation with Potentially Noisy Queries
by: Li, Zihan, et al.
Published: (2024)

Two-Sided Fairness in Many-to-One Matching
by: Igarashi, Ayumi, et al.
Published: (2025)

Individually Stable Dynamics in Coalition Formation over Graphs
by: Fanelli, Angelo, et al.
Published: (2024)

Fair Division of Indivisible Items
by: Hsu, Kevin
Published: (2025)

The Complexity of Fair Division of Indivisible Items with Externalities
by: Deligkas, Argyrios, et al.
Published: (2023)

New Fairness Concepts for Allocating Indivisible Items
by: Caragiannis, Ioannis, et al.
Published: (2022)

Reforming an Unfair Allocation by Exchanging Goods
by: Yuen, Sheung Man, et al.
Published: (2024)

Maximin Fair Allocation of Indivisible Items under Cost Utilities
by: Botan, Sirin, et al.
Published: (2024)

Bad News for Couples: Tight Lower Bounds for Fair Division of Indivisible Items
by: la Tour, Max Dupré
Published: (2026)

Temporal Fair Division of Indivisible Items
by: Elkind, Edith, et al.
Published: (2024)

Weighted Fairness Notions for Indivisible Items Revisited
by: Chakraborty, Mithun, et al.
Published: (2021)

Simultaneously Fair Allocation of Indivisible Items Across Multiple Dimensions
by: Kawase, Yasushi, et al.
Published: (2025)

Conflict and Fairness in Resource Allocation
by: Bandopadhyay, Susobhan, et al.
Published: (2024)

StrNim: a variant of Nim played on strings
by: Mizuno, Shota, et al.
Published: (2025)

Selling an Item through Persuasion
by: Fan, Zhikang, et al.
Published: (2024)

Single-Item Auctions with a Monopolist Intermediary
by: Liu, Jingyi, et al.
Published: (2026)

On Truthful Item-Acquiring Mechanisms for Reward Maximization
by: Shan, Liang, et al.
Published: (2024)

Contiguous Allocation of Indivisible Items on a Path
by: Kawase, Yasushi, et al.
Published: (2024)

Merging Mechanisms for Ads and Organic Items in E-commerce Platforms
by: An, Nan, et al.
Published: (2025)