Cover Image

Weighted Envy-Freeness in House Allocation

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Dai, Sijia, Chen, Yankai, Wu, Xiaowei, Xu, Yicheng, Zhang, Yong
Format:	Preprint
Published:	2024
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

Weighted Envy-Freeness Revisited: Indivisible Resource and House Allocations
by: Liu, Yuxi, et al.
Published: (2025)

Weighted Envy-Freeness for Submodular Valuations
by: Montanari, Luisa, et al.
Published: (2022)

Weighted Envy Freeness With Bounded Subsidies
by: Elmalem, Noga Klein, et al.
Published: (2024)

Centralized Group Equitability and Individual Envy-Freeness in the Allocation of Indivisible Items
by: Wang, Ying, et al.
Published: (2025)

A Complete Landscape for the Price of Envy-Freeness
by: Li, Zihao, et al.
Published: (2024)

The Cost and Complexity of Minimizing Envy in House Allocation
by: Madathil, Jayakrishnan, et al.
Published: (2024)

Decomposition Envy-Freeness in Random Assignment
by: Kawase, Yasushi, et al.
Published: (2026)

Envy-Free House Allocation with Minimum Subsidy
by: Choo, Davin, et al.
Published: (2024)

Weighted Envy-free Allocation with Subsidy
by: Aziz, Haris, et al.
Published: (2024)

Approximate Envy-Freeness in Graphical Cake Cutting
by: Yuen, Sheung Man, et al.
Published: (2023)

Almost Envy-Freeness under Weakly Lexicographic Preferences
by: Hosseini, Hadi, et al.
Published: (2024)

On Hierarchies of Fairness Notions in Cake Cutting: From Proportionality to Super Envy-Freeness
by: Mehra, Arnav, et al.
Published: (2025)

Cardinal-Utility Matching Markets: The Quest for Envy-Freeness, Pareto-Optimality, and Efficient Computability
by: Tröbst, Thorben, et al.
Published: (2024)

Minimum Envy Graphical House Allocation Beyond Identical Valuations
by: Inamdar, Tanmay, et al.
Published: (2026)

Tree Splitting Based Rounding Scheme for Weighted Proportional Allocations with Subsidy
by: Wu, Xiaowei, et al.
Published: (2024)

Envy-Free and Efficient Allocations for Graphical Valuations
by: Misra, Neeldhara, et al.
Published: (2024)

Whoever Said Money Won't Solve All Your Problems? Weighted Envy-free Allocation with Subsidy
by: Elmalem, Noga Klein, et al.
Published: (2025)

Approximate Envy-Free Allocations up to any $k$ Goods
by: Filos-Ratsikas, Aris, et al.
Published: (2026)

Introspectively Envy-Free and Efficient Allocation of Indivisible Mixed Manna
by: Barman, Siddharth, et al.
Published: (2025)

Computing Efficient Envy-Free Partial Allocations of Indivisible Goods
by: Bredereck, Robert, et al.
Published: (2025)

Truthful and Almost Envy-Free Mechanism of Allocating Indivisible Goods: the Power of Randomness
by: Bu, Xiaolin, et al.
Published: (2024)

Almost Envy-free Allocation of Indivisible Goods: A Tale of Two Valuations
by: Kaviani, Alireza, et al.
Published: (2024)

On Interim Envy-Free Allocation Lotteries
by: Caragiannis, Ioannis, et al.
Published: (2021)

Computing Envy-Free up to Any Good (EFX) Allocations via Local Search
by: Brânzei, Simina
Published: (2025)

Online Fair Division With Subsidy: When Do Envy-Free Allocations Exist, and at What Cost?
by: Kulkarni, Pooja, et al.
Published: (2025)

Proportional and Pareto-Optimal Allocation of Chores with Subsidy
by: Garg, Jugal, et al.
Published: (2025)

Approximately EFX and PO Allocations for Bivalued Chores
by: Lin, Zehan, et al.
Published: (2025)

Fair Societies: Algorithms for House Allocations
by: Hosseini, Hadi, et al.
Published: (2025)

Envy-Free Allocation of Indivisible Goods via Noisy Queries
by: Li, Zihan, et al.
Published: (2026)

Guaranteeing MMS for All but One Agent When Allocating Indivisible Chores
by: Qiu, Jiawei, et al.
Published: (2024)

On the Subsidy of Envy-Free Orientations in Graphs
by: Li, Bo, et al.
Published: (2025)

Optimizing the Envy Cycle Elimination Algorithm
by: Celine, Karen Frilya, et al.
Published: (2026)

Allocating Chores with Restricted Additive Costs: Achieving EFX, MMS, and Efficiency Simultaneously
by: Lin, Zehan, et al.
Published: (2026)

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

Envy-Free and Pareto-Optimal Allocations for Agents with Asymmetric Random Valuations
by: Bai, Yushi, et al.
Published: (2021)

Simultaneous Ordinal Maximin Share and Envy-Based Guarantees
by: Akrami, Hannaneh, et al.
Published: (2026)

Learning-Augmented Facility Location Mechanisms for Envy Ratio
by: Aziz, Haris, et al.
Published: (2025)

When is Truthfully Allocating Chores no Harder than Goods?
by: Li, Bo, et al.
Published: (2025)

Swap Bounded Envy
by: Echenique, Federico, et al.
Published: (2025)

Best-of-Both-Worlds Fairness of the Envy-Cycle-Elimination Algorithm
by: Garg, Jugal, et al.
Published: (2024)