Cover Image

Approximately Envy-free and Equitable Allocations of Indivisible Items for Non-monotone Valuations

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Bilò, Vittorio, Loebl, Martin, Vinci, Cosimo
Format:	Preprint
Published:	2025
Subjects:	Computer Science and Game Theory Discrete Mathematics Data Structures and Algorithms
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Non-Exclusive Notifications for Ride-Hailing at Lyft I: Single-Cycle Approximation Algorithms
by: Ekbatani, Farbod, et al.
Published: (2026)

Computing Approximately Proportional Allocations of Indivisible Goods: Beyond Additive and Monotone Valuations
by: Andersen, Martin Jupakkal, et al.
Published: (2025)

Approximately Dominating Sets in Elections
by: Charikar, Moses, et al.
Published: (2025)

Distortion of Metric Voting with Bounded Randomness
by: Cai, Ziyi, et al.
Published: (2026)

Monotone Randomized Apportionment
by: Correa, José, et al.
Published: (2024)

Some variations of the secretary problem
by: Agrawal, Sarthak, et al.
Published: (2026)

Unbalanced Random Matching Markets with Partial Preferences
by: Potukuchi, Aditya, et al.
Published: (2024)

Fair Allocation with Binary Valuations for Mixed Divisible and Indivisible Goods
by: Kawase, Yasushi, et al.
Published: (2023)

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

Primal-Dual Algorithms with Predictions for Online Bounded Allocation and Ad-Auctions Problems
by: Kevi, Eniko, et al.
Published: (2024)

A Unified Model of Congestion Games with Priorities: Two-Sided Markets with Ties, Finite and Non-Affine Delay Functions, and Pure Nash Equilibria
by: Takazawa, Kenjiro
Published: (2024)

A Simple 1.5-Approximation Algorithm for a Wide Range of Max-SMTI Problems
by: Csáji, Gergely
Published: (2023)

Six Candidates Suffice to Win a Voter Majority
by: Charikar, Moses, et al.
Published: (2024)

The Popular Dimension of Matchings
by: Connor, Frank, et al.
Published: (2025)

Stationary Online Contention Resolution Schemes
by: Aminian, Mohammad Reza, et al.
Published: (2026)

Breaking the Metric Voting Distortion Barrier
by: Charikar, Moses, et al.
Published: (2023)

Generalized Nash Equilibrium Problems with Mixed-Integer Variables
by: Harks, Tobias, et al.
Published: (2021)

Extending Stable and Popular Matching Algorithms from Bipartite to Arbitrary Instances
by: Csáji, Gergely
Published: (2024)

Combinatorial Bernoulli Factories
by: Niazadeh, Rad, et al.
Published: (2020)

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

Position Fair Mechanisms Allocating Indivisible Goods
by: Mahara, Ryoga, et al.
Published: (2024)

The Landscape of Almost Equitable Allocations
by: Hosseini, Hadi, et al.
Published: (2025)

Weighted Proportional Allocations of Indivisible Goods and Chores: Insights via Matchings
by: V., Vishwa Prakash H., et al.
Published: (2023)

Best of Both Worlds Guarantees for Equitable Allocations
by: Bhaskar, Umang, et al.
Published: (2025)

Private Interdependent Valuations: New Bounds for Single-Item Auctions and Matroids
by: Eden, Alon, et al.
Published: (2024)

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

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

Constant Approximation for Weighted Nash Social Welfare with Submodular Valuations
by: Feng, Yuda, et al.
Published: (2024)

Envy-freeness in 3D Hedonic Games
by: McKay, Michael, et al.
Published: (2022)

A Note on Approximating Weighted Nash Social Welfare with Additive Valuations
by: Feng, Yuda, et al.
Published: (2024)

Nash Social Welfare with Submodular Valuations: Approximation Algorithms and Integrality Gaps
by: Bei, Xiaohui, et al.
Published: (2025)

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

The Secretary Problem with Predictions and a Chosen Order
by: Karisani, Helia, et al.
Published: (2026)

Envy-Free School Redistricting Between Two Groups
by: Shibatani, Daisuke, et al.
Published: (2026)

Online Envy Minimization and Multicolor Discrepancy: Equivalences and Separations
by: Halpern, Daniel, et al.
Published: (2025)

An Approximation Algorithm for Monotone Submodular Cost Allocation
by: Mizutani, Ryuhei
Published: (2025)

Beyond Exact Fairness: Envy-Free Incomplete Connected Fair Division
by: S, Ajaykrishnan E, et al.
Published: (2025)

An FPTAS for 7/9-Approximation to Maximin Share Allocations
by: Huang, Xin, et al.
Published: (2025)

Computational Complexity of Envy-free and Exchange-stable Seat Arrangement Problems on Grid Graphs
by: Kawase, Sota, et al.
Published: (2024)

Equitable Colorings of Vertex-Weighted Graphs
by: Barman, Siddharth, et al.
Published: (2026)