{"list":"other","total":67,"rows":[{"id":"1707.04769","title":"Almost Envy-Freeness with General Valuations","created":"2017-07-15","cited_by_count":22},{"id":"1611.04034","title":"Fair Public Decision Making","created":"2016-11-12","cited_by_count":21},{"id":"2208.08782","title":"Fair Division of Indivisible Goods: Recent Progress and Open Questions","created":"2022-08-18","cited_by_count":21},{"id":"1502.07571","title":"Online Fair Division: analysing a Food Bank problem","created":"2015-02-26","cited_by_count":20},{"id":"2306.14858","title":"Proportional Aggregation of Preferences for Sequential Decision Making","created":"2023-06-26","cited_by_count":17},{"id":"1911.09488","title":"Online Fair Division: A Survey","created":"2019-11-21","cited_by_count":16},{"id":"2008.03564","title":"Online Nash Social Welfare Maximization with Predictions","created":"2020-08-08","cited_by_count":15},{"id":"2002.05119","title":"EFX Exists for Three Agents","created":"2020-02-12","cited_by_count":14},{"id":"2312.04417","title":"Temporal Fairness in Multiwinner Voting","created":"2023-12-07","cited_by_count":14},{"id":"2109.00874","title":"Universal and Tight Online Algorithms for Generalized-Mean Welfare","created":"2021-09-02","cited_by_count":12},{"id":"2102.03311","title":"Online Bin Packing with Predictions","created":"2021-02-05","cited_by_count":11},{"id":"2304.01644","title":"Repeated Fair Allocation of Indivisible Items","created":"2023-04-04","cited_by_count":11},{"id":"2408.13637","title":"Temporal Elections: Welfare, Strategyproofness, and Proportionality","created":"2024-08-24","cited_by_count":11},{"id":"2410.14593","title":"Temporal Fair Division of Indivisible Items","created":"2024-10-18","cited_by_count":11},{"id":"2408.11017","title":"Multiwinner Temporal Voting with Aversion to Change","created":"2024-08-20","cited_by_count":10},{"id":"1907.11672","title":"Fairness-Efficiency Tradeoffs in Dynamic Fair Division","created":"2019-07-26","cited_by_count":9},{"id":"2202.06830","title":"Online Approval Committee Elections","created":"2022-02-14","cited_by_count":9},{"id":"2202.10939","title":"Single-Leg Revenue Management with Advice","created":"2022-02-18","cited_by_count":9},{"id":"2207.04983","title":"Better Collective Decisions via Uncertainty Reduction","created":"2022-07-11","cited_by_count":9},{"id":"2209.15305","title":"Proportionally Fair Online Allocation of Public Goods with Predictions","created":"2022-09-30","cited_by_count":9},{"id":"2502.05949","title":"Verifying Proportionality in Temporal Voting","created":"2025-02-09","cited_by_count":9},{"id":"2505.22513","title":"Strengthening Proportionality in Temporal Voting","created":"2025-05-28","cited_by_count":9},{"id":"1703.01851","title":"Approximation Algorithms for Maximin Fair Division","created":"2017-03-06","cited_by_count":8},{"id":"1709.02564","title":"Democratic Fair Allocation of Indivisible Goods","created":"2017-09-08","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":"2207.01589","title":"Repeatedly Matching Items to Agents Fairly and Efficiently","created":"2022-07-04","cited_by_count":8},{"id":"2311.09068","title":"Learning Fair Division from Bandit Feedback","created":"2023-11-15","cited_by_count":8},{"id":"2410.23416","title":"Temporal Fair Division","created":"2024-10-30","cited_by_count":8},{"id":"1806.03114","title":"Comparing Approximate Relaxations of Envy-Freeness","created":"2018-06-08","cited_by_count":7},{"id":"1909.10502","title":"Weighted Envy-Freeness in Indivisible Item Allocation","created":"2019-09-23","cited_by_count":7},{"id":"2009.12405","title":"Fair and Efficient Online Allocations with Normalized Valuations","created":"2020-09-25","cited_by_count":7},{"id":"2201.06021","title":"Rawlsian Fairness in Online Bipartite Matching: Two-sided, Group, and Individual","created":"2022-01-16","cited_by_count":7},{"id":"2302.01827","title":"Online Ad Allocation with Predictions","created":"2023-02-03","cited_by_count":7},{"id":"2306.12282","title":"Online Resource Allocation with Convex-set Machine-Learned Advice","created":"2023-06-21","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":"2407.01795","title":"Honor Among Bandits: No-Regret Learning for Online Fair Division","created":"2024-07-01","cited_by_count":7},{"id":"1909.00740","title":"A polynomial-time algorithm for computing a Pareto optimal and almost proportional allocation","created":"2019-09-02","cited_by_count":6},{"id":"2204.03803","title":"On Maximum Weighted Nash Welfare for Binary Valuations","created":"2022-04-08","cited_by_count":6},{"id":"2209.04058","title":"Strategyproof Scheduling with Predictions","created":"2022-09-08","cited_by_count":6},{"id":"2005.00504","title":"Uniform Welfare Guarantees Under Identical Subadditive Valuations","created":"2020-05-01","cited_by_count":5},{"id":"2012.03979","title":"Computing Welfare-Maximizing Fair Allocations of Indivisible Goods","created":"2020-12-07","cited_by_count":5},{"id":"2203.03751","title":"Class Fairness in Online Matching","created":"2022-03-07","cited_by_count":5},{"id":"2302.06958","title":"For One and All: Individual and Group Fairness in the Allocation of Indivisible Goods","created":"2023-02-14","cited_by_count":5},{"id":"2304.13405","title":"Multi-agent Online Scheduling: MMS Allocations for Indivisible Items","created":"2023-04-26","cited_by_count":5},{"id":"2103.04304","title":"Fair-Share Allocations for Agents with Arbitrary Entitlements","created":"2021-03-07","cited_by_count":4},{"id":"2112.04166","title":"Weighted Fairness Notions for Indivisible Items Revisited","created":"2021-12-08","cited_by_count":4},{"id":"2211.03077","title":"Online Nash Welfare Maximization Without Predictions","created":"2022-11-06","cited_by_count":4},{"id":"2303.14454","title":"Weighted Fair Division with Matroid-Rank Valuations: Monotonicity and Strategyproofness","created":"2023-03-25","cited_by_count":4},{"id":"2305.18861","title":"A General Framework for Learning-Augmented Online Allocation","created":"2023-05-30","cited_by_count":4},{"id":"2408.12845","title":"Keep Everyone Happy: Online Fair Division of Numerous Items with Few Copies","created":"2024-08-23","cited_by_count":4},{"id":"1703.01649","title":"Fair Allocation of Indivisible Goods to Asymmetric Agents","created":"2017-03-05","cited_by_count":3},{"id":"2206.01710","title":"New Fairness Concepts for Allocating Indivisible Items","created":"2022-06-03","cited_by_count":3},{"id":"2209.06437","title":"Weighted Envy-Freeness for Submodular Valuations","created":"2022-09-14","cited_by_count":3},{"id":"2303.12444","title":"On Fair Allocation of Indivisible Goods to Submodular Agents","created":"2023-03-22","cited_by_count":3},{"id":"2305.18024","title":"The Leximin Approach for a Sequence of Collective Decisions","created":"2023-05-29","cited_by_count":3},{"id":"2402.13530","title":"Best of Many in Both Worlds: Online Resource Allocation with Predictions under Unknown Arrival Model","created":"2024-02-21","cited_by_count":3},{"id":"2406.07024","title":"Plant-and-Steal: Truthful Fair Allocations via Predictions","created":"2024-06-11","cited_by_count":3},{"id":"2501.07022","title":"Improved Regret Bounds for Online Fair Division with Bandit Learning","created":"2025-01-13","cited_by_count":3},{"id":"2504.03951","title":"Understanding EFX Allocations: Counting and Variants","created":"2025-04-04","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":"2005.08614","title":"Semi-online Scheduling: A Survey","created":"2020-05-18","cited_by_count":2},{"id":"2205.07519","title":"Fair Shares: Feasibility, Domination and Incentives","created":"2022-05-16","cited_by_count":2},{"id":"2306.16965","title":"Online Coalition Formation under Random Arrival or Coalition Dissolution","created":"2023-06-29","cited_by_count":2},{"id":"1912.04867","title":"Robust Market Equilibria with Uncertain Preferences","created":"2019-12-10","cited_by_count":1},{"id":"2112.04227","title":"Online Elicitation of Necessarily Optimal Matchings","created":"2021-12-08","cited_by_count":1},{"id":"2210.05237","title":"Fair and Efficient Multi-Resource Allocation for Cloud Computing","created":"2022-10-11","cited_by_count":1},{"id":"2312.09119","title":"Stability in Online Coalition Formation","created":"2023-12-14","cited_by_count":1}],"next_cursor":null}