{"list":"other","total":62,"rows":[{"id":"1707.04769","title":"Almost Envy-Freeness with General Valuations","created":"2017-07-15","cited_by_count":22},{"id":"2208.08782","title":"Fair Division of Indivisible Goods: Recent Progress and Open Questions","created":"2022-08-18","cited_by_count":21},{"id":"2002.05119","title":"EFX Exists for Three Agents","created":"2020-02-12","cited_by_count":14},{"id":"2001.09838","title":"Maximum Nash Welfare and Other Stories About EFX","created":"2020-01-27","cited_by_count":13},{"id":"2002.10704","title":"Fair and Truthful Mechanisms for Dichotomous Valuations","created":"2020-02-25","cited_by_count":13},{"id":"1907.04596","title":"A Little Charity Guarantees Almost Envy-Freeness","created":"2019-07-10","cited_by_count":12},{"id":"2007.06073","title":"Fair Division with Binary Valuations: One Rule to Rule Them All","created":"2020-07-12","cited_by_count":11},{"id":"1704.00222","title":"Fair Allocation of Indivisible Goods: Improvement and Generalization","created":"2017-04-01","cited_by_count":10},{"id":"1902.04319","title":"Envy-freeness up to any item with high Nash welfare: The virtue of donating items","created":"2019-02-12","cited_by_count":10},{"id":"1503.00941","title":"Approximation Algorithms for Computing Maximin Share Allocations","created":"2015-03-03","cited_by_count":9},{"id":"1903.00029","title":"An Improved Approximation Algorithm for Maximin Shares","created":"2019-02-28","cited_by_count":9},{"id":"1703.01851","title":"Approximation Algorithms for Maximin Fair Division","created":"2017-03-06","cited_by_count":8},{"id":"1905.04910","title":"The Price of Fairness for Indivisible Goods","created":"2019-05-13","cited_by_count":8},{"id":"1909.07650","title":"Multiple Birds with One Stone: Beating $1/2$ for EFX and GMMS via Envy Cycle Elimination","created":"2019-09-17","cited_by_count":8},{"id":"1806.03114","title":"Comparing Approximate Relaxations of Envy-Freeness","created":"2018-06-08","cited_by_count":7},{"id":"2307.07304","title":"Breaking the $3/4$ Barrier for Approximate Maximin Share","created":"2023-07-14","cited_by_count":7},{"id":"2310.03475","title":"Fair Division with Allocator's Preference","created":"2023-10-05","cited_by_count":7},{"id":"1711.07621","title":"Groupwise Maximin Fair Allocation of Indivisible Goods","created":"2017-11-21","cited_by_count":6},{"id":"2103.01628","title":"Improving EFX Guarantees through Rainbow Cycle Number","created":"2021-03-02","cited_by_count":6},{"id":"2003.07060","title":"Finding Fair and Efficient Allocations When Valuations Don't Add Up","created":"2020-03-16","cited_by_count":5},{"id":"2104.04977","title":"A tight negative example for MMS fair allocations","created":"2021-04-11","cited_by_count":5},{"id":"2107.08965","title":"Maximizing Nash Social Welfare in 2-Value Instances","created":"2021-07-19","cited_by_count":5},{"id":"2012.12710","title":"Existence and Computation of Maximin Fair Allocations Under Matroid-Rank Valuations","created":"2020-12-23","cited_by_count":4},{"id":"2205.14296","title":"Approximability Landscape of Welfare Maximization within Fair Allocations","created":"2022-05-28","cited_by_count":4},{"id":"2211.00879","title":"Fair Allocation of Two Types of Chores","created":"2022-11-02","cited_by_count":4},{"id":"2406.12413","title":"Pushing the Frontier on Approximate EFX Allocations","created":"2024-06-18","cited_by_count":4},{"id":"2008.08798","title":"Existence of EFX for Two Additive Valuations","created":"2020-08-20","cited_by_count":3},{"id":"2109.07313","title":"Approximately EFX Allocations for Indivisible Chores","created":"2021-09-15","cited_by_count":3},{"id":"2110.11285","title":"How to Fairly Allocate Easy and Difficult Chores","created":"2021-10-21","cited_by_count":3},{"id":"2206.01710","title":"New Fairness Concepts for Allocating Indivisible Items","created":"2022-06-03","cited_by_count":3},{"id":"2212.09482","title":"Rainbow Cycle Number and EFX Allocations: (Almost) Closing the Gap","created":"2022-12-19","cited_by_count":3},{"id":"2303.16788","title":"Simplification and Improvement of MMS Approximation","created":"2023-03-29","cited_by_count":3},{"id":"2304.03706","title":"Breaking the Envy Cycle: Best-of-Both-Worlds Guarantees for Subadditive Valuations","created":"2023-04-07","cited_by_count":3},{"id":"2308.04860","title":"Improved EFX Approximation Guarantees under Ordinal-based Assumptions","created":"2023-08-09","cited_by_count":3},{"id":"2308.05503","title":"EFX Allocations Exist for Binary Valuations","created":"2023-08-10","cited_by_count":3},{"id":"2401.01516","title":"A Complete Landscape for the Price of Envy-Freeness","created":"2024-01-03","cited_by_count":3},{"id":"2406.10752","title":"On The Pursuit of EFX for Chores: Non-Existence and Approximations","created":"2024-06-15","cited_by_count":3},{"id":"2407.12461","title":"Compatibility of Fairness and Nash Welfare under Subadditive Valuations","created":"2024-07-17","cited_by_count":3},{"id":"2410.13580","title":"EFX Exists for Three Types of Agents","created":"2024-10-17","cited_by_count":3},{"id":"2505.22174","title":"Online Fair Division for Personalized $2$-Value Instances","created":"2025-05-28","cited_by_count":3},{"id":"1912.02797","title":"One Dollar Each Eliminates Envy","created":"2019-12-05","cited_by_count":2},{"id":"2106.02656","title":"Approximating Nash Social Welfare under Binary XOS and Binary Subadditive Valuations","created":"2021-06-04","cited_by_count":2},{"id":"2302.09633","title":"On Optimal Tradeoffs between EFX and Nash Welfare","created":"2023-02-19","cited_by_count":2},{"id":"2302.11530","title":"Fair Chore Division under Binary Supermodular Costs","created":"2023-02-22","cited_by_count":2},{"id":"2305.04168","title":"EFX Allocations for Indivisible Chores: Matching-Based Approach","created":"2023-05-07","cited_by_count":2},{"id":"2401.14825","title":"Keeping the Harmony Between Neighbors: Local Fairness in Graph Fair Division","created":"2024-01-26","cited_by_count":2},{"id":"2410.06877","title":"Best-of-Both-Worlds Fair Allocation of Indivisible and Mixed Goods","created":"2024-10-09","cited_by_count":2},{"id":"2502.02815","title":"Exploring Relations among Fairness Notions in Discrete Fair Division","created":"2025-02-05","cited_by_count":2},{"id":"2506.20317","title":"Exact and approximate maximin share allocations in multi-graphs","created":"2025-06-25","cited_by_count":2},{"id":"2002.02789","title":"Computing envy-freeable allocations with limited subsidies","created":"2020-02-06","cited_by_count":1},{"id":"2005.11796","title":"Walrasian Equilibria in Markets with Small Demands","created":"2020-05-24","cited_by_count":1},{"id":"2101.07435","title":"Fairness Criteria for Allocating Indivisible Chores: Connections and Efficiencies","created":"2021-01-19","cited_by_count":1},{"id":"2103.11849","title":"Almost (Weighted) Proportional Allocations for Indivisible Chores","created":"2021-03-22","cited_by_count":1},{"id":"2201.07419","title":"Achieving Envy-Freeness with Limited Subsidies under Dichotomous Valuations","created":"2022-01-19","cited_by_count":1},{"id":"2211.03883","title":"Approximating Nash Social Welfare by Matching and Local Search","created":"2022-11-07","cited_by_count":1},{"id":"2212.02440","title":"New Algorithms for the Fair and Efficient Allocation of Indivisible Chores","created":"2022-12-05","cited_by_count":1},{"id":"2312.13791","title":"Parameterized Guarantees for Almost Envy-Free Allocations","created":"2023-12-21","cited_by_count":1},{"id":"2405.14463","title":"Epistemic EFX Allocations Exist for Monotone Valuations","created":"2024-05-23","cited_by_count":1},{"id":"2407.03318","title":"Constant-Factor EFX Exists for Chores","created":"2024-07-03","cited_by_count":1},{"id":"2410.18655","title":"Approximate EFX and Exact tEFX Allocations for Indivisible Chores: Improved Algorithms","created":"2024-10-24","cited_by_count":1},{"id":"2412.08572","title":"Proportionally Fair Makespan Approximation","created":"2024-12-11","cited_by_count":1},{"id":"2502.09377","title":"Fair Division via Resource Augmentation","created":"2025-02-13","cited_by_count":1}],"next_cursor":null}