On the public citation graph
Unified Fair Allocation of Goods and Chores via Copies
0 signed · 50 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-030-58285-2_1openalex-snapshot
Two Algorithms for Additive and Fair Division of Mixed Manna
inferredcites →https://doi.org/10.1007/978-3-642-03685-9openalex-snapshot
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
inferredcites →https://doi.org/10.1007/s10107-022-01855-yopenalex-snapshot
Approximate and strategyproof maximin share allocation of chores with ordinal preferences
inferredcites →https://doi.org/10.1007/s10458-021-09517-7openalex-snapshot
Maximin fairness with mixed divisible and indivisible goods
inferredcites →https://doi.org/10.1007/s10458-021-09532-8openalex-snapshot
Fair allocation of indivisible goods and chores
inferredcites →https://doi.org/10.1016/j.jet.2021.105197openalex-snapshot
Strategy-proof exchange under trichotomous preferences
inferredcites →https://doi.org/10.1086/664613openalex-snapshot
The Combinatorial Assignment Problem: Approximate Competitive Equilibrium from Equal Incomes
inferredcites →https://doi.org/10.1137/1.9781611977554.ch13openalex-snapshot
Fair allocation of a multiset of indivisible items
inferredcites →https://doi.org/10.1145/2940716.2940726openalex-snapshot
The Unreasonable Fairness of Maximum Nash Welfare
inferredcites →https://doi.org/10.1145/3033274.3085136openalex-snapshot
Approximation Algorithms for Maximin Fair Division
inferredcites →https://doi.org/10.1145/3219166.3219176openalex-snapshot
Finding Fair and Efficient Allocations
inferredcites →https://doi.org/10.1145/3219166.3219238openalex-snapshot
Fair Allocation of Indivisible Goods
inferredcites →https://doi.org/10.1145/3355902openalex-snapshot
The Unreasonable Fairness of Maximum Nash Welfare
inferredcites →https://doi.org/10.1145/3381525openalex-snapshot
Approximation Algorithms for Maximin Fair Division
inferredcites →https://doi.org/10.1145/3391403.3399526openalex-snapshot
An Improved Approximation Algorithm for Maximin Shares
inferredcites →https://doi.org/10.1145/3457166openalex-snapshot
Weighted Envy-Freeness in Indivisible Item Allocation
inferredcites →https://doi.org/10.1145/3465456.3467555openalex-snapshot
An Algorithmic Framework for Approximating Maximin Share Allocation of Chores
inferredcites →https://doi.org/10.1145/3465456.3467559openalex-snapshot
Fair-Share Allocations for Agents with Arbitrary Entitlements
inferredcites →https://doi.org/10.1145/3485447.3512057openalex-snapshot
Almost (Weighted) Proportional Allocations for Indivisible Chores✱✱
inferredcites →https://doi.org/10.1145/988772.988792openalex-snapshot
On approximately fair allocations of indivisible goods
inferredcites →https://doi.org/10.1146/annurev-economics-080218-025559openalex-snapshot
Fair Division in the Internet Age
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.1609/aaai.v32i1.11463openalex-snapshot
Groupwise Maximin Fair Allocation of Indivisible Goods
inferredcites →https://doi.org/10.1609/aaai.v33i01.33019921openalex-snapshot
Matroid Constrained Fair Allocation Problem
inferredcites →https://doi.org/10.1609/aaai.v35i6.16689openalex-snapshot
Fair and Efficient Allocations under Lexicographic Preferences
inferredcites →https://doi.org/10.1609/aaai.v35i6.16695openalex-snapshot
On the PTAS for Maximin Shares in an Indivisible Mixed Manna
inferredcites →https://doi.org/10.1613/jair.1.13779openalex-snapshot
On Fair Division under Heterogeneous Matroid Constraints
inferredcites →https://doi.org/10.24963/ijcai.2018/13openalex-snapshot
Fair Division Under Cardinality Constraints
inferredcites →https://doi.org/10.24963/ijcai.2018/6openalex-snapshot
Comparing Approximate Relaxations of Envy-Freeness
inferredcites →https://doi.org/10.24963/ijcai.2019/8openalex-snapshot
Fair Allocation of Indivisible Goods and Chores
inferredcites →https://doi.org/10.24963/ijcai.2022/110openalex-snapshot
Approximately EFX Allocations for Indivisible Chores
inferredcites →https://doi.org/10.3982/ecta14564openalex-snapshot
Competitive Division of a Mixed Manna
inferredcites →https://doi.org/10.48550/arxiv.1909.10925openalex-snapshot
Scalable Fair Division for 'At Most One' Preferences
inferredcites →https://doi.org/10.48550/arxiv.2008.00285openalex-snapshot
Dividing Bads is Harder than Dividing Goods: On the Complexity of Fair and Efficient Division of Chores
inferredcites →https://doi.org/10.5281/zenodo.3911429openalex-snapshot
Algorithms for Max-Min Share Fair Allocation of Indivisible Chores
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.4756346openalex-extracted
Efx Allocations for Indivisible Chores: Matching-Based Approach
inferred← citeshttps://doi.org/10.1007/978-981-95-4839-2_12openalex-snapshot
Approximating EFX Through a New Notion of Fairness
inferred← citeshttps://doi.org/10.1016/j.ipl.2025.106577openalex-snapshot
Fair and truthful allocations under leveled valuations
inferred← citeshttps://doi.org/10.1016/j.tcs.2024.115010openalex-snapshot
EFX allocations for indivisible chores: Matching-based approach
inferred← citeshttps://doi.org/10.1137/1.9781611977554.ch13openalex-snapshot
Fair allocation of a multiset of indivisible items
inferred← citeshttps://doi.org/10.1145/3572885.3572887openalex-snapshot
Algorithmic fair allocation of indivisible items
inferred← citeshttps://doi.org/10.1145/3774904.3792300openalex-snapshot
Allocating Chores with Restricted Additive Costs: Achieving EFX, MMS, and Efficiency Simultaneously
inferred← citeshttps://doi.org/10.1609/aaai.v39i13.33499openalex-snapshot
Constrained Fair and Efficient Allocations
inferred← citeshttps://doi.org/10.1613/jair.1.13779openalex-snapshot
On Fair Division under Heterogeneous Matroid Constraints
inferred← citeshttps://doi.org/10.24963/ijcai.2022/110openalex-snapshot
Approximately EFX Allocations for Indivisible Chores
inferred← citeshttps://doi.org/10.3233/faia230284openalex-snapshot
High-Multiplicity Fair Allocation Using Parametric Integer Linear Programming
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.