On the public citation graph
Fair Allocation of Indivisible Goods
0 signed · 142 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/978-3-642-17572-5_20openalex-snapshot
Constrained Non-monotone Submodular Maximization: Offline and Secretary Algorithms
inferredcites →https://doi.org/10.1007/bfb0006528openalex-snapshot
Accelerated greedy algorithms for maximizing submodular set functions
inferredcites →https://doi.org/10.1007/s10107-013-0706-4openalex-snapshot
An efficient polynomial time approximation scheme for load balancing on uniformly related machines
inferredcites →https://doi.org/10.1007/s10458-015-9287-3openalex-snapshot
Characterizing conflicts in fair division of indivisible goods using a scale of criteria
inferredcites →https://doi.org/10.1016/j.geb.2017.10.016openalex-snapshot
Gross substitutability: An algorithmic survey
inferredcites →https://doi.org/10.1016/s0167-5060(05)x8001-3openalex-snapshot
Submodular Functions and Optimization
inferredcites →https://doi.org/10.1016/s0167-5060(08)x7004-9openalex-snapshot
Submodular Functions and Optimization
inferredcites →https://doi.org/10.1080/00029890.1961.11989615openalex-snapshot
How to Cut A Cake Fairly
inferredcites →https://doi.org/10.1080/00029890.1995.11990526openalex-snapshot
An Envy-Free Cake Division Protocol
inferredcites →https://doi.org/10.1086/664613openalex-snapshot
The Combinatorial Assignment Problem: Approximate Competitive Equilibrium from Equal Incomes
inferredcites →https://doi.org/10.1109/focs.2006.14openalex-snapshot
Approximation algorithms for allocation problems: Improving the factor of 1 - 1/e
inferredcites →https://doi.org/10.1109/focs.2007.40openalex-snapshot
Inapproximability Results for Sparsest Cut, Optimal Linear Arrangement, and Precedence Constrained Scheduling
inferredcites →https://doi.org/10.1109/focs.2012.73openalex-snapshot
A Tight Linear Time (1/2)-Approximation for Unconstrained Submodular Maximization
inferredcites →https://doi.org/10.1109/focs.2016.52openalex-snapshot
A Discrete and Bounded Envy-Free Cake Cutting Protocol for Any Number of Agents
inferredcites →https://doi.org/10.1109/iccv.2011.6126239openalex-snapshot
Distributed cosegmentation via submodular optimization on anisotropic diffusion
inferredcites →https://doi.org/10.1137/070680977openalex-snapshot
On Maximizing Welfare When Utility Functions Are Subadditive
inferredcites →https://doi.org/10.1137/1.9781611975031.147openalex-snapshot
Nash Social Welfare for Indivisible Items under Separable, Piecewise-Linear Concave Utilities
inferredcites →https://doi.org/10.1137/1.9781611975031.164openalex-snapshot
Envy-free Chore Division for An Arbitrary Number of Agents
inferredcites →https://doi.org/10.1145/1060590.1060681openalex-snapshot
Approximation algorithms for combinatorial auctions with complement-free bidders
inferredcites →https://doi.org/10.1145/1250790.1250808openalex-snapshot
An approximation algorithm for max-min fair allocation of indivisible goods
inferredcites →https://doi.org/10.1145/1374376.1374389openalex-snapshot
Optimal approximation for the submodular welfare problem in the value oracle model
inferredcites →https://doi.org/10.1145/1536414.1536459openalex-snapshot
Non-monotone submodular maximization under matroid and knapsack constraints
inferredcites →https://doi.org/10.1145/2500121openalex-snapshot
Submodular secretary problem and extensions
inferredcites →https://doi.org/10.1145/2897518.2897522openalex-snapshot
A discrete and bounded envy-free cake cutting protocol for four agents
inferredcites →https://doi.org/10.1145/2940716.2940726openalex-snapshot
The Unreasonable Fairness of Maximum Nash Welfare
inferredcites →https://doi.org/10.1145/3033274.3085109openalex-snapshot
Convex Program Duality, Fisher Markets, and Nash Social Welfare
inferredcites →https://doi.org/10.1145/3033274.3085136openalex-snapshot
Approximation Algorithms for Maximin Fair Division
inferredcites →https://doi.org/10.1145/3033274.3085147openalex-snapshot
Truthful Allocation Mechanisms Without Payments
inferredcites →https://doi.org/10.1145/3147173openalex-snapshot
Approximation Algorithms for Computing Maximin Share Allocations
inferredcites →https://doi.org/10.1145/3219166.3219176openalex-snapshot
Finding Fair and Efficient Allocations
inferredcites →https://doi.org/10.1145/988772.988792openalex-snapshot
On approximately fair allocations of indivisible goods
inferredcites →https://doi.org/10.1184/r1/6607142openalex-snapshot
Max-min fair allocation of indivisible goods
inferredcites →https://doi.org/10.1609/aaai.v30i1.10041openalex-snapshot
When Can the Maximin Share Guarantee Be Guaranteed?
inferredcites →https://doi.org/10.1609/aaai.v31i1.10582openalex-snapshot
Algorithms for Max-Min Share Fair Allocation of Indivisible Chores
inferredcites →https://doi.org/10.2307/1914288openalex-snapshot
Consistent Estimates Based on Partially Consistent Observations
inferredcites →https://doi.org/10.48550/arxiv.1604.01435openalex-snapshot
Approximation Algorithms for Max-Min Share Allocations of Indivisible Chores and Goods
inferredcites →https://doi.org/10.48550/arxiv.1605.04026openalex-snapshot
On Truthful Mechanisms for Maximin Share Allocations
inferredcites →https://doi.org/10.48550/arxiv.1704.00222openalex-snapshot
Fair Allocation of Indivisible Goods: Improvement and Generalization
inferredcites →https://doi.org/10.48550/arxiv.1705.10706openalex-snapshot
Truthful Allocation Mechanisms Without Payments: Characterization and Implications on Fairness
inferredcites →https://doi.org/10.5555/2615731.2617458openalex-snapshot
Characterizing conflicts in fair division of indivisible goods using a scale of criteria
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.2139/ssrn.3512113openalex-extracted
On the Optimal Rearrangement of Multiple Matrices
inferred← citeshttps://doi.org/10.1007/978-3-030-04612-5_20openalex-snapshot
The Fair Division of Hereditary Set Systems
inferred← citeshttps://doi.org/10.1007/978-3-030-04651-4_39openalex-snapshot
Rent Division Among Groups
inferred← citeshttps://doi.org/10.1007/978-3-030-57980-7_3openalex-snapshot
Finding Fair and Efficient Allocations When Valuations Don’t Add Up
inferred← citeshttps://doi.org/10.1007/978-3-030-64946-3_25openalex-snapshot
Optimal Bounds on the Price of Fairness for Indivisible Goods
inferred← citeshttps://doi.org/10.1007/978-3-030-81945-3_7openalex-snapshot
Market Equilibrium Models in Large-Scale Internet Markets
inferred← citeshttps://doi.org/10.1007/978-3-030-85947-3_25openalex-snapshot
Two Birds with One Stone: Fairness and Welfare via Transfers
inferred← citeshttps://doi.org/10.1007/978-3-030-94676-0_20openalex-snapshot
A Tight Negative Example for MMS Fair Allocations
inferred← citeshttps://doi.org/10.1007/978-3-030-94676-0_21openalex-snapshot
Approximating Nash Social Welfare Under Binary XOS and Binary Subadditive Valuations
inferred← citeshttps://doi.org/10.1007/978-3-030-94676-0_9openalex-snapshot
Allocating Indivisible Goods to Strategic Agents: Pure Nash Equilibria and Fairness
inferred← citeshttps://doi.org/10.1007/978-3-031-20614-6_11openalex-snapshot
Maximin Shares Under Cardinality Constraints
inferred← citeshttps://doi.org/10.1007/978-3-031-20862-1_1openalex-snapshot
Fair Allocation with Special Externalities
inferred← citeshttps://doi.org/10.1007/978-3-031-22832-2_14openalex-snapshot
On Best-of-Both-Worlds Fair-Share Allocations
inferred← citeshttps://doi.org/10.1007/978-3-031-43254-5_13openalex-snapshot
Maximin Fair Allocation of Indivisible Items Under Cost Utilities
inferred← citeshttps://doi.org/10.1007/978-3-031-45558-2_3openalex-snapshot
A Logical Description of Priority Separable Games
inferred← citeshttps://doi.org/10.1007/978-3-031-48974-7_13openalex-snapshot
Dividing Good and Great Items Among Agents with Bivalued Submodular Valuations
inferred← citeshttps://doi.org/10.1007/978-3-032-08560-3_15openalex-snapshot
Almost Envy-Free Allocation of Indivisible Goods: A Tale of Two Valuations
inferred← citeshttps://doi.org/10.1007/978-981-95-0215-8_22openalex-snapshot
Fair and Efficient Graphical Resource Allocation with Matching-Induced Utilities
inferred← citeshttps://doi.org/10.1007/978-981-99-7184-8_7openalex-snapshot
The Theory of Fair Allocation Under Structured Set Constraints
inferred← citeshttps://doi.org/10.1007/s00224-021-10039-8openalex-snapshot
The Price of Fairness for Indivisible Goods
inferred← citeshttps://doi.org/10.1007/s00224-024-10210-xopenalex-snapshot
One-Sided Markets with Externalities
inferred← citeshttps://doi.org/10.1007/s00355-020-01278-8openalex-snapshot
Maximin share guarantee for goods with positive externalities
inferred← citeshttps://doi.org/10.1007/s10107-022-01855-yopenalex-snapshot
Approximate and strategyproof maximin share allocation of chores with ordinal preferences
inferred← citeshttps://doi.org/10.1007/s10458-021-09532-8openalex-snapshot
Fair allocation of indivisible goods and chores
inferred← citeshttps://doi.org/10.1007/s10458-021-09537-3openalex-snapshot
Fair allocation of conflicting items
inferred← citeshttps://doi.org/10.1007/s10458-023-09618-5openalex-snapshot
Fairness criteria for allocating indivisible chores: connections and efficiencies
inferred← citeshttps://doi.org/10.1007/s10458-026-09731-1openalex-snapshot
Maximin shares under cardinality constraints
inferred← citeshttps://doi.org/10.1007/s11590-024-02145-6openalex-snapshot
The budgeted maximin share allocation problem
inferred← citeshttps://doi.org/10.1016/j.artint.2020.103436openalex-snapshot
Fair division of mixed divisible and indivisible goods
inferred← citeshttps://doi.org/10.1016/j.artint.2021.103547openalex-snapshot
An improved approximation algorithm for maximin shares
inferred← citeshttps://doi.org/10.1016/j.artint.2021.103633openalex-snapshot
Fair allocation of indivisible goods: Beyond additive valuations
inferred← citeshttps://doi.org/10.1016/j.artint.2025.104389openalex-snapshot
Fair distribution of delivery orders
inferred← citeshttps://doi.org/10.1016/j.dam.2023.06.035openalex-snapshot
Existence of EFX for two additive valuations
inferred← citeshttps://doi.org/10.1016/j.ejor.2021.06.020openalex-snapshot
Fair allocation of indivisible goods with minimum inequality or minimum envy
inferred← citeshttps://doi.org/10.1016/j.ins.2021.11.059openalex-snapshot
Envy-free matchings in bipartite graphs and their applications to fair division
inferred← citeshttps://doi.org/10.1016/j.mathsocsci.2017.09.004openalex-snapshot
Approximate maximin shares for groups of agents
inferred← citeshttps://doi.org/10.1016/j.tcs.2020.07.006openalex-snapshot
Multiple birds with one stone: Beating 1/2 for EFX and GMMS via envy cycle elimination
inferred← citeshttps://doi.org/10.1016/j.tcs.2021.02.020openalex-snapshot
Maximum Nash Welfare and Other Stories About EFX
inferred← citeshttps://doi.org/10.1109/acait53529.2021.9731163openalex-snapshot
Minimal-envy Conference Paper Assignment: Formulation and a Fast Iterative Algorithm
inferred← citeshttps://doi.org/10.1109/cscwd64889.2025.11033316openalex-snapshot
Fair Assignment for Agents with Multiple Weights
inferred← citeshttps://doi.org/10.1109/hpcc-dss-smartcity-dependsys57074.2022.00090openalex-snapshot
Fairness-Aware Algorithms for Seed Allocation in Social Advertising
inferred← citeshttps://doi.org/10.1109/icccnt56998.2023.10307520openalex-snapshot
BigBasket Fairness Analysis for Searched Outputs
inferred← citeshttps://doi.org/10.1109/ojcoms.2022.3169969openalex-snapshot
MAGIKS: Fair Multi-Resource Allocation Game Induced by Kalai-Smorodinsky Bargaining Solution
inferred← citeshttps://doi.org/10.1109/tcss.2026.3663360openalex-snapshot
When May We Eliminate Collective Bias? A GRA + Perspectives on Fifty-Fifty Compromise
inferred← citeshttps://doi.org/10.1137/1.9781611975994.162openalex-snapshot
A Little Charity Guarantees Almost Envy-Freeness
inferred← citeshttps://doi.org/10.1137/20m1388310openalex-snapshot
The Price of Connectivity in Fair Division
inferred← citeshttps://doi.org/10.1142/s0129054122460066openalex-snapshot
Restricted Existence and Approximation Algorithms for PMMS
inferred← citeshttps://doi.org/10.1145/3033274.3085136openalex-snapshot
Approximation Algorithms for Maximin Fair Division
inferred← citeshttps://doi.org/10.1145/3328526.3329574openalex-snapshot
Envy-Freeness Up to Any Item with High Nash Welfare
inferred← citeshttps://doi.org/10.1145/3381525openalex-snapshot
Approximation Algorithms for Maximin Fair Division
inferred← citeshttps://doi.org/10.1145/3391403.3399447openalex-snapshot
One Dollar Each Eliminates Envy
inferred← citeshttps://doi.org/10.1145/3434410openalex-snapshot
The Fair Division of Hereditary Set Systems
inferred← citeshttps://doi.org/10.1145/3465416.3483297openalex-snapshot
Preserving Diversity when Partitioning: A Geometric Approach
inferred← citeshttps://doi.org/10.1145/3465456.3467553openalex-snapshot
Indivisible Mixed Manna: On the Computability of MMS+PO Allocations
inferred← citeshttps://doi.org/10.1145/3465456.3467555openalex-snapshot
An Algorithmic Framework for Approximating Maximin Share Allocation of Chores
inferred← citeshttps://doi.org/10.1145/3465456.3467605openalex-snapshot
Improving EFX Guarantees through Rainbow Cycle Number
inferred← citeshttps://doi.org/10.1145/3485006openalex-snapshot
Finding Fair and Efficient Allocations for Matroid Rank Valuations
inferred← citeshttps://doi.org/10.1145/3503624openalex-snapshot
Toward Fair Recommendation in Two-sided Platforms
inferred← citeshttps://doi.org/10.1145/3547333openalex-snapshot
A Survey on the Fairness of Recommender Systems
inferred← citeshttps://doi.org/10.1145/3572885.3572887openalex-snapshot
Algorithmic fair allocation of indivisible items
inferred← citeshttps://doi.org/10.1145/3580507.3597675openalex-snapshot
A General Framework for Fair Allocation under Matroid Rank Valuations
inferred← citeshttps://doi.org/10.1145/3580507.3597783openalex-snapshot
On picking sequences for chores
inferred← citeshttps://doi.org/10.1145/3617694.3623229openalex-snapshot
Average Envy-freeness for Indivisible Items
inferred← citeshttps://doi.org/10.1145/3618116openalex-snapshot
Unified Fair Allocation of Goods and Chores via Copies
inferred← citeshttps://doi.org/10.1145/3618260.3649728openalex-snapshot
Fair Division via Quantile Shares
inferred← citeshttps://doi.org/10.1145/3705328.3748082openalex-snapshot
Leave No One Behind: Fairness-Aware Cross-Domain Recommender Systems for Non-Overlapping Users
inferred← citeshttps://doi.org/10.1145/3717823.3718119openalex-snapshot
Share-Based Fairness for Arbitrary Entitlements
inferred← citeshttps://doi.org/10.1145/3717823.3718305openalex-snapshot
Constant-Factor EFX Exists for Chores
inferred← citeshttps://doi.org/10.1145/3736252.3742613openalex-snapshot
Simultaneously Satisfying MXS and EFL
inferred← citeshttps://doi.org/10.1145/3736252.3742621openalex-snapshot
Beating the Logarithmic Barrier for the Subadditive Maximin Share Problem
inferred← citeshttps://doi.org/10.1145/3744240openalex-snapshot
Causality-Inspired Fair Representation Learning for Multimodal Recommendation
inferred← citeshttps://doi.org/10.1145/3841183openalex-snapshot
SC-VUG: Fairness-Aware Cross-Domain Recommendation for Non-Overlapping Users via Sparsity-Calibrated Virtual User Generation
inferred← citeshttps://doi.org/10.1287/moor.2020.1096openalex-snapshot
Fair Allocation of Indivisible Goods: Improvement
inferred← citeshttps://doi.org/10.1287/moor.2021.0199openalex-snapshot
Fair-Share Allocations for Agents with Arbitrary Entitlements
inferred← citeshttps://doi.org/10.1287/moor.2022.0044openalex-snapshot
Extension of Additive Valuations to General Valuations on the Existence of EFX
inferred← citeshttps://doi.org/10.1287/opre.2022.2279openalex-snapshot
Efficient Fair Division with Minimal Sharing
inferred← citeshttps://doi.org/10.1287/opre.2022.2432openalex-snapshot
Best of Both Worlds: Ex Ante and Ex Post Fairness in Resource Allocation
inferred← citeshttps://doi.org/10.1609/aaai.v35i6.16647openalex-snapshot
Fair and Truthful Mechanisms for Dichotomous Valuations
inferred← citeshttps://doi.org/10.1609/aaai.v35i6.16650openalex-snapshot
Achieving Proportionality up to the Maximin Item with Indivisible Goods
inferred← citeshttps://doi.org/10.1609/aaai.v35i6.16665openalex-snapshot
Fair and Efficient Allocations under Subadditive Valuations
inferred← citeshttps://doi.org/10.1609/aaai.v35i6.16675openalex-snapshot
Almost Envy-freeness, Envy-rank, and Nash Social Welfare Matchings
inferred← citeshttps://doi.org/10.1609/aaai.v35i6.16695openalex-snapshot
On the PTAS for Maximin Shares in an Indivisible Mixed Manna
inferred← citeshttps://doi.org/10.1613/jair.1.13317openalex-snapshot
Ordinal Maximin Share Approximation for Goods
inferred← citeshttps://doi.org/10.24963/ijcai.2021/32openalex-snapshot
Fair and Efficient Resource Allocation with Partial Information
inferred← citeshttps://doi.org/10.24963/ijcai.2021/34openalex-snapshot
Guaranteeing Maximin Shares: Some Agents Left Behind
inferred← citeshttps://doi.org/10.32469/10355/97093openalex-snapshot
Tensor completion methods with provable consistency and fairness guarantees for recommender systems
inferred← citeshttps://doi.org/10.3390/app10082798openalex-snapshot
Fair Task Allocation When Cost of Task Is Multidimensional
inferred← citeshttps://doi.org/10.48550/arxiv.1807.10684openalex-snapshot
Fair allocation of combinations of indivisible goods and chores
inferred← citeshttps://doi.org/10.48550/arxiv.1902.04319openalex-snapshot
Envy-freeness up to any item with high Nash welfare: The virtue of donating items
inferred← citeshttps://doi.org/10.48550/arxiv.1903.00029openalex-snapshot
An Improved Approximation Algorithm for Maximin Shares
inferred← citeshttps://doi.org/10.48550/arxiv.1905.03038openalex-snapshot
Maximin share allocations on cycles
inferred← citeshttps://doi.org/10.48550/arxiv.1912.08763openalex-snapshot
The Maximin Share Dominance Relation
inferred← citeshttps://doi.org/10.48550/arxiv.2107.11648openalex-snapshot
Fair Allocation with Interval Scheduling Constraints
inferred← citeshttps://doi.org/10.48550/arxiv.2110.11285openalex-snapshot
How to Fairly Allocate Easy and Difficult Chores
inferred← citeshttps://doi.org/10.65109/ayhc6673openalex-snapshot
Guaranteeing Half-Maximin Shares Under Cardinality Constraints
inferred← citeshttps://doi.org/10.65109/cqal8770openalex-snapshot
Multivariate Analysis of Scheduling Fair Competitions
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.