Cover Image

Approximate Envy-Free Allocations up to any $k$ Goods

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Filos-Ratsikas, Aris, Kalantzis, Georgios, Wang, Fangxiao
Format:	Preprint
Published:	2026
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

Approximate-EFX Allocations with Ordinal and Limited Cardinal Information
by: Filos-Ratsikas, Aris, et al.
Published: (2026)

The Distortion of Stable Matching
by: Filos-Ratsikas, Aris, et al.
Published: (2026)

Proportionality Degree in Participatory Budgeting
by: Filos-Ratsikas, Aris, et al.
Published: (2026)

Utilitarian Distortion with Predictions
by: Filos-Ratsikas, Aris, et al.
Published: (2025)

Pushing the Frontier on Approximate EFX Allocations
by: Amanatidis, Georgios, et al.
Published: (2024)

A Theoretical Approach to Stablecoin Design via Price Windows
by: Molinet, Katherine, et al.
Published: (2026)

On the Potential and Limitations of Proxy Voting: Delegation with Incomplete Votes
by: Amanatidis, Georgios, et al.
Published: (2023)

Truthful Interval Covering
by: Deligkas, Argyrios, et al.
Published: (2023)

On the Computation of Equilibria in Discrete First-Price Auctions
by: Filos-Ratsikas, Aris, et al.
Published: (2024)

Equilibrium Computation in First-Price Auctions with Correlated Priors
by: Filos-Ratsikas, Aris, et al.
Published: (2025)

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

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

Optimal Metric Distortion for Matching on the Line
by: Filos-Ratsikas, Aris, et al.
Published: (2025)

Efficient Equilibrium Computation in Symmetric First-Price Auctions
by: Filos-Ratsikas, Aris, et al.
Published: (2026)

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

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

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

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

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

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

Constant Weighted Maximin Share Approximations for Chores
by: Li, Bo, et al.
Published: (2025)

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

Selling an Item Among a Strategic Bidder and a Profiled Agent
by: Caragiannis, Ioannis, et al.
Published: (2025)

Randomized learning-augmented auctions with revenue guarantees
by: Caragiannis, Ioannis, et al.
Published: (2024)

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

Weighted Envy-Freeness in House Allocation
by: Dai, Sijia, et al.
Published: (2024)

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

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

Envy Cycle Elimination with Strategic Agents: Best Responses and Fairness Guarantees
by: Amanatidis, Georgios, et al.
Published: (2026)

How to Resolve Envy by Adding Goods
by: Bentert, Matthias, et al.
Published: (2025)

Hardness of Approximate Sperner and Applications to Envy-Free Cake Cutting
by: Gao, Ruiquan, et al.
Published: (2024)

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

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

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

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

Dynamic Allocation of Public Goods with Approximate Core Equilibria
by: Onyeze, Chido, et al.
Published: (2025)

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

Envy-Free Cake-Cutting for Four Agents
by: Hollender, Alexandros, et al.
Published: (2023)

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

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